{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F3KULKEBCUJ6R2OJPAOTJHA7UG","short_pith_number":"pith:F3KULKEB","schema_version":"1.0","canonical_sha256":"2ed545a8811513e8e9c9781d349c1fa19bbc9c4b9a913f40cc6516b994dada7a","source":{"kind":"arxiv","id":"1808.03969","version":1},"attestation_state":"computed","paper":{"title":"Reconfigurable Inverted Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Ryota Hinami, Shin'ichi Satoh, Yusuke Matsui","submitted_at":"2018-08-12T16:47:47Z","abstract_excerpt":"Existing approximate nearest neighbor search systems suffer from two fundamental problems that are of practical importance but have not received sufficient attention from the research community. First, although existing systems perform well for the whole database, it is difficult to run a search over a subset of the database. Second, there has been no discussion concerning the performance decrement after many items have been newly added to a system. We develop a reconfigurable inverted index (Rii) to resolve these two issues. Based on the standard IVFADC system, we design a data layout such th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.03969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-08-12T16:47:47Z","cross_cats_sorted":["cs.IR","cs.MM"],"title_canon_sha256":"6749dd310ec8821ab79fc4bf79004d61e0b3c8db9f0842df7cdf6918c7fbab5d","abstract_canon_sha256":"babe5f08888e650a0919fbfd334248bb7ae10d04adf5a06d949969dbe1420eb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.219451Z","signature_b64":"7lxjJ3/mgtbTwmLWTQuEQgHB5Lm+NvjWG3y9+Yw1ZizzzXxnRFdKrMTYyJFzLZUvq+mF1F3SzWf9WDcnLaHXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed545a8811513e8e9c9781d349c1fa19bbc9c4b9a913f40cc6516b994dada7a","last_reissued_at":"2026-05-18T00:08:19.219043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.219043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconfigurable Inverted Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Ryota Hinami, Shin'ichi Satoh, Yusuke Matsui","submitted_at":"2018-08-12T16:47:47Z","abstract_excerpt":"Existing approximate nearest neighbor search systems suffer from two fundamental problems that are of practical importance but have not received sufficient attention from the research community. First, although existing systems perform well for the whole database, it is difficult to run a search over a subset of the database. Second, there has been no discussion concerning the performance decrement after many items have been newly added to a system. We develop a reconfigurable inverted index (Rii) to resolve these two issues. Based on the standard IVFADC system, we design a data layout such th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03969","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03969","created_at":"2026-05-18T00:08:19.219117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03969v1","created_at":"2026-05-18T00:08:19.219117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03969","created_at":"2026-05-18T00:08:19.219117+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3KULKEBCUJ6","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3KULKEBCUJ6R2OJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3KULKEB","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG","json":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG.json","graph_json":"https://pith.science/api/pith-number/F3KULKEBCUJ6R2OJPAOTJHA7UG/graph.json","events_json":"https://pith.science/api/pith-number/F3KULKEBCUJ6R2OJPAOTJHA7UG/events.json","paper":"https://pith.science/paper/F3KULKEB"},"agent_actions":{"view_html":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG","download_json":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG.json","view_paper":"https://pith.science/paper/F3KULKEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03969&json=true","fetch_graph":"https://pith.science/api/pith-number/F3KULKEBCUJ6R2OJPAOTJHA7UG/graph.json","fetch_events":"https://pith.science/api/pith-number/F3KULKEBCUJ6R2OJPAOTJHA7UG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG/action/storage_attestation","attest_author":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG/action/author_attestation","sign_citation":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG/action/citation_signature","submit_replication":"https://pith.science/pith/F3KULKEBCUJ6R2OJPAOTJHA7UG/action/replication_record"}},"created_at":"2026-05-18T00:08:19.219117+00:00","updated_at":"2026-05-18T00:08:19.219117+00:00"}