{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VNC6API3PBO32ZOA2ECBNLBU25","short_pith_number":"pith:VNC6API3","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"},"canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","source":{"kind":"arxiv","id":"1206.6193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6193","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6193v2","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6193","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"VNC6API3PBO3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNC6API3PBO32ZOA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNC6API3","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VNC6API3PBO32ZOA2ECBNLBU25","target":"record","payload":{"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"},"canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","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"},"source_kind":"arxiv","source_id":"1206.6193","source_version":2,"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-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfphIvi0ykgKwn80pSvBSSHDGuSEffnzACtyUT7nzGmryFqgKf4Rg7oq/Uf4Tre1GsYIcPq5HwiQ6WceC0/zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:15:58.386294Z"},"content_sha256":"5bff685a281f1e63ab2be7750e9bbd7586ce43fafbff6bb8dfee9b3d61652c22","schema_version":"1.0","event_id":"sha256:5bff685a281f1e63ab2be7750e9bbd7586ce43fafbff6bb8dfee9b3d61652c22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VNC6API3PBO32ZOA2ECBNLBU25","target":"graph","payload":{"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"},"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-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zj+5fnRBwrpjo63wB6YkPlNvxKrByxUkujSRIU05vH/CXdct5byYQC6F9MYDwO2+XDzZKMSzMwrmlu45r7JYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:15:58.387076Z"},"content_sha256":"eff51303311a2b7a06c64599aa712d3f17c5d193a6dd4018f41c3176174eb767","schema_version":"1.0","event_id":"sha256:eff51303311a2b7a06c64599aa712d3f17c5d193a6dd4018f41c3176174eb767"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/bundle.json","state_url":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNC6API3PBO32ZOA2ECBNLBU25/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-05-30T09:15:58Z","links":{"resolver":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25","bundle":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/bundle.json","state":"https://pith.science/pith/VNC6API3PBO32ZOA2ECBNLBU25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNC6API3PBO32ZOA2ECBNLBU25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VNC6API3PBO32ZOA2ECBNLBU25","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":"42f208434f4caf3e1c69fea81c59117f47995e28eb3d935196975bfe8f90b74b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:26:07Z","title_canon_sha256":"45cd45a1b66b195a577ea260d556d55935b24c85068d9490abf2bc68413c26e8"},"schema_version":"1.0","source":{"id":"1206.6193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6193","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6193v2","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6193","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"VNC6API3PBO3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNC6API3PBO32ZOA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNC6API3","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:eff51303311a2b7a06c64599aa712d3f17c5d193a6dd4018f41c3176174eb767","target":"graph","created_at":"2026-05-18T02:25:26Z","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 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 ","authors_text":"Bernard Chazelle, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:26:07Z","title":"Data Structures on Event Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6193","kind":"arxiv","version":2},"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:5bff685a281f1e63ab2be7750e9bbd7586ce43fafbff6bb8dfee9b3d61652c22","target":"record","created_at":"2026-05-18T02:25:26Z","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":"42f208434f4caf3e1c69fea81c59117f47995e28eb3d935196975bfe8f90b74b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:26:07Z","title_canon_sha256":"45cd45a1b66b195a577ea260d556d55935b24c85068d9490abf2bc68413c26e8"},"schema_version":"1.0","source":{"id":"1206.6193","kind":"arxiv","version":2}},"canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab45e03d1b785dbd65c0d10416ac34d75b2e5cd7e193ef70e54238a4ea836e78","first_computed_at":"2026-05-18T02:25:26.848234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:26.848234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ho5p8ztnNJBuIZer5aB3yDk+7w/Lc2z7wei7M81oB1s5CyxRTsMmbmP+lfy51hAkRPoGB7EsMDNtRHmvIj9ODg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:26.848870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bff685a281f1e63ab2be7750e9bbd7586ce43fafbff6bb8dfee9b3d61652c22","sha256:eff51303311a2b7a06c64599aa712d3f17c5d193a6dd4018f41c3176174eb767"],"state_sha256":"7d9313960ce668bcc3a9f4723c0fb7cea4f4a408170be1e6c5a94bba7f60d27d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Awx0rFG4ZMZtWKMUYhWPg/QNYHuKTwrnzvwDeomrkjLqKaB6bOQW/56/0+uzYDv+p8MR3cBPdVmTJpddTsmyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:15:58.391993Z","bundle_sha256":"bfe45d8a76c0aa0b3366e270a10d838e11bf141a4f16024815b961ced8f1e09f"}}