{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E4EEGABL27XMVZEDJDKRRP2HQF","short_pith_number":"pith:E4EEGABL","canonical_record":{"source":{"id":"1104.3045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T13:13:05Z","cross_cats_sorted":[],"title_canon_sha256":"7e40b7171a1cb0254e99f3f7cfd7c0c78c1bc39ab162a472731275fa146a58eb","abstract_canon_sha256":"256d09efd663c6842317b97f997670b0a651dae034f8e1dd5c4304f528d62d8d"},"schema_version":"1.0"},"canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","source":{"kind":"arxiv","id":"1104.3045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3045","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3045v1","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3045","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"E4EEGABL27XM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E4EEGABL27XMVZED","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E4EEGABL","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E4EEGABL27XMVZEDJDKRRP2HQF","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T13:13:05Z","cross_cats_sorted":[],"title_canon_sha256":"7e40b7171a1cb0254e99f3f7cfd7c0c78c1bc39ab162a472731275fa146a58eb","abstract_canon_sha256":"256d09efd663c6842317b97f997670b0a651dae034f8e1dd5c4304f528d62d8d"},"schema_version":"1.0"},"canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.688550Z","signature_b64":"xJfmhQdX0huQ32b4vs882w5SJuyiur+lrCvnuYlnhFRo/yO/LQwDaCcOxZYxTcKvCU3nJ6oC1W1peR2nrh1kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","last_reissued_at":"2026-05-18T04:24:06.688064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.688064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3045","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGpDArdh5PiEVeR8p3bMTMg4vH3dOsBq9CQ433psCWklWKz9ix+GFFrRhmVZb2O6kzsUGqGT2tqnPeKBcJAmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:10:07.943267Z"},"content_sha256":"8e6e0325d1a389fd786ad3d6567933201d56948569b1f2426db5e4a24c8dbb83","schema_version":"1.0","event_id":"sha256:8e6e0325d1a389fd786ad3d6567933201d56948569b1f2426db5e4a24c8dbb83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E4EEGABL27XMVZEDJDKRRP2HQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confluent Persistence Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, Sebastien Collette, Stefan Langerman","submitted_at":"2011-04-15T13:13:05Z","abstract_excerpt":"It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in $O(\\log n)$ amortized time, and following a pointer takes $O(\\log c \\log n)$ time where $c$ is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved at a logarithmic cost in the bounded in-degree model used widely in previous work. This is a $O(n/\\log n)$-factor improvement over the previous known transform to make a data structure confluentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3045","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4Ly13P1L2cBuGHp/9IJWGm2ZnfT2rytY6M5eJZgqrF1oVeFzbRewfHDZfkkVmm+l9wMN4rrLy+uYPfXwz5iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:10:07.943612Z"},"content_sha256":"18fefe16186a90181401472833be4b890f9afdef7345b55f2679c58a3fe96e5d","schema_version":"1.0","event_id":"sha256:18fefe16186a90181401472833be4b890f9afdef7345b55f2679c58a3fe96e5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/bundle.json","state_url":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4EEGABL27XMVZEDJDKRRP2HQF/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-28T03:10:07Z","links":{"resolver":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF","bundle":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/bundle.json","state":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4EEGABL27XMVZEDJDKRRP2HQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E4EEGABL27XMVZEDJDKRRP2HQF","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":"256d09efd663c6842317b97f997670b0a651dae034f8e1dd5c4304f528d62d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T13:13:05Z","title_canon_sha256":"7e40b7171a1cb0254e99f3f7cfd7c0c78c1bc39ab162a472731275fa146a58eb"},"schema_version":"1.0","source":{"id":"1104.3045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3045","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3045v1","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3045","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"E4EEGABL27XM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E4EEGABL27XMVZED","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E4EEGABL","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:18fefe16186a90181401472833be4b890f9afdef7345b55f2679c58a3fe96e5d","target":"graph","created_at":"2026-05-18T04:24:06Z","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":"It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in $O(\\log n)$ amortized time, and following a pointer takes $O(\\log c \\log n)$ time where $c$ is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved at a logarithmic cost in the bounded in-degree model used widely in previous work. This is a $O(n/\\log n)$-factor improvement over the previous known transform to make a data structure confluentl","authors_text":"John Iacono, Sebastien Collette, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T13:13:05Z","title":"Confluent Persistence Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3045","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:8e6e0325d1a389fd786ad3d6567933201d56948569b1f2426db5e4a24c8dbb83","target":"record","created_at":"2026-05-18T04:24:06Z","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":"256d09efd663c6842317b97f997670b0a651dae034f8e1dd5c4304f528d62d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T13:13:05Z","title_canon_sha256":"7e40b7171a1cb0254e99f3f7cfd7c0c78c1bc39ab162a472731275fa146a58eb"},"schema_version":"1.0","source":{"id":"1104.3045","kind":"arxiv","version":1}},"canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","first_computed_at":"2026-05-18T04:24:06.688064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:06.688064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJfmhQdX0huQ32b4vs882w5SJuyiur+lrCvnuYlnhFRo/yO/LQwDaCcOxZYxTcKvCU3nJ6oC1W1peR2nrh1kAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:06.688550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e6e0325d1a389fd786ad3d6567933201d56948569b1f2426db5e4a24c8dbb83","sha256:18fefe16186a90181401472833be4b890f9afdef7345b55f2679c58a3fe96e5d"],"state_sha256":"7d7b44908b6488c0f7ef3c3c9b0b4bdde2431546fb3de0b30861a14143dce16a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGzfJzMosflfUZe+wflr3SdnxzmwLop4/e29EW1UY7ljjJL4at+NRuqwXZiqXMAzKkpMEF1nlfNDY2Bh04YNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:10:07.945349Z","bundle_sha256":"aff3471a17900c99ac5f85542467e6290ce298341fabe087a8a5d00fd4300512"}}