{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q2HPNCPJLPZVLCTP3S42AJN3T3","short_pith_number":"pith:Q2HPNCPJ","schema_version":"1.0","canonical_sha256":"868ef689e95bf3558a6fdcb9a025bb9ef9134163606f7c03eb54e56714acb4b7","source":{"kind":"arxiv","id":"2606.09593","version":1},"attestation_state":"computed","paper":{"title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Fernando Paredes Garcia, Ian C. Moore","submitted_at":"2026-06-08T15:03:44Z","abstract_excerpt":"Provenance trees are append-only directed acyclic graphs of artifact registrations anchored on a public blockchain, recently introduced as the data substrate of operator-gated provenance infrastructure. Their defining data-structural pattern is a parent-hash directed acyclic graph (PHDAG), in which each append performs a constant number of storage writes to previously-untouched slots. This pattern has not previously been isolated as a standalone primitive, formally bounded with explicit constants, or benchmarked against the standard alternative, the incremental Merkle tree (IMT). We formalize "},"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":"2606.09593","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T15:03:44Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"dce60a3725b718265029e1efee329f0974f4ebcbffadb255f4e98f540c995d38","abstract_canon_sha256":"8fc4195b04d20ad903beec4bbf7a73689077b469bb993ffe005f9e7611e0eeb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:57.853269Z","signature_b64":"Ixh5WRhGWT+Edw84Yr21JTLY0NtTVfPTH4Y2if4FxFdFes78y9WvjAo9d0iHaEPN4h+GVYjTKn0Gx8O3FVdCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"868ef689e95bf3558a6fdcb9a025bb9ef9134163606f7c03eb54e56714acb4b7","last_reissued_at":"2026-06-09T02:08:57.852385Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:57.852385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Fernando Paredes Garcia, Ian C. Moore","submitted_at":"2026-06-08T15:03:44Z","abstract_excerpt":"Provenance trees are append-only directed acyclic graphs of artifact registrations anchored on a public blockchain, recently introduced as the data substrate of operator-gated provenance infrastructure. Their defining data-structural pattern is a parent-hash directed acyclic graph (PHDAG), in which each append performs a constant number of storage writes to previously-untouched slots. This pattern has not previously been isolated as a standalone primitive, formally bounded with explicit constants, or benchmarked against the standard alternative, the incremental Merkle tree (IMT). We formalize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09593","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.09593/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.09593","created_at":"2026-06-09T02:08:57.852520+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09593v1","created_at":"2026-06-09T02:08:57.852520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09593","created_at":"2026-06-09T02:08:57.852520+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2HPNCPJLPZV","created_at":"2026-06-09T02:08:57.852520+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2HPNCPJLPZVLCTP","created_at":"2026-06-09T02:08:57.852520+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2HPNCPJ","created_at":"2026-06-09T02:08:57.852520+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/Q2HPNCPJLPZVLCTP3S42AJN3T3","json":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3.json","graph_json":"https://pith.science/api/pith-number/Q2HPNCPJLPZVLCTP3S42AJN3T3/graph.json","events_json":"https://pith.science/api/pith-number/Q2HPNCPJLPZVLCTP3S42AJN3T3/events.json","paper":"https://pith.science/paper/Q2HPNCPJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3","download_json":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3.json","view_paper":"https://pith.science/paper/Q2HPNCPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09593&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2HPNCPJLPZVLCTP3S42AJN3T3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2HPNCPJLPZVLCTP3S42AJN3T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3/action/storage_attestation","attest_author":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3/action/author_attestation","sign_citation":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3/action/citation_signature","submit_replication":"https://pith.science/pith/Q2HPNCPJLPZVLCTP3S42AJN3T3/action/replication_record"}},"created_at":"2026-06-09T02:08:57.852520+00:00","updated_at":"2026-06-09T02:08:57.852520+00:00"}