{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KGNJ2JNZWVR3573WSWH6UAJQHD","short_pith_number":"pith:KGNJ2JNZ","schema_version":"1.0","canonical_sha256":"519a9d25b9b563beff76958fea013038e88b4c5515c0a56beeb0a85dff4cdffa","source":{"kind":"arxiv","id":"1305.0699","version":1},"attestation_state":"computed","paper":{"title":"Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Nima Asadi","submitted_at":"2013-05-03T13:28:02Z","abstract_excerpt":"For text retrieval systems, the assumption that all data structures reside in main memory is increasingly common. In this context, we present a novel incremental inverted indexing algorithm for web-scale collections that directly constructs compressed postings lists in memory. Designing efficient in-memory algorithms requires understanding modern processor architectures and memory hierarchies: in this paper, we explore the issue of postings lists contiguity. Naturally, postings lists that occupy contiguous memory regions are preferred for retrieval, but maintaining contiguity increases complex"},"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":"1305.0699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-05-03T13:28:02Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0419e7ff82d409a716cb56193ea586b5447350efc063794a1467ee8cddcab605","abstract_canon_sha256":"ffde0c5a7069c7ae194255b77090de898d7e1b9b98785942f7b45883356a3200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.040091Z","signature_b64":"30HPr4aUgsjhLf1W7ajRZH6TCFk41O4No4ol3U3sSPaW1vO2D0vz9J+QP9PAO6QjXhys1HHf/3z/WXFOxInJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"519a9d25b9b563beff76958fea013038e88b4c5515c0a56beeb0a85dff4cdffa","last_reissued_at":"2026-05-18T03:26:33.039534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.039534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Nima Asadi","submitted_at":"2013-05-03T13:28:02Z","abstract_excerpt":"For text retrieval systems, the assumption that all data structures reside in main memory is increasingly common. In this context, we present a novel incremental inverted indexing algorithm for web-scale collections that directly constructs compressed postings lists in memory. Designing efficient in-memory algorithms requires understanding modern processor architectures and memory hierarchies: in this paper, we explore the issue of postings lists contiguity. Naturally, postings lists that occupy contiguous memory regions are preferred for retrieval, but maintaining contiguity increases complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0699","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":"1305.0699","created_at":"2026-05-18T03:26:33.039629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0699v1","created_at":"2026-05-18T03:26:33.039629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0699","created_at":"2026-05-18T03:26:33.039629+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGNJ2JNZWVR3","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGNJ2JNZWVR3573W","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGNJ2JNZ","created_at":"2026-05-18T12:27:49.015174+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/KGNJ2JNZWVR3573WSWH6UAJQHD","json":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD.json","graph_json":"https://pith.science/api/pith-number/KGNJ2JNZWVR3573WSWH6UAJQHD/graph.json","events_json":"https://pith.science/api/pith-number/KGNJ2JNZWVR3573WSWH6UAJQHD/events.json","paper":"https://pith.science/paper/KGNJ2JNZ"},"agent_actions":{"view_html":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD","download_json":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD.json","view_paper":"https://pith.science/paper/KGNJ2JNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0699&json=true","fetch_graph":"https://pith.science/api/pith-number/KGNJ2JNZWVR3573WSWH6UAJQHD/graph.json","fetch_events":"https://pith.science/api/pith-number/KGNJ2JNZWVR3573WSWH6UAJQHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD/action/storage_attestation","attest_author":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD/action/author_attestation","sign_citation":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD/action/citation_signature","submit_replication":"https://pith.science/pith/KGNJ2JNZWVR3573WSWH6UAJQHD/action/replication_record"}},"created_at":"2026-05-18T03:26:33.039629+00:00","updated_at":"2026-05-18T03:26:33.039629+00:00"}