{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TXH5BTQ4UJLC2LKUEPHKT6UOME","short_pith_number":"pith:TXH5BTQ4","schema_version":"1.0","canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","source":{"kind":"arxiv","id":"1302.5302","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Memory Allocation Policies for Postings in Real-Time Twitter Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Michael Busch, Nima Asadi","submitted_at":"2013-02-21T15:24:53Z","abstract_excerpt":"We explore a real-time Twitter search application where tweets are arriving at a rate of several thousands per second. Real-time search demands that they be indexed and searchable immediately, which leads to a number of implementation challenges. In this paper, we focus on one aspect: dynamic postings allocation policies for index structures that are completely held in main memory. The core issue can be characterized as a \"Goldilocks Problem\". Because memory remains today a scare resource, an allocation policy that is too aggressive leads to inefficient utilization, while a policy that is too "},"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":"1302.5302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-02-21T15:24:53Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0ca73a2cc92e42facf720631230df421fafa518c5725eb9f4ba1c189ff913d10","abstract_canon_sha256":"3dcc2f881709cab608bcac866a2a83e59b2628d9045c918920224ac238994cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:58.088307Z","signature_b64":"VQNTBX2c4soKNgDma7JT3T5egrR/iXxq+fq6qK9PuiEcD7/HFw5OrJQ6oCVwN/b8phMz3w4O1mHczw2BlqTuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","last_reissued_at":"2026-05-18T03:32:58.087600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:58.087600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Memory Allocation Policies for Postings in Real-Time Twitter Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Michael Busch, Nima Asadi","submitted_at":"2013-02-21T15:24:53Z","abstract_excerpt":"We explore a real-time Twitter search application where tweets are arriving at a rate of several thousands per second. Real-time search demands that they be indexed and searchable immediately, which leads to a number of implementation challenges. In this paper, we focus on one aspect: dynamic postings allocation policies for index structures that are completely held in main memory. The core issue can be characterized as a \"Goldilocks Problem\". Because memory remains today a scare resource, an allocation policy that is too aggressive leads to inefficient utilization, while a policy that is too "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5302","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":"1302.5302","created_at":"2026-05-18T03:32:58.087733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5302v1","created_at":"2026-05-18T03:32:58.087733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5302","created_at":"2026-05-18T03:32:58.087733+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXH5BTQ4UJLC","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXH5BTQ4UJLC2LKU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXH5BTQ4","created_at":"2026-05-18T12:28:02.375192+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/TXH5BTQ4UJLC2LKUEPHKT6UOME","json":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME.json","graph_json":"https://pith.science/api/pith-number/TXH5BTQ4UJLC2LKUEPHKT6UOME/graph.json","events_json":"https://pith.science/api/pith-number/TXH5BTQ4UJLC2LKUEPHKT6UOME/events.json","paper":"https://pith.science/paper/TXH5BTQ4"},"agent_actions":{"view_html":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME","download_json":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME.json","view_paper":"https://pith.science/paper/TXH5BTQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5302&json=true","fetch_graph":"https://pith.science/api/pith-number/TXH5BTQ4UJLC2LKUEPHKT6UOME/graph.json","fetch_events":"https://pith.science/api/pith-number/TXH5BTQ4UJLC2LKUEPHKT6UOME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/action/storage_attestation","attest_author":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/action/author_attestation","sign_citation":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/action/citation_signature","submit_replication":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/action/replication_record"}},"created_at":"2026-05-18T03:32:58.087733+00:00","updated_at":"2026-05-18T03:32:58.087733+00:00"}