{"as_of":"2026-08-21T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35d0bcc03a1f9b4ee04482ebdc785f2131d444a15d862505de438be6a2342af5","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:30:44.386196Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.02026/citation-record","integrity":"/paper/2608.02026/integrity","json":"/paper/2608.02026/citation-record.json","paper":"/paper/2608.02026"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T16:30:42.705214Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:42.705214Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:9f5f667caad2757d9ce3c847fa9299c5381292238d2f827e7c356551200e342b","observation_id":"21761b93-7eb2-4299-9fbb-82dd70fe71a4","resolution":{"observed_at":"2026-08-04T16:30:42.705214Z","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-08-04T16:30:42.770103Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:42.770103Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:892f69838bbf910accb2431a7d153869901a96181b75b2857f76213f83b3b713","observation_id":"9c1f4702-b62d-4bad-9ebd-0f319264b405","resolution":{"observed_at":"2026-08-04T16:30:42.770103Z","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-08-04T16:30:42.855475Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:42.855475Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:983154ba59997260da05a5cbaaa24f147ad8220c5d7d66abcc5dc8a9f969fd4e","observation_id":"3bd576fe-f205-4061-8fc9-2d2aea3e8849","resolution":{"observed_at":"2026-08-04T16:30:42.855475Z","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-08-04T16:30:43.033538Z","title":"Scrub- induced failures motivate changes to redaction or placeholder policies, whereas reasoning failures motivate changes to prompting or decoding","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.033538Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:d3474163b0294c7cbfc7c61b568ad367438c418e255540a3b55ad57621cae816","observation_id":"4e686f29-7f77-4a60-9214-75bc9e16ebab","resolution":{"observed_at":"2026-08-04T16:30:43.033538Z","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-08-04T16:30:43.260564Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.260564Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:95ccc5680f19db3028f345adb4a80c2d268137ecb9584f89abc3aa1731e65e9d","observation_id":"1925a092-3469-4c7a-8888-7203db287d6a","resolution":{"observed_at":"2026-08-04T16:30:43.260564Z","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-08-04T16:30:43.392616Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.392616Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:04483713dc1ffd89911783bef417fc450ceda67499ee55d681e3569d343e1c8e","observation_id":"3bbed217-0c85-4863-a8c2-ec5ee4b15404","resolution":{"observed_at":"2026-08-04T16:30:43.392616Z","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-08-04T16:30:43.515278Z","title":"Do not use markdown fences instead of these tags for the final code","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.515278Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:d3c82df118021780101f24f7d7785224fbcf80f345df1adcb4120fb78c3ab540","observation_id":"87157c39-8637-43ca-8f2e-95a6cd88b752","resolution":{"observed_at":"2026-08-04T16:30:43.515278Z","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-08-04T16:30:43.572410Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.572410Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:7dc3908230c204aa756151c8daeae497583444c57c634ee101d55c0d897de49c","observation_id":"0e151dd0-ef6f-467e-b8ee-da69afccce41","resolution":{"observed_at":"2026-08-04T16:30:43.572410Z","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-08-04T16:30:43.719622Z","title":"\"\" Paired attribution (success / failure) / Math","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.719622Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:95e3cbba7b0c96aee0146038d8623269744c14b2fc8c07e48ee3935c756bcf61","observation_id":"e1178d15-87b5-400d-9b88-03343bb7126b","resolution":{"observed_at":"2026-08-04T16:30:43.719622Z","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-08-04T16:30:43.735968Z","title":"**positive** maps to trajectory label **T1**, **negative** to **T2** in`trajectoryies_id`","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.735968Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:ce63c5d638c050131264eeff73c6c964fa91a217f97c57e22aa631985fd860da","observation_id":"9b1358ba-2002-48fb-9699-dfe215e7be80","resolution":{"observed_at":"2026-08-04T16:30:43.735968Z","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-08-04T16:30:43.806333Z","title":"Do not merge on guesswork","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.806333Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:1394c9697a1be0df3ac5a46017f37e4dc3743f4e0d27413ce788fe9504910f31","observation_id":"fed02c28-c3ea-4d92-847b-908765c39040","resolution":{"observed_at":"2026-08-04T16:30:43.806333Z","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-08-04T16:30:43.917910Z","title":"T1\" and/or","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:43.917910Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:8382c80977eea58e72d119c8303ec1dbfdcd27f93d3afed2dd356e7797798044","observation_id":"a41249e1-ad18-4a93-ac69-5ea75e049744","resolution":{"observed_at":"2026-08-04T16:30:43.917910Z","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-08-04T16:30:44.035219Z","title":"Merged steps use trajectoryies_id [\"T1\",\"T2\"] when both sides explicitly share the step","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:44.035219Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:9e9d4b39e5061f1bf3b16822a8cf00e548a6cbf7f1a5b7513db23c3275fc8c64","observation_id":"2649e31c-671e-4566-8702-a8d8db87bbf8","resolution":{"observed_at":"2026-08-04T16:30:44.035219Z","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-08-04T16:30:44.150299Z","title":"T1\"], [\"T2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:44.150299Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:f6ebf0dba137293ef196c3e08a9711eb29aee45466b9acb38e8c5b13d929959b","observation_id":"2bbddfec-6638-4055-98af-037c57535f49","resolution":{"observed_at":"2026-08-04T16:30:44.150299Z","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-08-04T16:30:44.281464Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:44.281464Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:f04fa77424308c92408aa8238adc8efcfa6ccc82f80fef6809d79fc814935e85","observation_id":"1e3a4131-86fe-43f7-966d-c9d93906391f","resolution":{"observed_at":"2026-08-04T16:30:44.281464Z","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-08-04T16:30:44.386196Z","title":"\"\" 20 Published as a conference paper at COLM 2026 Re-reasoning / Code","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T16:30:44.386196Z"},"links":{"citing_paper":"/paper/2608.02026"},"observation_digest":"sha256:b32226193677096ba60ad24c236282bf783350d344c71ccfbdff370320864951","observation_id":"6968739e-5e2c-420c-a672-e2390a6a4a08","resolution":{"observed_at":"2026-08-04T16:30:44.386196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02026","last_updated":"2026-08-03T10:23:48Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T13:34:20.394129Z","submitted_at":"2026-08-03T10:23:48Z","title":"HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2608.02026."}