{"as_of":"2026-08-10T07:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22074438fb03a265fc66d9cbef92d507a23d08cddd40182dfe182e070bec40a7","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T14:53:14.228762Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.09593/citation-record","integrity":"/paper/2606.09593/integrity","json":"/paper/2606.09593/citation-record.json","paper":"/paper/2606.09593"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Avail- able:https://github.com/tornadocash/tornado-core","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:9f14d611c2ff5e06572a59057e5bbe5927b05903bb974ba75097cd0d88fc91c6","observation_id":"3fabf348-5e9b-488e-9b70-e37deed4c92e","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Available: https://github.com/semaphore-protocol/semaphore","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:6a63b281b584032b556db7f4fc979dc7228cda06cb1284bec81772b498e4ac79","observation_id":"7f777300-83c6-442f-971b-01898172ebcd","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Available: https://github.com/matter-labs/era-contracts","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:6281fe79e7520373492121ce6924189744b8d65a49e5ac879eed4895cebf9770","observation_id":"3010134d-0b47-4eef-9a8f-c0481b2fb5a2","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Available: https: //github.com/scroll-tech/scroll-contracts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:4bdc9501ef693f623a3824d97225d04c87eb5445b3ef2934b1155c13d0a7a430","observation_id":"af55feea-fd5c-4b34-b9af-14bd9b5db659","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:cd20ea0def6dd98a7f846e9f4b4db5234d4ae4811c04f8e36342155a8313c7d2","observation_id":"54c06f08-940b-471e-97c9-b4719acb3445","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:8d9ad4d3cb3445d494caaaab478e44f98b51858af57a5929094c2f9e16d4302e","observation_id":"9f6cdea0-7cda-48ba-b566-fabfe22c4931","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:80baefb5a210bfd2f054326562c56346b68cffc875eb0d9c9cad9d1c79dd69a4","observation_id":"a1be2e55-a930-4d1b-9667-45028e1ea539","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Chacon and B","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:977d5d2cb64d649fb05c63172ba9c6e25cb671c51575a0f01c6795259547ebd2","observation_id":"f1f28dad-1d55-4b86-9df0-43fc80e28352","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1407.3561","last_updated":"2014-07-14T08:31:05Z","snapshot_observed_at":"2026-07-06T03:48:55.296019Z","submitted_at":"2014-07-14T08:31:05Z","title":"IPFS - Content Addressed, Versioned, P2P File System","version":1},"cited_work":{"arxiv_id":"1407.3561","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.3561","snapshot_observed_at":"2026-07-04T01:09:18.473042Z","title":"IPFS - Content Addressed, Versioned, P2P File System","venue":"cs.NI","work_id":"bd9ea3f6-94a8-4232-bd87-49f4a2f76f30","year":2014},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"cited_paper":"/paper/1407.3561","citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:64ab3cf19ce8ff9b14681ed2ca5255df925ad35d0d58920c1c6bce6318f316ce","observation_id":"5ee34d24-bafb-4278-9e07-c98de2b8d5a7","resolution":{"observed_at":"2026-07-03T03:47:35.247678Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10403","last_updated":"2019-08-07T09:42:09Z","snapshot_observed_at":"2026-07-06T07:17:02.175133Z","submitted_at":"2018-11-22T13:19:07Z","title":"Running on Fumes--Preventing Out-of-Gas Vulnerabilities in Ethereum Smart Contracts using Static Resource Analysis","version":2},"cited_work":{"arxiv_id":"1811.10403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.10403","snapshot_observed_at":"2026-07-03T03:47:35.248590Z","title":"Albert, P","venue":null,"work_id":"e96e8b0c-e30e-449d-bb31-39497b07fc51","year":2018},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"cited_paper":"/paper/1811.10403","citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:b57793544abeedf16ea971a6510dbb30411175932460f3b932f96120fba8f340","observation_id":"95dd29c8-8df3-47a3-b6f1-85173e622911","resolution":{"observed_at":"2026-07-03T03:47:35.252714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3276486","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Grech, M","venue":"Proceedings of the ACM on Programming Languages","work_id":"76254588-52fa-4f0a-a28f-846a277e4ce6","year":2018},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:0748c3e3f33bd8725467e443d41b0403b3c96293d64d4f68163d5528a4cb1df5","observation_id":"b39f4c08-5e3e-4993-aa84-5b16a916ac14","resolution":{"observed_at":"2026-06-27T15:00:59.658539Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.00854","last_updated":"2020-12-01T21:48:57Z","snapshot_observed_at":"2026-08-09T00:57:43.551933Z","submitted_at":"2020-12-01T21:48:57Z","title":"Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559","version":1},"cited_work":{"arxiv_id":"2012.00854","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.00854","snapshot_observed_at":"2026-07-04T13:59:52.276411Z","title":"Transaction fee mechanism design for the ethereum blockchain: An economic analysis of EIP-1559","venue":null,"work_id":"8b00c726-7e9d-4d3e-ba80-0680f8389f80","year":2021},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"cited_paper":"/paper/2012.00854","citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:8d84f88ad401ebcde6b609ac0397136db72bf8c2b88e5c2881a536c8e5b068c0","observation_id":"9832c07f-0611-4c3f-90e6-3cc8f65d7a51","resolution":{"observed_at":"2026-07-03T03:47:35.247278Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Buterin,Blockchain Resource Pricing, Ethereum Research position paper, August 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:8871b194793a11524f0310e4598e6ddc8e285bba079f5965fdfd6a30a0084ff9","observation_id":"00fac88d-d0a5-4e9c-81d8-7e9c5ff6f704","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Buterin and M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:dc70dc4bc81d5819f73749ade50050316568608074b6ab0e20f144295653157c","observation_id":"0216952d-929f-4268-a2b7-9b204041efa1","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Buterin, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:be81f8b41f5e7c007b415d628bd0e5e160be322b77ccc972ab484a72e362903c","observation_id":"778d80a4-f5f4-40f5-9387-a7a75a084f5e","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Tang,EIP-2200: Structured Definitions for Net Gas Metering, Ethereum Improvement Proposals, no","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:ee83ae2f7f4bd6f502dd3bccbdf6182ec68a89515653d4386915687b27704048","observation_id":"56086118-64a3-4ed4-b9c5-73c9a9a50f45","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Wood,Ethereum: A Secure Decentralised Generalised Transaction Ledger, Ethereum Project Yellow Paper, Shanghai version, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:9a90dd1cc9de8b70323770ac6f8b466030f99da0bc4bd2cc5aa245fe230ddf96","observation_id":"9b4a650f-90a1-4b84-b116-b720ac3788f1","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03434","last_updated":"2026-04-03T20:17:49Z","snapshot_observed_at":"2026-07-06T22:52:39.423471Z","submitted_at":"2026-04-03T20:17:49Z","title":"Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries","version":1},"cited_work":{"arxiv_id":"2604.03434","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03434","snapshot_observed_at":"2026-07-03T03:47:35.249196Z","title":"Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries","venue":"cs.GT","work_id":"b731fdf5-4e70-4a12-8ab7-7be53e9d969e","year":2026},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"cited_paper":"/paper/2604.03434","citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:b2636535b2e0188abdbb2b60967be946b56fc68abae69353c36db6ae3a7d01cb","observation_id":"56612259-1653-46fe-bf6f-5cebce46696a","resolution":{"observed_at":"2026-07-03T03:47:35.251922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03997","last_updated":"2026-04-05T06:52:52Z","snapshot_observed_at":"2026-08-02T18:32:07.588024Z","submitted_at":"2026-04-05T06:52:52Z","title":"Ledger-State Stigmergy: A Formal Framework for Indirect Coordination Grounded in Distributed Ledger State","version":1},"cited_work":{"arxiv_id":"2604.03997","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03997","snapshot_observed_at":"2026-07-03T03:47:35.240297Z","title":"Ledger-State Stigmergy: A Formal Framework for Indirect Coordination Grounded in Distributed Ledger State","venue":"cs.DC","work_id":"f8cf4d79-7e1c-4f34-aaf7-acd9aa4166f4","year":2026},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"cited_paper":"/paper/2604.03997","citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:c04f13a3758e5f8f62dc72641431763d6c01b3e18589b4ac0626254d38ae1bb6","observation_id":"a825c539-f6f8-4a02-9bd2-c2ed2846add3","resolution":{"observed_at":"2026-07-03T03:47:35.243229Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"Laurie, A","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:4ea451d3c648f3411737aa057138c751adc2f04bdf6a7416cf7aa8b459f2584d","observation_id":"11d63dfc-4153-41fc-a22b-ac1e5dc8f7bd","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T14:53:14.228762Z","title":"The Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T14:53:14.228762Z"},"links":{"citing_paper":"/paper/2606.09593"},"observation_digest":"sha256:68efcfe1b64a961d4e1419007a54b4a4770db9dfb6e62e99a09248727a9c7630","observation_id":"12594877-b960-40ba-a000-a23c622c1899","resolution":{"observed_at":"2026-06-27T14:53:14.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.09593","last_updated":"2026-06-08T15:03:44Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-01T17:15:08.475573Z","submitted_at":"2026-06-08T15:03:44Z","title":"Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2606.09593."}