{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TXH5BTQ4UJLC2LKUEPHKT6UOME","short_pith_number":"pith:TXH5BTQ4","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"},"canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","source":{"kind":"arxiv","id":"1302.5302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5302","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5302v1","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5302","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"TXH5BTQ4UJLC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TXH5BTQ4UJLC2LKU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TXH5BTQ4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TXH5BTQ4UJLC2LKUEPHKT6UOME","target":"record","payload":{"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"},"canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","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"},"source_kind":"arxiv","source_id":"1302.5302","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/1GljD/SX0Jt8BFXDRSQPLiI7vWn/Px9U0sxUoBc6PNRyFoavQ3Q7Hqbit/BMMPGKCbjR2zopqQxu/0Ye+VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:22:54.106275Z"},"content_sha256":"6db10836ca66b7eb70ee181bbed850e6fe5e7c0432c885b0cc8b2675354ba244","schema_version":"1.0","event_id":"sha256:6db10836ca66b7eb70ee181bbed850e6fe5e7c0432c885b0cc8b2675354ba244"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TXH5BTQ4UJLC2LKUEPHKT6UOME","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdISBgaMRDgoIrDKBk8Taek3lFk0PuZ6abX/zbaG/iAyoEPa7Y/CvTwzokIoaOCNEGmZC0fsNOjw7XS8fDHcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:22:54.106637Z"},"content_sha256":"7fc99a9a897c3be7f05396f479dc2935ae5a54b3cf58c3498f050ad69dfb9ad7","schema_version":"1.0","event_id":"sha256:7fc99a9a897c3be7f05396f479dc2935ae5a54b3cf58c3498f050ad69dfb9ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/bundle.json","state_url":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:22:54Z","links":{"resolver":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME","bundle":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/bundle.json","state":"https://pith.science/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXH5BTQ4UJLC2LKUEPHKT6UOME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TXH5BTQ4UJLC2LKUEPHKT6UOME","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3dcc2f881709cab608bcac866a2a83e59b2628d9045c918920224ac238994cd4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-02-21T15:24:53Z","title_canon_sha256":"0ca73a2cc92e42facf720631230df421fafa518c5725eb9f4ba1c189ff913d10"},"schema_version":"1.0","source":{"id":"1302.5302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5302","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5302v1","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5302","created_at":"2026-05-18T03:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"TXH5BTQ4UJLC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TXH5BTQ4UJLC2LKU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TXH5BTQ4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:7fc99a9a897c3be7f05396f479dc2935ae5a54b3cf58c3498f050ad69dfb9ad7","target":"graph","created_at":"2026-05-18T03:32:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jimmy Lin, Michael Busch, Nima Asadi","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-02-21T15:24:53Z","title":"Dynamic Memory Allocation Policies for Postings in Real-Time Twitter Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5302","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6db10836ca66b7eb70ee181bbed850e6fe5e7c0432c885b0cc8b2675354ba244","target":"record","created_at":"2026-05-18T03:32:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3dcc2f881709cab608bcac866a2a83e59b2628d9045c918920224ac238994cd4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-02-21T15:24:53Z","title_canon_sha256":"0ca73a2cc92e42facf720631230df421fafa518c5725eb9f4ba1c189ff913d10"},"schema_version":"1.0","source":{"id":"1302.5302","kind":"arxiv","version":1}},"canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dcfd0ce1ca2562d2d5423cea9fa8e611c375f33a697a95d3dde8cf4a93fd8f2","first_computed_at":"2026-05-18T03:32:58.087600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:58.087600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQNTBX2c4soKNgDma7JT3T5egrR/iXxq+fq6qK9PuiEcD7/HFw5OrJQ6oCVwN/b8phMz3w4O1mHczw2BlqTuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:58.088307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db10836ca66b7eb70ee181bbed850e6fe5e7c0432c885b0cc8b2675354ba244","sha256:7fc99a9a897c3be7f05396f479dc2935ae5a54b3cf58c3498f050ad69dfb9ad7"],"state_sha256":"192da1d2438a15b8986d06b866a6157cf47612eac19ef6b60087c46bf2496e63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiW0NwrvYAwtCmQViqIi90t3+v996wTkQjNhXdr+4/0SYpE/K7QtLsvsM8CPhnJsiuXbxgnB1jvvWIseAZ7dCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:22:54.109265Z","bundle_sha256":"9fdf1d999053ca948d4a5375d4294f1b1ee18785450694635bd6f0972e98236a"}}