{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VNC6API3PBO32ZOA2ECBNLBU25","short_pith_number":"pith:VNC6API3","schema_version":"1.0","canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","source":{"kind":"arxiv","id":"1206.6193","version":2},"attestation_state":"computed","paper":{"title":"Data Structures on Event Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernard Chazelle, Wolfgang Mulzer","submitted_at":"2012-06-27T07:26:07Z","abstract_excerpt":"We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type insert, delete and query. The algorithm responds to the requests as it encounters them during a (random or adversarial) walk in G. We study the limit behavior of such a walk and give an efficient algorithm for recognizing which structures can be generated. We also give a near-optimal algorithm for successor searching if the event graph is a cycle and the walk is "},"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":"1206.6193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"45cd45a1b66b195a577ea260d556d55935b24c85068d9490abf2bc68413c26e8","abstract_canon_sha256":"42f208434f4caf3e1c69fea81c59117f47995e28eb3d935196975bfe8f90b74b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:26.848870Z","signature_b64":"ho5p8ztnNJBuIZer5aB3yDk+7w/Lc2z7wei7M81oB1s5CyxRTsMmbmP+lfy51hAkRPoGB7EsMDNtRHmvIj9ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","last_reissued_at":"2026-05-18T02:25:26.848234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:26.848234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Structures on Event Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernard Chazelle, Wolfgang Mulzer","submitted_at":"2012-06-27T07:26:07Z","abstract_excerpt":"We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type insert, delete and query. The algorithm responds to the requests as it encounters them during a (random or adversarial) walk in G. We study the limit behavior of such a walk and give an efficient algorithm for recognizing which structures can be generated. We also give a near-optimal algorithm for successor searching if the event graph is a cycle and the walk is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6193","kind":"arxiv","version":2},"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":"1206.6193","created_at":"2026-05-18T02:25:26.848326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6193v2","created_at":"2026-05-18T02:25:26.848326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6193","created_at":"2026-05-18T02:25:26.848326+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNC6API3PBO3","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNC6API3PBO32ZOA","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNC6API3","created_at":"2026-05-18T12:27:25.539911+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/VNC6API3PBO32ZOA2ECBNLBU25","json":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25.json","graph_json":"https://pith.science/api/pith-number/VNC6API3PBO32ZOA2ECBNLBU25/graph.json","events_json":"https://pith.science/api/pith-number/VNC6API3PBO32ZOA2ECBNLBU25/events.json","paper":"https://pith.science/paper/VNC6API3"},"agent_actions":{"view_html":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25","download_json":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25.json","view_paper":"https://pith.science/paper/VNC6API3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6193&json=true","fetch_graph":"https://pith.science/api/pith-number/VNC6API3PBO32ZOA2ECBNLBU25/graph.json","fetch_events":"https://pith.science/api/pith-number/VNC6API3PBO32ZOA2ECBNLBU25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/action/storage_attestation","attest_author":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/action/author_attestation","sign_citation":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/action/citation_signature","submit_replication":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/action/replication_record"}},"created_at":"2026-05-18T02:25:26.848326+00:00","updated_at":"2026-05-18T02:25:26.848326+00:00"}