{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:E4EEGABL27XMVZEDJDKRRP2HQF","short_pith_number":"pith:E4EEGABL","schema_version":"1.0","canonical_sha256":"270843002bd7eecae48348d518bf47816288a56e4bb04a5a8e95b5f2e50e16a8","source":{"kind":"arxiv","id":"1104.3045","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.3045","created_at":"2026-05-18T04:24:06.688152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3045v1","created_at":"2026-05-18T04:24:06.688152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3045","created_at":"2026-05-18T04:24:06.688152+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4EEGABL27XM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4EEGABL27XMVZED","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4EEGABL","created_at":"2026-05-18T12:26:26.731475+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/E4EEGABL27XMVZEDJDKRRP2HQF","json":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF.json","graph_json":"https://pith.science/api/pith-number/E4EEGABL27XMVZEDJDKRRP2HQF/graph.json","events_json":"https://pith.science/api/pith-number/E4EEGABL27XMVZEDJDKRRP2HQF/events.json","paper":"https://pith.science/paper/E4EEGABL"},"agent_actions":{"view_html":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF","download_json":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF.json","view_paper":"https://pith.science/paper/E4EEGABL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3045&json=true","fetch_graph":"https://pith.science/api/pith-number/E4EEGABL27XMVZEDJDKRRP2HQF/graph.json","fetch_events":"https://pith.science/api/pith-number/E4EEGABL27XMVZEDJDKRRP2HQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/action/storage_attestation","attest_author":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/action/author_attestation","sign_citation":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/action/citation_signature","submit_replication":"https://pith.science/pith/E4EEGABL27XMVZEDJDKRRP2HQF/action/replication_record"}},"created_at":"2026-05-18T04:24:06.688152+00:00","updated_at":"2026-05-18T04:24:06.688152+00:00"}