{"as_of":"2026-08-08T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af6dace32fa48b4b959d824d380de64046e92fc44ca63b29b3e7e6e250d3552d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:14:06.085361Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T06:16:28.064256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.12176","last_updated":"2024-12-03T15:30:15Z","snapshot_observed_at":"2026-07-06T18:32:40.207270Z","submitted_at":"2024-06-18T01:07:58Z","title":"Assembly Theory and its Relationship with Computational Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12176","snapshot_observed_at":"2026-08-07T13:14:06.085361Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22826","last_updated":"2025-05-28T20:10:22Z","snapshot_observed_at":"2026-08-07T12:57:19.486762Z","submitted_at":"2025-05-28T20:10:22Z","title":"Assembly in Directed Hypergraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:14:06.085361Z"},"links":{"cited_paper":"/paper/2406.12176","citing_paper":"/paper/2505.22826"},"observation_digest":"sha256:7ae936c902f953d33d98a59368ab18e4b442f3c43f0f80d5c4dfba34c74ae9bc","observation_id":"c7038400-d319-404d-a4a7-326ec7412b16","resolution":{"observed_at":"2026-08-07T13:14:06.085361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12176","last_updated":"2024-12-03T15:30:15Z","snapshot_observed_at":"2026-07-06T18:32:40.207270Z","submitted_at":"2024-06-18T01:07:58Z","title":"Assembly Theory and its Relationship with Computational Complexity","version":3},"cited_work":{"arxiv_id":"2406.12176","doi":"10.48550/arxiv.2406.12176","metadata_source":"pith","pith_arxiv_id":"2406.12176","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Assembly Theory and its Relationship with Computational Complexity","venue":"cs.CC","work_id":"108dfd55-8e2e-4b78-a2bc-d1a4dfd5be39","year":2024},"citing_paper":{"arxiv_id":"2507.08852","last_updated":"2025-07-08T23:07:11Z","snapshot_observed_at":"2026-08-07T23:32:01.928845Z","submitted_at":"2025-07-08T23:07:11Z","title":"Open, Reproducible Calculation of Assembly Indices","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:08:29.396089Z"},"links":{"cited_paper":"/paper/2406.12176","citing_paper":"/paper/2507.08852"},"observation_digest":"sha256:f4e85e7a3214da059a8939c2179c80d39cd59b85b290b0635b686683754e0f9e","observation_id":"341b7696-5021-4402-85eb-74d831e13fa1","resolution":{"observed_at":"2026-08-06T19:08:31.008082Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.12176/citation-record","integrity":"/paper/2406.12176/integrity","json":"/paper/2406.12176/citation-record.json","paper":"/paper/2406.12176"},"outbound":[],"paper":{"arxiv_id":"2406.12176","last_updated":"2024-12-03T15:30:15Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T18:32:40.207270Z","submitted_at":"2024-06-18T01:07:58Z","title":"Assembly Theory and its Relationship with Computational Complexity"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.12176."}