throbber
Presentation of Petitioner
`Google Inc.
`
`IPR2015-00343, IPR2015-00345, IPR2015-347, IPR2015-348
`
`U.S. Patent Nos. 8,010,988 (Ex. 1022)
`8,205,237 (Ex. 1021)
`8,640,179 (Ex. 1022)
`8,656,441 (Ex. 1022)
`
`Presented by:
`James J. Elacqua
`Skadden, Arps, Slate, Meagher & Flom LLP
`
`1
`
`

`
`Overview
`
`• Only three references are at issue:
`
` Reference
`
`Non-exhaustive
`search
`
`Identifying a
`neighbor
`
`Determining
`an action
`
`Sublinear
`search
`
`Ghias (Ex. 1010)
`
`Iwamura (Ex. 1012)
`
`Conwell (Ex. 1009)
`
`X
`
`X
`
`X
`
`X
`
`X
`
`X
`
`X
`
`X
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`2
`
`

`
`Overview
`
`• Dr. Karypis agrees that the concepts of non-exhaustive search
`and neighbor search were known at the time of filing
`
`Karypis Tr. (Ex. 1020) at 26:4-8
`
`Karypis Tr. (Ex. 1020) at 78:24-79:6
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`3
`
`

`
`Ghias – Overview
`Ex. 1010
`
`• The parties’ dispute with respect to Ghias is confined to three
`limitations:
`
`
`1. Non-exhaustive search
`Identifying a neighbor
`2.
`3. Determining an action
`
`
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`4
`
`

`
`Ghias
`Ghias Discloses A Second Search
`
`• The subsequent searches do not consider all references
`
`
`’988 Google’s Reply (Paper 20) at 6
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`5
`
`

`
`Ghias – Non-Exhaustive Search
`
`
`• The Board construed “non-exhaustive search”
`
`’988 Institution Decision (Paper 6) at 7
`
`’988 Institution Decision (Paper 6) at 7
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`6
`
`

`
`Ghias – Non-Exhaustive Search
`
`
`• Ghias discloses non-exhaustive search
`
`• Ghias self-identifies as a different-than-brute-force (i.e., non-
`exhaustive) search (Ghias, Ex. 1010, at 6:23-28, 7:41-45)
`
`• The Board properly identified the second search taught by Ghias as
`a non-exhaustive search (Ghias, Ex. 1010, at 7:5-8)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`7
`
`

`
`Ghias – Non-Exhaustive Search
`Ghias Self-Identifies Its Searches As Non-Exhaustive
`
`• Ghias discloses search algorithms different than brute force
`search, i.e., non-exhaustive search algorithms
`
`Ghias (Ex. 1010) at 6:23-28
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`8
`
`

`
`Ghias
`Ghias Discloses A Second Search
`
`• The subsequent searches do not consider all references
`
`
`’988 Google’s Reply (Paper 20) at 6
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`9
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`Subsequent Searches Are Non-Exhaustive
`
`• Ghias discloses a second search that only searches the songs
`returned from a first search
`
`
`Ghias (Ex. 1010) at 7:4-8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`10
`
`

`
`Ghias – Non-Exhaustive Search
`Subsequent Searches Are Non-Exhaustive
`
`• The Board correctly identified the second search disclosed in
`Ghias as an example of a non-exhaustive search
`
`’988 Institution Decision (Paper 6) at 12
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`11
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• The parties agree that “identifying a neighbor” and “neighbor
`search” are interchangeable
`• The Board construed both terms
`
`
`
`’988 Institution Decision (Paper 6) at 8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`12
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• Google’s position: nearest neighbor search is a type of
`neighbor search
`• Network-1’s position: nearest neighbor search is not a type of
`neighbor search
`
`
`
`’988 Google’s Reply (Paper 20) at 4
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`13
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• Network-1 reads the Board’s language of “not necessarily exact
`or closest” as “necessarily not exact or closest”
`
`
`
`’988 Institution Decision (Paper 6) at 8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`14
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• Independent claim 15 recites a search “identifying a neighbor”
`
`
`’988 patent (Ex. 1001) at claim 15
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`15
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• The dependent claims specify that the “search identifying a
`neighbor” may be any of the following “nearest neighbor
`searches”:
`
`• Claim 18 – “based on kd-trees”
`
`• Claim 19 – “based on vantage point trees”
`
`• Claim 20 – “based on excluded middle vantage point forest”
`
`• The specification identifies each of these search algorithms as
`forms of “nearest neighbor search”
`(’988 patent at 22:1-6, 22:10-12, 22:18-19)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`16
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`’237 patent (Ex. 1021) at 9:14-15
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`17
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`No Dispute Ghias Discloses Finding A Close Match
`
`• There is no dispute that Ghias identifies “approximately
`matching melodies”
`
`
`Ghias (Ex. 1010) at 2:50-52 & Fig. 1
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`18
`
`

`
`Ghias – Determining an Action
`
`• “Action” refers broadly to any act that the system executes
`
`’988 patent (Ex. 1001) at 4:31-36
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`19
`
`

`
`Ghias – Determining an Action
`
`• Dr. Karypis agrees that the claim term is broad and practically
`limitless
`
`Karypis Tr. (Ex. 1020) at 99:7-15
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`20
`
`

`
`Ghias – Determining an Action
`
`• Ghias displays a list of search results to the user, which would
`include information such as the artist and title so the user can
`identify the desired song
`
`Ghias (Ex. 1010) at 6:60-7:5
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`21
`
`

`
`Iwamura – Overview
`Ex. 1012
`
`• The parties’ dispute with respect to Iwamura is confined to
`three limitations:
`
`
`1. Non-exhaustive search
`Identifying a neighbor
`2.
`3. Sublinear search
`Only in 2 claims of the
`•
`’237 patent
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`22
`
`

`
`Iwamura – Non-Exhaustive Search
`
`
`• The Board construed “non-exhaustive search”
`
`’988 Institution Decision (Paper 6) at 7
`
`’988 Institution Decision (Paper 6) at 7
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`23
`
`

`
`Iwamura – Non-Exhaustive Search
`
`
`• Iwamura discloses non-exhaustive search in two ways
`
`• Iwamura self-identifies as different than a brute force
`(i.e., exhaustive) search (Iwamura, Ex. 1012, at 9:7-11)
`
`• Iwamura only performs comparisons between the query and
`reference when peak notes are aligned, so intermediate positions
`are not compared (Iwamura, Ex. 1012, at 7:52-55)
`
`• The “possible matches” in Iwamura are melody segments, not
`songs
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`24
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura Self-Identifies as a Non-Exhaustive Search
`
`• Iwamura identifies its search as different than a brute force
`(i.e., exhaustive) search
`
`Iwamura (Ex. 1012) at 9:7-11
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`25
`
`

`
`Iwamura – Non-Exhaustive Search
`The “Possible Matches” Are Melody Segments, Not Songs
`
`• Dr. Karypis illustrates the non-exhaustive nature of Iwamura’s
`search algorithm:
`
`Karypis Decl. (Ex. 2005) ¶¶160-162 (modified)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`26
`
`

`
`Iwamura – Non-Exhaustive Search
`The “Possible Matches” Are Melody Segments, Not Songs
`
`• Dr. Karypis confirmed that possible matches are melody
`segments
`
`Karypis Tr. (Ex. 1020) at 147:18-23 & Ex. 9
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`27
`
`

`
`Iwamura – Identifying a Neighbor / Neighbor Search
`
`
`• The parties agree that “identifying a neighbor” and “neighbor
`search” are interchangeable
`• The Board construed the terms
`
`
`
`’988 Institution Decision (Paper 6) at 8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`28
`
`

`
`Iwamura – Identifying a Neighbor / Neighbor Search
`
`
`• Iwamura teaches identifying similar works by returning the
`reference melody with the least difference
`
`
`
`Iwamura (Ex. 1012) at 7:52-55
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`29
`
`

`
`Conwell
`Ex. 1009
`
`• The parties’ dispute with respect to Conwell is confined to two
`limitations:
`
`
`
`Identifying a neighbor
`1.
`2. Non-exhaustive search
`
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`30
`
`

`
`Conwell – Neighbor Search
`
`• Conwell teaches identifying similar, but not exact, works by
`selecting from well-known hashing algorithms
`
`Conwell (Ex. 1009) at 4:64-5:3
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`31
`
`

`
`Conwell – Neighbor Search
`
`• Conwell teaches identifying similar, but not exact, works using a
`database query:
`
`Conwell (Ex. 1009) at Abstract
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`32
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• The parties agree that “identifying a neighbor” and “neighbor
`search” are interchangeable
`• The Board construed both terms
`
`
`
`’988 Institution Decision (Paper 6) at 8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`33
`
`

`
`Conwell – Neighbor Search
`
`• The Board correctly concluded that Conwell identifies
`neighboring works
`
`’179 Institution Decision (Paper 6) at 11
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`34
`
`

`
`Conwell – Non-Exhaustive Search
`
`• Conwell discloses non-exhaustive search
`
`• Conwell discloses a database query (“look-up table”)
`(Conwell, Ex. 1009, at 3:43-44)
`
`• Database queries are non-exhaustive
`(’441 patent at 20:67-21:1)
`
`
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`35
`
`

`
`Conwell – Non-Exhaustive Search
`
`• exhaustive search = brute force search = linear search
`• Patentee advised readers that database queries ran faster than a
`linear search (i.e., an exhaustive search)
`
`’441 patent (Ex. 1001) at 20:67-21:1
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`36
`
`

`
`CLAIM CONSTRUCTION
`
`“Identifying a Neighbor” / “Neighbor Search”
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`37
`
`

`
`Claim Construction – Identifying a Neighbor
`
`
`• Network-1’s interpretation violates the plain meaning of the
`Board’s construction
`
`
`
`’988 Institution Decision (Paper 6) at 8
`• It also runs contrary to the purpose of the patents:
`to identify a work
`
`
`’179 patent (Ex. 1001) at 1:37-40
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`38
`
`

`
`CLAIM CONSTRUCTION
`
`“Approximate Nearest Neighbor Search”
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`39
`
`

`
`Claim Construction – Approximate Nearest Neighbor search
`
`
`• The Board previously rejected Network-1’s argument
`
`
`’237 Institution Decision (Paper 6) at 9
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`40
`
`

`
`Claim Construction – Approximate Nearest Neighbor search
`
`• Construing “approximate nearest neighbor search” as requiring
`sublinearity would render the word “sublinear” superfluous
`
`
`’237 patent (Ex. 1001) at Claim 33
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`41
`
`

`
`
`
`GHIAS
`GHIAS
`
`Overview
`Overview
`
`|PR2015—00343, |PR2015—00345, |PR2015—00347, |PR2015-00348
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`42
`42
`
`

`
`Ghias – Overview
`Ex. 1010
`
`• Ghias is applicable to the following patents and claims:
`
`Patent No.
`
` Claims
`
`8,010,988
`
`15-17, 21-26, 28, 31, 51-52
`
`8,205,237
`
`9-11, 13-15, 23-24
`
`8,640,179
`
`1-3, 8, 10-12, 13-14, 18-19, 21-24, 25-27, 29, 31, 34-37
`
`8,656,441
`
`1-3, 8, 10-12, 13-14, 18-19, 21-24, 25-27, 29-30
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`43
`
`

`
`GHIAS
`
`Non-Exhaustive Search
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`44
`
`

`
`Ghias – Non-Exhaustive Search
`Ghias Self-Identifies Its Searches As Non-Exhaustive
`
`• Ghias also discloses combining all songs into a single reference
`file
`
`Ghias (Ex. 1010) at 7:41-45
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`45
`
`

`
`GHIAS
`
`Identifying a Neighbor / Neighbor Search
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`46
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`
`
`• Ghias discloses identifying a neighbor and performing a
`neighbor search
`
`• Under the Board’s construction, Ghias discloses a “neighbor
`search” because there is no dispute that it locates near matches
`(Ghias, Ex. 1010, at 2:50-52)
`
`• Even under Network-1’s interpretation, Ghias discloses a “neighbor
`search” because it does not always locate the closest match,
`because the second search does not consider all references
`(Ghias, Ex. 1010, at 7:5-7)
`
`
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`47
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`No Guarantee of the Closest Match
`
`• Even under Network-1’s interpretation, Ghias' subsequent
`searches do not always consider—much less identify—the
`closest match
`
`
`Ghias (Ex. 1010) at 7:5-7
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`48
`
`

`
`Ghias – Non-Exhaustive Search
`No Guarantee of the Closest Match
`
`• There are no restrictions on the new query, and it can be a
`different part of the song or even a different song entirely
`
`Karypis Tr. (Ex. 1020) at 172:5-15
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`49
`
`

`
`Ghias – Non-Exhaustive Search
`No Guarantee of the Closest Match
`
`• Dr. Karypis testifies that the new query must be different from
`the first query
`
`Karypis Decl. (Ex. 2005) ¶287
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`50
`
`

`
`Ghias – Non-Exhaustive Search
`No Guarantee of the Closest Match
`
`• The “new query” (Search 2), must be different from the original
`query (Search 1), and can yield entirely different search results
`
`Karypis Decl. (Ex. 2005) ¶287
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`51
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`No Guarantee of the Closest Match
`
`• The subsequent searches do not consider all references, and
`thus do not always find the “closest” match
`
`’988 Google’s Reply (Paper 20) at 6
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`52
`
`

`
`Ghias – Identifying a Neighbor / Neighbor Search
`No Guarantee of the Closest Match
`
`• Further, Ghias cannot always identify the closest match in a
`group of close matches
`
`
`Karypis Tr. (Ex. 1020) at 165:9-14
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`Google’s Reply (Paper 20) at 10
`53
`
`

`
`GHIAS
`
`Determining an Action
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`54
`
`

`
`Ghias – Determining an Action
`
`• Dr. Karypis agrees that Ghias' display of song titles constitutes
`“determining an action”
`
`Karypis Tr. (Ex. 1020) at 97:19-98:4
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`55
`
`

`
`Ghias – Determining an Action
`
`• The specification lists “retrieving further information” as an
`action
`
`‘988 patent (Ex. 1001) at 4:31-36
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`56
`
`

`
`
`
`IWAMURA
`IWAMURA
`
`Overview
`Overview
`
`|PR2015—00343, |PR2015—00345, |PR2015—00347, |PR2015-00348
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`57
`57
`
`

`
`Iwamura – Overview
`Ex. 1012
`
`• Iwamura is applicable to the following patents and claims:
`
`Patent No.
`
` Claims
`
`8,010,988
`
`15-17, 21-26, 28, 31, 52
`
`8,205,237
`
`1, 3-5, 7-9, 11-13, 15-16, 21-25, 26-27, 29-30, 33, 34-35, 37-38
`
`8,640,179
`
`N/A
`
`8,656,441
`
`N/A
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`58
`
`

`
`IWAMURA
`
`Non-Exhaustive Search
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`59
`
`

`
`Iwamura – Non-Exhaustive Search
`The “Possible Matches” Are Melody Segments, Not Songs
`
`• After calculating the absolute difference for one segment,
`Iwamura shifts to the next segment with aligned peak notes
`
`Iwamura (Ex. 1012) at 7:52-55
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`Ex. 1022-60
`
`

`
`Iwamura – Non-Exhaustive Search
`The “Possible Matches” Are Melody Segments, Not Songs
`
`• Iwamura returns the subsegment with the lowest absolute
`difference
`
`Karypis Tr. (Ex. 1020) at 113:11-114:5
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`61
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Dr. Moulin testified that the “possible matches” are melody
`segments
`
`Moulin Tr. (Ex. 2006) at 379:2-13
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`62
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Network-1 admits that Iwamura skips intermediate
`comparisons between aligned peak notes
`
`‘988 N-1 Response (Paper 17) at 28-30
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`63
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Network-1 further admits that Iwamura’s peak note search
`reduces the total number of comparisons
`
`’988 N-1 Response (Paper 17) at 27-28
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`64
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Iwamura increases search speed by only performing
`comparisons where peaks align
`
`Karypis Tr. (Ex. 1020) Ex. 9 (modified)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`65
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Dr. Karypis concedes that some reference melody segments are
`not compared to the query
`
`Karypis Tr. (Ex. 1020) at 132:16-133:1, 134:5-135:10
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`66
`
`

`
`Iwamura – Non-Exhaustive Search
`Iwamura’s Peak Search Does Not Consider All Melody Segments
`
`• Iwamura discloses additional embodiments that skip
`“unimportant” segments and reduce the number of melody
`segments considered
`
`Iwamura (Ex. 1012) at 9:36-51 & Fig. 14
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`67
`
`

`
`IWAMURA
`
`Identifying a Neighbor
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`68
`
`

`
`Iwamura – Identifying a Neighbor
`
`
`• Iwamura discloses identifying a neighbor and performing a
`neighbor search
`
`• Under the Board’s construction, Iwamura discloses “identifying a
`neighbor” because it locates a close match (Iwamura, Ex. 1012, at
`7:54-55)
`
`• Even under Network-1’s interpretation, Iwamura discloses
`“identifying a neighbor” because it does not always locate the
`“exact or closest” match, because not all melody segments are
`considered (Iwamura, Ex. 1012, at 7:52-55)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`69
`
`

`
`Iwamura – Identifying a Neighbor
`Network-1’s Interpretation
`
`• Iwamura’s peak search skips comparisons, so it does not
`necessarily even consider the closest match
`
`Closest match
`
`Karypis Tr. (Ex. 1020) 132:15-133:1 & Ex. 9 (modified)
`70
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`

`
`Iwamura – Identifying a Neighbor
`Network-1’s Interpretation
`
`• Dr. Karypis agrees that Comparison No. 12, which would
`identify the closest match, is never performed
`
`Karypis Tr. (Ex. 1020) 132:24-133:1, 134:5-17)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`71
`
`

`
`Iwamura – Identifying a Neighbor
`Network-1’s Interpretation
`
`• Because Iwamura skips “unimportant portions” of a reference,
`it does not always find the closest match
`
`Iwamura (Ex. 1012) at 9:44-51 & Fig. 14
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`72
`
`

`
`Iwamura – Identifying a Neighbor
`Network-1’s Interpretation
`
`• Because Iwamura’s peak note search does not always find the
`best segment, it also does not always find the best song
`
`Query: *5 4 3 2 1
`
`Reference 1: *6 5 4 3 2 1
`*5 4 3 2 1
`
`Best match
`is never
`compared
`
`Difference 1 2 1 0 1
`
`= 5
`
`Reference 2: 0 *5 4 3 2 2
`*5 4 3 2 1
`
`Difference
`
`0 0 0 0 1
`
`= 1
`
`‘988 Google’s Reply (Paper 20) at 21-22
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`73
`
`

`
`IWAMURA
`
`Sublinear Search (IPR2015-00345 only)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`74
`
`

`
`Iwamura – Sublinear Search
`
`• The Board’s construction refers to a “less than linear
`relationship to the size of the data set to be searched”
`
`’237 Institution Decision (Paper 6) at 7
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`75
`
`

`
`Iwamura – Sublinear Search
`
`• The challenged patents refer to disk space when addressing the
`size of the database
`
`
`
`’237 patent (Ex. 1001) at 21:24-25
`• Dr. Karypis agrees it is an appropriate interpretation of size
`
`Karypis Tr. (Ex. 1020) at 105:25-106:6
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`76
`
`

`
`Iwamura – Sublinear Search
`
`• Dr. Moulin cited the Boyer-Moore algorithm as an example of
`sublinear search disclosed in Iwamura
`
`’237 Moulin Decl. (Ex. 1004) ¶ 72
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`77
`
`

`
`Iwamura – Sublinear Search
`
`• In another example, Iwamura discloses storing reference songs
`in two formats: low resolution MIDI, and high resolution
`waveform (.wav)
`
`Iwamura (Ex. 1012) at 3:57-4:1
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`78
`
`

`
`Iwamura – Sublinear Search
`
`• Adding a .wav file to a database containing a single MIDI file
`will greatly increase the size of the data set, but only double
`the search time
`
`’237 Google’s Reply (Paper 20) at 17-18
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`79
`
`

`
`Iwamura – Sublinear Search
`
`• Iwamura discloses an embodiment storing up to 64 notes per
`reference song (even if the song is longer), independent of the
`file type
`
`Iwamura (Ex. 1012) at 5:29-30
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`80
`
`

`
`Iwamura – Sublinear Search
`
`• The distance between peak notes would be a function of the
`music, not the file type, so the search time is independent of
`file type
`
`Karypis Tr. (Ex. 1020) at 126:10-18
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`81
`
`

`
`
`
`
`CONWELL
`CONWELL
`
`Overview
`Overview
`
`|PR2015—00343, |PR2015—00345, |PR2015—00347, |PR2015-00348
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`82
`82
`
`

`
`Conwell
`Ex. 1009
`
`• Conwell is applicable to the following patents and claims:
`
`Patent No.
`
` Claims
`
`8,010,988
`
`N/A
`
`8,205,237
`
`N/A
`
`8,640,179
`
`1-3, 6, 8-12, 13-14, 19, 21-24, 25-26, 30-31, 34-37
`
`8,656,441
`
`1-3, 6, 8-12, 13-14, 19, 21-24, 25-26, 30
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`83
`
`

`
`CONWELL
`
`Neighbor Search
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`84
`
`

`
`Conwell – Neighbor Search
`
`• Network-1 does not dispute that Conwell discloses identifying a
`neighbor of the query work
`
`’179 N-1 Response (Paper 17) at 17
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`85
`
`

`
`Conwell – Neighbor Search
`
`• The claim language recites identifying an electronic work, and
`does not exclude exactly matching features
`
`’179 patent (Ex. 1001) at Claim 1
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`86
`
`

`
`Conwell – Neighbor Search
`
`• The specification makes clear that the purpose of the invention
`is to identify a work
`
`’179 patent (Ex. 1001) at 1:37-38
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`87
`
`

`
`CONWELL
`
`Non-Exhaustive Search
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`88
`
`

`
`Conwell – Non-Exhaustive Search
`
`• Conwell discloses a database (look-up table) that returns the
`URL corresponding to an identifier
`
`Conwell (Ex. 1009) at 3:43-50
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`89
`
`

`
`Conwell – Non-Exhaustive Search
`
`• Dr. Karypis concedes that a “binary search” is a type of non-
`exhaustive search
`
`Karypis Tr. (Ex. 1020) at 186:6-8
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`90
`
`

`
`Exemplary Claims
`
`
`• ’988 patent (IPR2015-00347)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`91
`
`

`
`Exemplary Claims
`
`
`• ’237 patent (IPR2015-00345)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`92
`
`

`
`Exemplary Claims
`
`
`• ’179 patent (IPR2015-00343)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`93
`
`

`
`Exemplary Claims
`
`
`• ’441 patent (IPR2015-00348)
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`94
`
`

`
`• Brute Force Search = Exhaustive Search
`
`Karypis Decl. (Ex. 2005) ¶82
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`95
`
`

`
`• Linear Search = Exhaustive Search
`
`Karypis Tr. (Ex. 1020) at 66:6-12, 69:22-70:20
`
`IPR2015-00343, IPR2015-00345, IPR2015-00347, IPR2015-00348
`
`96

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket