{"data":{"patentNumber":"US-EXAMPLE-0000001","priorityDate":"2017-06-01","priorityDateCheck":{"used":"2017-06-01","source":"input","inputDate":"2017-06-01","googlePatentsDate":null,"disagreement":false},"cutoff":"published strictly before 2017-06-01","disclaimer":"This is not legal advice. The evidence is abstract/metadata-level only (titles and abstracts, not full text, figures or file histories); review of the full text of each reference by a registered patent practitioner is required before any legal use. Probabilities are rule-based estimates, not predictions of a tribunal's decision.","provenance":{"claims":"supplied","claimSegmentation":"deterministic: claim numbering, transitional phrase, semicolons, colons and wherein clauses; dependent claims inherit parent elements","queries":"model-written, multilingual"},"patent":null,"verdict":"INSUFFICIENT_EVIDENCE","abstentionReason":"No reference or combination of up to 3 references discloses every element of claim 1 in its title or abstract.","invalidationProbability":45,"anyClaimInvalidationProbability":45,"probabilityBasis":"Minimum over the supplied claims (all must fall); the weakest claim is 1.","confidence":"MEDIUM","claims":[{"claimNo":1,"dependsOn":[],"elements":[{"id":"1.1","kind":"preamble","required":true,"text":"A method of approximate nearest neighbor search","fromClaim":1},{"id":"1.2","kind":"limitation","required":true,"text":"hashing each data vector with a plurality of locality-sensitive hash functions to generate hash codes","fromClaim":1},{"id":"1.3","kind":"limitation","required":true,"text":"storing the vectors in hash tables indexed by the hash codes","fromClaim":1},{"id":"1.4","kind":"limitation","required":true,"text":"and, for a query vector, retrieving candidate vectors from the buckets matching the query's hash codes and ranking the candidates by exact distance to the query vector","fromClaim":1}],"textCoverage":0.95,"coverage":{"required":4,"covered":3,"partial":1,"missing":0,"fraction":0.75},"anticipation":[],"combinations":[],"bestPath":{"comboId":"C1:R7","type":"partial","referenceIds":["R7"],"references":[{"id":"R7","title":"Locality Sensitive Hashing with Extended Partitioning Boundaries","publicationDate":"2013-06"}],"probability":45,"components":{"completeness":0.67,"strength":0.838,"referencesNeeded":1,"dateMargin":1,"evidenceLevel":0.85,"adversary":0.95,"motivation":1,"parse":1},"elementsCovered":3,"elementsPartial":1,"elementsMissing":0,"missingElementIds":["1.4"],"perElement":[{"elementId":"1.1","referenceId":"R7","level":"explicit"},{"elementId":"1.2","referenceId":"R7","level":"explicit"},{"elementId":"1.3","referenceId":"R7","level":"inherent"},{"elementId":"1.4","referenceId":"R7","level":"partial"}],"evidenceLevel":"abstract","marginDays":1432,"motivationToCombine":null},"invalidationProbability":45,"cappedByAncestorClaim":null}],"best102":null,"best103":[],"probabilityComponents":{"claimNo":1,"completeness":0.67,"strength":0.838,"referencesNeeded":1,"dateMargin":1,"evidenceLevel":0.85,"adversary":0.95,"motivation":1,"parse":1},"claimChart":[{"claimNo":1,"elements":[{"elementId":"1.1","kind":"preamble","required":true,"text":"A method of approximate nearest neighbor search","fromClaim":1,"verbatimClaimText":true,"references":[{"referenceId":"R1","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"Dynamic Multi-Probe LSH: an I/O Efficient Index Structure for Approximate Nearest Neighbor Search","translationEn":null,"translationNote":null,"quoteLocation":"title","rationale":"The title expressly describes an index structure for approximate nearest neighbor search."},{"referenceId":"R10","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"A reliable order-statistics-based approximate nearest neighbor search algorithm","translationEn":null,"translationNote":null,"quoteLocation":"title","rationale":"The title expressly concerns ANN search."},{"referenceId":"R11","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"Approximate Nearest Neighbor (ANN) search in high dimensional space","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The abstract expressly addresses ANN search."},{"referenceId":"R12","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"Hashing-based approximate nearest neighbor (ANN) search in huge databases","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The abstract expressly concerns ANN search."},{"referenceId":"R3","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"approximate nearest neighbor (ANN) search based on hashing techniques","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The abstract expressly addresses ANN search using hashing."},{"referenceId":"R4","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit"],"counselConcedes":null,"contested":false,"quote":"Anti-sparse coding for approximate nearest neighbor search","translationEn":null,"translationNote":null,"quoteLocation":"title","rationale":"The title expressly concerns approximate nearest neighbor search."}]},{"elementId":"1.2","kind":"limitation","required":true,"text":"hashing each data vector with a plurality of locality-sensitive hash functions to generate hash codes","fromClaim":1,"verbatimClaimText":true,"references":[{"referenceId":"R7","disclosure":"explicit","ensembleDisclosure":"explicit","sampleDisclosures":["explicit","explicit","explicit"],"counselConcedes":"explicit","contested":false,"quote":"binary codes are determined by a set of hash functions","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"A set of LSH hash functions generates binary hash codes for the data."},{"referenceId":"R1","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"dynamically increasing the number of hash functions during the index construction","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The abstract applies multiple LSH hash functions to the data during indexing. It does not expressly describe generating per-vector hash codes."},{"referenceId":"R10","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"the proposed algorithm corresponds to locality sensitive hashing in the space of directions, with hashing based on the order of components","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Data vectors are classified by an LSH-like hash. A plurality of LSH functions is not disclosed."},{"referenceId":"R11","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"the distance between the compound hash keys of two points","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Compound LSH hash keys are computed for points, suggesting multiple hash functions without expressly stating it."},{"referenceId":"R12","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"Locality Sensitive Hashing and Spectral Hashing, construct hash functions based on random or principal projections","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"LSH hash functions are mentioned only as background."},{"referenceId":"R13","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"a large number of hash functions require lots of hash computation time","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Multiple LSH hash functions are referenced. Generation of hash codes is not expressly stated."}]},{"elementId":"1.3","kind":"limitation","required":true,"text":"storing the vectors in hash tables indexed by the hash codes","fromClaim":1,"verbatimClaimText":true,"references":[{"referenceId":"R7","disclosure":"inherent","ensembleDisclosure":"explicit","sampleDisclosures":["explicit","explicit","explicit"],"counselConcedes":"partial","contested":true,"quote":"Binary code locality-sensitive hashing distributes a data set into buckets labeled with binary code","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Data are stored in buckets labeled by, and thus indexed by, the hash codes."},{"referenceId":"R1","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"LSH requires a large number of hash tables to achieve good search quality","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The abstract refers to storing objects in LSH hash tables made of buckets. Indexing of the tables by hash codes is only implied."},{"referenceId":"R11","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"data points that are close to each other according to the distance measure can be stored locally in an index file","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Points are stored in an index file ordered by hash keys rather than in hash tables."},{"referenceId":"R13","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"each point may be mapped to multiple adjacent buckets in each hash table","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Points are stored in buckets of hash tables, though in a boundary-expanded manner."},{"referenceId":"R8","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"employ multiple complementary hash tables","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Multiple hash tables are used, but they are learned rather than LSH-based."}]},{"elementId":"1.4","kind":"limitation","required":true,"text":"and, for a query vector, retrieving candidate vectors from the buckets matching the query's hash codes and ranking the candidates by exact distance to the query vector","fromClaim":1,"verbatimClaimText":true,"references":[{"referenceId":"R1","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"looking up multiple buckets in each table","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Buckets are looked up at query time. The abstract does not mention ranking candidates by exact distance."},{"referenceId":"R10","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"The query is itself classified, and the search starts from the selected cone and proceeds to neighboring ones.","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"The query's matching partition is searched. Ranking by exact distance is not stated."},{"referenceId":"R11","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"In order to guarantee the quality of returned results, sufficient objects should be verified","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Candidate objects are verified. Retrieval from matching buckets and ranking by exact distance are not expressly described."},{"referenceId":"R2","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"it intelligently probes multiple buckets that are likely to contain query results in a hash table","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Buckets in a hash table are probed to find query results. Exact-distance ranking is not stated."},{"referenceId":"R7","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial","partial","partial"],"counselConcedes":"partial","contested":false,"quote":"It requires to check neighboring buckets while finding nearest ones.","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Buckets are checked during the query search. Ranking candidates by exact distance is not disclosed."},{"referenceId":"R8","disclosure":"partial","ensembleDisclosure":"partial","sampleDisclosures":["partial"],"counselConcedes":null,"contested":false,"quote":"given a query, its true nearest neighbors missed from the active bucket of one hash table are more likely to be found in the active bucket of the next hash table","translationEn":null,"translationNote":null,"quoteLocation":"abstract","rationale":"Neighbors are retrieved from the query's active buckets across tables. Exact-distance ranking is not stated."}]}]}],"references":[{"id":"R1","source":"hal","sourceId":"834497","doi":"10.1007/978-3-642-40285-2_7","title":"Dynamic Multi-Probe LSH: an I/O Efficient Index Structure for Approximate Nearest Neighbor Search","altTitle":null,"publicationDate":"2013-08-26","daysBeforePriority":1375,"language":"en","venue":"HAL","authors":["Shaoyi Yin","Mehdi Badr","Dan Vodislav"],"url":"https://hal.science/hal-00834497v1","evidenceLevel":"abstract","rankScore":3.133},{"id":"R2","source":"openalex","sourceId":"W2142040641","doi":"10.1145/1459359.1459388","title":"A posteriori multi-probe locality sensitive hashing","altTitle":null,"publicationDate":"2008-10-26","daysBeforePriority":3140,"language":"en","venue":"ACM International Conference on Multimedia (ACM MM)","authors":["Alexis Joly","Olivier Buisson"],"url":"https://doi.org/10.1145/1459359.1459388","evidenceLevel":"abstract","rankScore":2.967},{"id":"R3","source":"openalex","sourceId":"W2963213486","doi":"10.1109/jproc.2015.2487976","title":"Learning to Hash for Indexing Big Data—A Survey","altTitle":null,"publicationDate":"2015-12-18","daysBeforePriority":531,"language":"en","venue":"Proceedings of the IEEE","authors":["Jun Wang","Wei Liu","Sanjiv Kumar","Shih‐Fu Chang"],"url":"https://doi.org/10.1109/jproc.2015.2487976","evidenceLevel":"abstract","rankScore":2.883},{"id":"R4","source":"arxiv","sourceId":"1110.3767v2","doi":null,"title":"Anti-sparse coding for approximate nearest neighbor search","altTitle":null,"publicationDate":"2011-10-17","daysBeforePriority":2054,"language":"en","venue":"arXiv","authors":["Hervé Jégou","Teddy Furon","Jean-Jacques Fuchs"],"url":"http://arxiv.org/abs/1110.3767v2","evidenceLevel":"abstract","rankScore":2.8},{"id":"R5","source":"openalex","sourceId":"W1870428314","doi":"10.48550/arxiv.1408.2927","title":"Hashing for Similarity Search: A Survey","altTitle":null,"publicationDate":"2014-08-13","daysBeforePriority":1023,"language":"en","venue":"arXiv (Cornell University)","authors":["Jingdong Wang","Heng Tao Shen","Jingkuan Song","Jianqiu Ji"],"url":"http://arxiv.org/abs/1408.2927","evidenceLevel":"abstract","rankScore":2.717},{"id":"R6","source":"openalex","sourceId":"W156296397","doi":null,"title":"Hashing, searching, sketching","altTitle":null,"publicationDate":"2006-01-01","daysBeforePriority":4169,"language":"en","venue":null,"authors":["Rajeev Motwani","Rina Panigrahy‎"],"url":"https://www.amazon.com/Hashing-Searching-Sketching-Rina-Panigrahy/dp/3838312996","evidenceLevel":"abstract","rankScore":2.7},{"id":"R7","source":"crossref","sourceId":"10.4028/www.scientific.net/amm.321-324.804","doi":"10.4028/www.scientific.net/amm.321-324.804","title":"Locality Sensitive Hashing with Extended Partitioning Boundaries","altTitle":null,"publicationDate":"2013-06","daysBeforePriority":1432,"language":"en","venue":"Applied Mechanics and Materials","authors":["Keon Myung Lee"],"url":"https://doi.org/10.4028/www.scientific.net/amm.321-324.804","evidenceLevel":"abstract","rankScore":2.7},{"id":"R8","source":"openalex","sourceId":"W2158169729","doi":"10.1109/iccv.2011.6126424","title":"Complementary hashing for approximate nearest neighbor search","altTitle":null,"publicationDate":"2011-11-01","daysBeforePriority":2039,"language":"en","venue":"IEEE/CVF International Conference on Computer Vision (ICCV)","authors":["Hao Xu","Jingdong Wang","Zhu Li B","Gang Zeng","Shipeng Li"],"url":"https://doi.org/10.1109/iccv.2011.6126424","evidenceLevel":"abstract","rankScore":2.65},{"id":"R9","source":"openalex","sourceId":"W2294518132","doi":"10.14778/2850469.2850470","title":"Query-aware locality-sensitive hashing for approximate nearest neighbor search","altTitle":null,"publicationDate":"2015-09-01","daysBeforePriority":639,"language":"en","venue":"Proceedings of the VLDB Endowment","authors":["Qiang Huang","Jianlin Feng","Yikai Zhang","Qiong Fang","Wilfred Ng"],"url":"https://doi.org/10.14778/2850469.2850470","evidenceLevel":"abstract","rankScore":2.65},{"id":"R10","source":"arxiv","sourceId":"1509.03453v2","doi":null,"title":"A reliable order-statistics-based approximate nearest neighbor search algorithm","altTitle":null,"publicationDate":"2015-09-11","daysBeforePriority":629,"language":"en","venue":"arXiv","authors":["Luisa Verdoliva","Davide Cozzolino","Giovanni Poggi"],"url":"http://arxiv.org/abs/1509.03453v2","evidenceLevel":"abstract","rankScore":2.65},{"id":"R11","source":"crossref","sourceId":"10.14778/2732939.2732947","doi":"10.14778/2732939.2732947","title":"SK-LSH","altTitle":null,"publicationDate":"2014-05","daysBeforePriority":1097,"language":"en","venue":"Proceedings of the VLDB Endowment","authors":["Yingfan Liu","Jiangtao Cui","Zi Huang","Hui Li","Heng Tao Shen"],"url":"https://doi.org/10.14778/2732939.2732947","evidenceLevel":"abstract","rankScore":2.633},{"id":"R12","source":"openalex","sourceId":"W2074668987","doi":"10.1109/tpami.2012.48","title":"Semi-Supervised Hashing for Large-Scale Search","altTitle":null,"publicationDate":"2012-02-07","daysBeforePriority":1941,"language":"en","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","authors":["Jun Wang","Sanjiv Kumar","Shih‐Fu Chang"],"url":"https://doi.org/10.1109/tpami.2012.48","evidenceLevel":"abstract","rankScore":2.55},{"id":"R13","source":"openalex","sourceId":"W2065169802","doi":"10.1109/iscslp.2012.6423463","title":"Boundary-expanding locality sensitive hashing","altTitle":null,"publicationDate":"2012-12-01","daysBeforePriority":1643,"language":"en","venue":"International Symposium on Chinese Spoken Language Processing (ISCSLP)","authors":["Qiang Wang","Zhiyuan Guo","Gang Liu","Jun Hai Guo"],"url":"https://doi.org/10.1109/iscslp.2012.6423463","evidenceLevel":"abstract","rankScore":2.533},{"id":"R14","source":"jstage","sourceId":"https://www.jstage.jst.go.jp/article/iteac/2011/0/2011_3-1-1/_article","doi":"10.11485/iteac.2011.0_3-1-1","title":"3-1 近似最近傍探索のための直積量子化コードブック作成手法に関する一検討(第3部門符号化・復号化)","altTitle":"3-1 A Study on the Codebook Construction Method for Product Quantization Based Approximate Nearest Neighbor Search","publicationDate":"2011","daysBeforePriority":1979,"language":"ja","venue":"PROCEEDINGS OF THE ITE ANNUAL CONVENTION","authors":["内田 祐介","高木 幸一","酒澤 茂之"],"url":"https://www.jstage.jst.go.jp/article/iteac/2011/0/2011_3-1-1/_article","evidenceLevel":"title-only","rankScore":1.167},{"id":"R15","source":"jstage","sourceId":"https://www.jstage.jst.go.jp/article/jjsai/25/6/25_761/_article","doi":"10.11517/jjsai.25.6_761","title":"高次元空間における近似最近傍探索技術の進歩とその展望(<特集>大規模画像データ処理)","altTitle":"Advances and Prospect of Nearest Neighbor Search in High Dimensional Space( Analysis of Very Large Scale Image Collections)","publicationDate":"2010","daysBeforePriority":2344,"language":"ja","venue":"Journal of the Japanese Society for Artificial Intelligence","authors":["和田 俊和"],"url":"https://www.jstage.jst.go.jp/article/jjsai/25/6/25_761/_article","evidenceLevel":"title-only","rankScore":1.056},{"id":"R16","source":"crossref","sourceId":"10.3799/dqkx.2010.057","doi":"10.3799/dqkx.2010.057","title":"GSHR-Tree：一种基于动态空间槽和哈希表的网格环境下的空间索引树","altTitle":null,"publicationDate":"2010","daysBeforePriority":2344,"language":"zh","venue":"Earth Science-Journal of China University of Geosciences","authors":["占龙 陈"],"url":"https://doi.org/10.3799/dqkx.2010.057","evidenceLevel":"title-only","rankScore":0.667}],"gaps":["Claim 1 element 1.4 is only partially disclosed by the best path: \"and, for a query vector, retrieving candidate vectors from the buckets matching the query's hash codes and ranking the candidates by exact distance to the query vector\""],"whatWouldChange":["Claim 1: a pre-priority reference expressly disclosing \"and, for a query vector, retrieving candidate vectors from the buckets matching the query's hash codes and ranking the candidates by exact distance to the query vector\" (or the full text of R7 showing it).","Full-text review of the top references (figures, examples, definitions) and a search of patent literature and non-patent literature not indexed here."],"searchCoverage":{"searchesRun":31,"searchesSucceeded":31,"sources":[{"source":"openalex","attempted":11,"succeeded":11,"failed":0,"returned":104,"languages":["en","ja","zh","de"]},{"source":"crossref","attempted":7,"succeeded":7,"failed":0,"returned":105,"languages":["en","zh","de"]},{"source":"arxiv","attempted":3,"succeeded":3,"failed":0,"returned":23,"languages":["en"]},{"source":"europepmc","attempted":3,"succeeded":3,"failed":0,"returned":25,"languages":["en"]},{"source":"hal","attempted":4,"succeeded":4,"failed":0,"returned":1,"languages":["en","de"]},{"source":"jstage","attempted":3,"succeeded":3,"failed":0,"returned":15,"languages":["ja"]}],"languages":["en","ja","zh","de"],"sourcesWithoutSuccess":[],"sourcesPartiallyFailed":[],"degraded":false,"rawResults":273,"droppedByDateCutoff":{"late":0,"undated":0,"ambiguous":4},"uniqueCandidates":216,"note":"Publication must be strictly before priorityDate. Every returned date is re-checked in code; undated works and works whose date period (month/year precision) contains the priority date are dropped."},"ensemble":{"samplesRequested":3,"samplesCompleted":3,"narrowSamples":2,"rejudgedPairs":4,"agreement":1,"singleSampleCells":0,"adversaryRan":true,"counselDowngrades":1,"counselDistinctions":["Ranking the retrieved candidate vectors by exact distance to the query vector; R7's abstract discloses no exact-distance re-ranking step.","Storing the vectors in a plurality of hash tables; R7 describes only buckets labeled with binary codes, with no disclosure of multiple tables.","Retrieving candidates specifically from buckets matching the query's hash codes across the hash tables; R7 focuses on extended partition boundaries and checking neighboring buckets rather than this claimed retrieval scheme."],"mappings":{"proposed":45,"verified":45,"dropped":{"unknownReference":0,"unknownElement":0,"quoteNotFound":0,"missingTranslation":0,"notRequested":0}},"llmCalls":5,"llmCallsFailed":0}},"_provenance":{"version":"writerslogic-provenance/1","issuer":"did:web:agents.writerslogic.com","verify":{"endpoint":"POST /api/v1/verify-provenance","did":"did:web:agents.writerslogic.com"},"manifest":{"format":"application/json","instance_id":"xmp:iid:d9c70dc6-2542-4509-90d5-0f52fcc2e03b","claim_generator_info":[{"name":"WritersLogic x402 Agent Hub","version":"2.0.0"}],"title":"Global Prior-Art Patent Invalidator","assertions":[{"label":"c2pa.actions.v2","data":{"actions":[{"action":"c2pa.created","when":"2026-11-04T20:47:15.700Z","softwareAgent":{"name":"writerslogic-agent-hub/prior-art-invalidator","version":"2.0.0"},"digitalSourceType":"http://cv.iptc.org/newscodes/digitalsourcetype/trainedAlgorithmicMedia","parameters":{"endpoint":"POST /api/v1/find-prior-art","inputDigest":{"alg":"sha256","hash":"c09169a0e75b6235648ade51439a919c00f10d074563fdc53930500ec107eda3","canonicalization":"JCS"}}}]}},{"label":"c2pa.hash.data","data":{"alg":"sha256","hash":"c6d29d78eea31ebd727e90ff9ee4c023a74320b1dd554b2fc669b2a3a3ac99cf","name":"jcs-canonical-json(data)"}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+table+buckets&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+table+buckets&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:52.949Z"},"hash":{"alg":"sha256","hash":"da38bc5b3b5695877e3c726cf3d49936e0ebc38b6bdcc7930c2d8348f2397cc7","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+codes&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+codes&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:53.116Z"},"hash":{"alg":"sha256","hash":"cf369c4a39621d596019c42ab78e926aa5597588039892e8d1ad95ad34349c3c","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=approximate+nearest+neighbor+search&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=approximate+nearest+neighbor+search&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:53.119Z"},"hash":{"alg":"sha256","hash":"46b74a8cb7783e104b852e5063e25ba1eabc207336af5fb9c8cf2d2145f69b42","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+hash+tables+candidate+reranking+nearest+neighbor&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+hash+tables+candidate+reranking+nearest+neighbor&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:53.119Z"},"hash":{"alg":"sha256","hash":"34e977bc959d9a74b5d89a2df0f89532094997275d0d718780cdcd3f4015ec80","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+table+buckets&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+table+buckets&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:53.183Z"},"hash":{"alg":"sha256","hash":"9712bd03e69166ddfef363874c33378b7c51b4cadf654318bd3eafa8327ab308","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=LSH+hash+tables+candidate+reranking+nearest+neighbor&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=LSH+hash+tables+candidate+reranking+nearest+neighbor&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:53.200Z"},"hash":{"alg":"sha256","hash":"4d58f9a7c2c184e77cd349329a65c69eb5f6046aba81dde8742e9edb157b127e","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=hash+table+bucket+indexing+vectors&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=hash+table+bucket+indexing+vectors&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:53.202Z"},"hash":{"alg":"sha256","hash":"2fa5bdbbed42d869d988b623e7dfb2f6979d48f5520ece7a2f0ab8e910c238d7","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=approximate+nearest+neighbor+search&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=approximate+nearest+neighbor+search&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:53.240Z"},"hash":{"alg":"sha256","hash":"26a914a4c0cebc91f9913db91ca6d83b46d108216b8a1c023daf4929df109a3d","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Aapproximate+AND+all%3Anearest+AND+all%3Aneighbor+AND+all%3Asearch+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","format":"application/atom+xml","relationship":"inputTo","dc":{"source":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Aapproximate+AND+all%3Anearest+AND+all%3Aneighbor+AND+all%3Asearch+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","date":"2026-11-04T20:45:53.269Z"},"hash":{"alg":"sha256","hash":"5565ce6ce8836c11820e76be0e6f59d07213f4c96016e1d9e7360853c44e07fb","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Alocality+AND+all%3Asensitive+AND+all%3Ahashing+AND+all%3Ahash+AND+all%3Atable+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","format":"application/atom+xml","relationship":"inputTo","dc":{"source":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Alocality+AND+all%3Asensitive+AND+all%3Ahashing+AND+all%3Ahash+AND+all%3Atable+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","date":"2026-11-04T20:45:53.422Z"},"hash":{"alg":"sha256","hash":"df8be9cef01e149ea41158e5de03e9531612228b83dd0e514683e88c0edf10ca","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3ALSH+AND+all%3Ahash+AND+all%3Atables+AND+all%3Acandidate+AND+all%3Areranking+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","format":"application/atom+xml","relationship":"inputTo","dc":{"source":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3ALSH+AND+all%3Ahash+AND+all%3Atables+AND+all%3Acandidate+AND+all%3Areranking+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","date":"2026-11-04T20:45:53.440Z"},"hash":{"alg":"sha256","hash":"be542899ce78ae1f70bc8bb7099abdfa7e8f24ea1ca1ceaedc1433316866e3cc","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28LSH+hash+tables+candidate+reranking+nearest+neighbor%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","format":"application/json","relationship":"inputTo","dc":{"source":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28LSH+hash+tables+candidate+reranking+nearest+neighbor%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","date":"2026-11-04T20:45:53.780Z"},"hash":{"alg":"sha256","hash":"b6cc2076b427a0454f757e341f3ba1988b66cc3047ff392c83e739987b50949a","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28locality+sensitive+hashing+hash+table+buckets%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","format":"application/json","relationship":"inputTo","dc":{"source":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28locality+sensitive+hashing+hash+table+buckets%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","date":"2026-11-04T20:45:53.891Z"},"hash":{"alg":"sha256","hash":"4c8b571b098691a4a75563f1fb51e55b9b1046c4ce8cdfa4f42ea630b6f1cd21","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28approximate+nearest+neighbor+search%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","format":"application/json","relationship":"inputTo","dc":{"source":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28approximate+nearest+neighbor+search%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","date":"2026-11-04T20:45:54.099Z"},"hash":{"alg":"sha256","hash":"06205480f27aa643d315794d064ac662fb25dd852c8b4b2b21077afbede56df4","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+codes&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+codes&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:54.102Z"},"hash":{"alg":"sha256","hash":"59cc01c8172c174d26a87a39650982035c13b02918d845084baecba5612ce8a7","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&count=15&pubyearto=2016","format":"application/xml","relationship":"inputTo","dc":{"source":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&count=15&pubyearto=2016","date":"2026-11-04T20:45:54.259Z"},"hash":{"alg":"sha256","hash":"cbdaa4a0d8d1748777b61379643a2872c27cb7ba7c681abd585730576935fa59","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&count=15&pubyearto=2016","format":"application/xml","relationship":"inputTo","dc":{"source":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&count=15&pubyearto=2016","date":"2026-11-04T20:45:54.293Z"},"hash":{"alg":"sha256","hash":"c3e99e5d0db84aa0d3c26fa1c53eb0b49c05b4555de5aceccbb10917b3ea7882","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.294Z"},"hash":{"alg":"sha256","hash":"9b85926b2ef2a06ae48cc85d47634664fff0f6314aca814979ee2d89595b1083","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.487Z"},"hash":{"alg":"sha256","hash":"5f70193471efd2320bc5e5933cf48765b37686b1b5b6f26f0dd283240d9042bf","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E8%BF%91%E4%BC%BC%E6%9C%80%E8%BF%91%E5%82%8D%E6%8E%A2%E7%B4%A2&count=15&pubyearto=2016","format":"application/xml","relationship":"inputTo","dc":{"source":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E8%BF%91%E4%BC%BC%E6%9C%80%E8%BF%91%E5%82%8D%E6%8E%A2%E7%B4%A2&count=15&pubyearto=2016","date":"2026-11-04T20:45:54.607Z"},"hash":{"alg":"sha256","hash":"42b1d4c0749a1eaedfc711a76a18daf464fc93aa4a4cb4bf367dab332e42b737","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:54.624Z"},"hash":{"alg":"sha256","hash":"ea152c9642af142c7c6f70ac004a262e71793dafef80ee36a874ec839a32120b","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.640Z"},"hash":{"alg":"sha256","hash":"8b730a58947bc4999934dbfa7dadc061b6c9832e9f105301e5361800a6679c65","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.707Z"},"hash":{"alg":"sha256","hash":"168d5ff1185b4bc4e0e4630854e8a9800d85de09525b60b38f364f2cf117f4a5","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:54.750Z"},"hash":{"alg":"sha256","hash":"8675ffdeb6a780d657fe9f2123ca841033a26a44c1b7b44ddd09e07b51d07354","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+Hashtabelle+Bucket&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+Hashtabelle+Bucket&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.827Z"},"hash":{"alg":"sha256","hash":"8f6f56b6ece4778edfcd415421b26ccab595b96bb55b5eab16bf90421c164f11","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","date":"2026-11-04T20:45:54.841Z"},"hash":{"alg":"sha256","hash":"861852c4ba442330256672f7ad9a548812a8e9c6e2fc78e03fbb40d795a5df59","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.crossref.org/works?query=locality+sensitive+hashing+Hashtabelle+Bucket&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.crossref.org/works?query=locality+sensitive+hashing+Hashtabelle+Bucket&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","date":"2026-11-04T20:45:55.115Z"},"hash":{"alg":"sha256","hash":"afa3dc9ac834344d488b05a82a8b8287f4692c50bdf6227c445698792f2536ee","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.archives-ouvertes.fr/search/?q=LSH+hash+tables+candidate+reranking+nearest+neighbor&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.archives-ouvertes.fr/search/?q=LSH+hash+tables+candidate+reranking+nearest+neighbor&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","date":"2026-11-04T20:45:57.264Z"},"hash":{"alg":"sha256","hash":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+Hashtabelle+Bucket&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+Hashtabelle+Bucket&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","date":"2026-11-04T20:45:58.249Z"},"hash":{"alg":"sha256","hash":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+hash+table+buckets&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+hash+table+buckets&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","date":"2026-11-04T20:45:58.257Z"},"hash":{"alg":"sha256","hash":"626d70710d6a16325298f520967adfddc8640af439b36b70c068376cee507dac","basis":"body"}}},{"label":"c2pa.ingredient.v3","data":{"title":"https://api.archives-ouvertes.fr/search/?q=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","format":"application/json","relationship":"inputTo","dc":{"source":"https://api.archives-ouvertes.fr/search/?q=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","date":"2026-11-04T20:45:58.258Z"},"hash":{"alg":"sha256","hash":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064","basis":"body"}}}]},"credential":{"@context":["https://www.w3.org/ns/credentials/v2"],"id":"urn:uuid:3ca725b4-d9f8-4261-952b-45193f1cdf03","type":["VerifiableCredential","AgentOutputCredential"],"issuer":"did:web:agents.writerslogic.com","validFrom":"2026-11-04T20:47:15.700Z","credentialSubject":{"id":"urn:sha256:c6d29d78eea31ebd727e90ff9ee4c023a74320b1dd554b2fc669b2a3a3ac99cf","agent":"prior-art-invalidator","endpoint":"POST /api/v1/find-prior-art","outputDigest":{"alg":"sha256","value":"c6d29d78eea31ebd727e90ff9ee4c023a74320b1dd554b2fc669b2a3a3ac99cf","canonicalization":"JCS"},"inputDigest":{"alg":"sha256","value":"c09169a0e75b6235648ade51439a919c00f10d074563fdc53930500ec107eda3","canonicalization":"JCS"},"manifestDigest":{"alg":"sha256","value":"919549363e25dc9419a0e82e492b67c947a071e75b8ec82f6ca8a8b437c12041","canonicalization":"JCS"},"ingredients":[{"url":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+table+buckets&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"da38bc5b3b5695877e3c726cf3d49936e0ebc38b6bdcc7930c2d8348f2397cc7"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+codes&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"cf369c4a39621d596019c42ab78e926aa5597588039892e8d1ad95ad34349c3c"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=approximate+nearest+neighbor+search&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"46b74a8cb7783e104b852e5063e25ba1eabc207336af5fb9c8cf2d2145f69b42"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+hash+tables+candidate+reranking+nearest+neighbor&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"34e977bc959d9a74b5d89a2df0f89532094997275d0d718780cdcd3f4015ec80"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+hash+table+buckets&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"9712bd03e69166ddfef363874c33378b7c51b4cadf654318bd3eafa8327ab308"},{"url":"https://api.crossref.org/works?query=LSH+hash+tables+candidate+reranking+nearest+neighbor&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"4d58f9a7c2c184e77cd349329a65c69eb5f6046aba81dde8742e9edb157b127e"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=hash+table+bucket+indexing+vectors&filter=to_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"2fa5bdbbed42d869d988b623e7dfb2f6979d48f5520ece7a2f0ab8e910c238d7"},{"url":"https://api.crossref.org/works?query=approximate+nearest+neighbor+search&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"26a914a4c0cebc91f9913db91ca6d83b46d108216b8a1c023daf4929df109a3d"},{"url":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Aapproximate+AND+all%3Anearest+AND+all%3Aneighbor+AND+all%3Asearch+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","sha256":"5565ce6ce8836c11820e76be0e6f59d07213f4c96016e1d9e7360853c44e07fb"},{"url":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3Alocality+AND+all%3Asensitive+AND+all%3Ahashing+AND+all%3Ahash+AND+all%3Atable+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","sha256":"df8be9cef01e149ea41158e5de03e9531612228b83dd0e514683e88c0edf10ca"},{"url":"https://export.arxiv.org/api/query?start=0&max_results=15&search_query=all%3ALSH+AND+all%3Ahash+AND+all%3Atables+AND+all%3Acandidate+AND+all%3Areranking+AND+submittedDate%3A%5B190001010000+TO+201705312359%5D&sortBy=relevance","sha256":"be542899ce78ae1f70bc8bb7099abdfa7e8f24ea1ca1ceaedc1433316866e3cc"},{"url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28LSH+hash+tables+candidate+reranking+nearest+neighbor%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","sha256":"b6cc2076b427a0454f757e341f3ba1988b66cc3047ff392c83e739987b50949a"},{"url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28locality+sensitive+hashing+hash+table+buckets%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","sha256":"4c8b571b098691a4a75563f1fb51e55b9b1046c4ce8cdfa4f42ea630b6f1cd21"},{"url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=%28approximate+nearest+neighbor+search%29+AND+FIRST_PDATE%3A%5B1800-01-01+TO+2017-05-31%5D&format=json&resultType=core&pageSize=15","sha256":"06205480f27aa643d315794d064ac662fb25dd852c8b4b2b21077afbede56df4"},{"url":"https://api.crossref.org/works?query=locality+sensitive+hashing+hash+codes&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"59cc01c8172c174d26a87a39650982035c13b02918d845084baecba5612ce8a7"},{"url":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&count=15&pubyearto=2016","sha256":"cbdaa4a0d8d1748777b61379643a2872c27cb7ba7c681abd585730576935fa59"},{"url":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&count=15&pubyearto=2016","sha256":"c3e99e5d0db84aa0d3c26fa1c53eb0b49c05b4555de5aceccbb10917b3ea7882"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E6%89%80%E6%95%8F%E6%84%9F%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E3%83%90%E3%82%B1%E3%83%83%E3%83%88&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"9b85926b2ef2a06ae48cc85d47634664fff0f6314aca814979ee2d89595b1083"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E3%83%86%E3%83%BC%E3%83%96%E3%83%AB+%E5%80%99%E8%A3%9C%E5%86%8D%E3%83%A9%E3%83%B3%E3%82%AD%E3%83%B3%E3%82%B0+%E6%9C%80%E8%BF%91%E5%82%8D&filter=language%3Aja%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"5f70193471efd2320bc5e5933cf48765b37686b1b5b6f26f0dd283240d9042bf"},{"url":"https://api.jstage.jst.go.jp/searchapi/do?service=3&text=%E8%BF%91%E4%BC%BC%E6%9C%80%E8%BF%91%E5%82%8D%E6%8E%A2%E7%B4%A2&count=15&pubyearto=2016","sha256":"42b1d4c0749a1eaedfc711a76a18daf464fc93aa4a4cb4bf367dab332e42b737"},{"url":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"ea152c9642af142c7c6f70ac004a262e71793dafef80ee36a874ec839a32120b"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E6%A1%B6&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"8b730a58947bc4999934dbfa7dadc061b6c9832e9f105301e5361800a6679c65"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&filter=language%3Azh%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"168d5ff1185b4bc4e0e4630854e8a9800d85de09525b60b38f364f2cf117f4a5"},{"url":"https://api.crossref.org/works?query=%E5%B1%80%E9%83%A8%E6%95%8F%E6%84%9F%E5%93%88%E5%B8%8C+%E5%93%88%E5%B8%8C%E8%A1%A8+%E5%80%99%E9%80%89%E9%87%8D%E6%8E%92%E5%BA%8F+%E6%9C%80%E8%BF%91%E9%82%BB&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"8675ffdeb6a780d657fe9f2123ca841033a26a44c1b7b44ddd09e07b51d07354"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=locality+sensitive+hashing+Hashtabelle+Bucket&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"8f6f56b6ece4778edfcd415421b26ccab595b96bb55b5eab16bf90421c164f11"},{"url":"https://api.openalex.org/works?per_page=15&select=id%2Cdoi%2Cdisplay_name%2Cpublication_date%2Clanguage%2Cabstract_inverted_index%2Ccited_by_count%2Cauthorships%2Cprimary_location&search=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&filter=language%3Ade%2Cto_publication_date%3A2017-05-31&api_key=REDACTED","sha256":"861852c4ba442330256672f7ad9a548812a8e9c6e2fc78e03fbb40d795a5df59"},{"url":"https://api.crossref.org/works?query=locality+sensitive+hashing+Hashtabelle+Bucket&rows=15&select=DOI%2Ctitle%2Coriginal-title%2Cabstract%2Cissued%2Ccontainer-title%2Cauthor%2CURL%2Cis-referenced-by-count&filter=until-pub-date%3A2017-05-31","sha256":"afa3dc9ac834344d488b05a82a8b8287f4692c50bdf6227c445698792f2536ee"},{"url":"https://api.archives-ouvertes.fr/search/?q=LSH+hash+tables+candidate+reranking+nearest+neighbor&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","sha256":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064"},{"url":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+Hashtabelle+Bucket&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","sha256":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064"},{"url":"https://api.archives-ouvertes.fr/search/?q=locality+sensitive+hashing+hash+table+buckets&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","sha256":"626d70710d6a16325298f520967adfddc8640af439b36b70c068376cee507dac"},{"url":"https://api.archives-ouvertes.fr/search/?q=LSH+Hashtabellen+Kandidaten+Neusortierung+N%C3%A4chste+Nachbarn&wt=json&rows=15&fl=docid%2Ctitle_s%2Cabstract_s%2Clanguage_s%2CdoiId_s%2Curi_s%2CproducedDate_s%2CstructName_s%2CauthFullName_s%2CjournalTitle_s&fq=language_s%3A%28de%29&fq=producedDate_tdate%3A%5B*+TO+2017-05-31T23%3A59%3A59Z%5D","sha256":"316b596864c92e18c8f6688107ad49ecfc3fe632ebdc85efe82c65ed28ba8064"}],"payment":{"scheme":"api-key","network":"eip155:8453","payer":"sample"}},"proof":{"type":"DataIntegrityProof","cryptosuite":"eddsa-jcs-2022","created":"2026-11-04T20:47:15.700Z","verificationMethod":"did:web:agents.writerslogic.com#key-1","proofPurpose":"assertionMethod","proofValue":"z3rQx93kth58274pYsCoT6mq9RuhN3X1BJatrY4nBJ9Hdh2wAbx653KyaVLiajVZa3XRn9Fi4omqttY371e9kDZtb"}},"ethSignature":{"type":"EIP-191","signer":"did:pkh:eip155:8453:0x3DBd42560cA7a7E448A2c7DfC9E785526189411f","address":"0x3DBd42560cA7a7E448A2c7DfC9E785526189411f","message":"writerslogic-provenance:11470d60ed3ae7c4d37c1bc5710488c5d32bf70344d76e6ecaf898d55ab823d3","signature":"0xd626598b0ee7ddb669557ce849bb7dd041aeeb24112b7610f0a6a1a45b08cf315730c8ffd2b2264bf152afbffedeb2fd263c68551cbf577bde42a751150010df1c"}}}