{"as_of":"2026-08-09T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad450b80e3b354baf2dfd799d73aaa4ac69bf0262544e3a827e1281d596ef3a3","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-08T14:30:26.519377Z","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-06T01:06:14.364450Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.16627","last_updated":"2025-07-03T16:00:09Z","snapshot_observed_at":"2026-08-03T19:52:07.328403Z","submitted_at":"2024-07-23T16:37:58Z","title":"Hardness of sampling solutions from the Symmetric Binary Perceptron","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16627","snapshot_observed_at":"2026-08-08T14:30:26.519377Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06768","last_updated":"2025-08-19T23:35:57Z","snapshot_observed_at":"2026-08-08T14:21:59.725442Z","submitted_at":"2025-02-10T18:47:21Z","title":"Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T14:30:26.519377Z"},"links":{"cited_paper":"/paper/2407.16627","citing_paper":"/paper/2502.06768"},"observation_digest":"sha256:5c4190933de4e89cd0ae56328a73d450bd5e997aa04313b11b174ce7bb4cbf92","observation_id":"a99380a0-57d6-40b8-93f1-32d8822d3733","resolution":{"observed_at":"2026-08-08T14:30:26.519377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16627","last_updated":"2025-07-03T16:00:09Z","snapshot_observed_at":"2026-08-03T19:52:07.328403Z","submitted_at":"2024-07-23T16:37:58Z","title":"Hardness of sampling solutions from the Symmetric Binary Perceptron","version":2},"cited_work":{"arxiv_id":"2407.16627","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.16627","snapshot_observed_at":"2026-08-06T01:06:14.364450Z","title":"Hardness of sampling solutions from the Symmetric Binary Perceptron","venue":"math.PR","work_id":"1c13214f-a7c0-4413-8f06-2a544ec5e464","year":2024},"citing_paper":{"arxiv_id":"2508.04133","last_updated":"2025-08-06T06:58:51Z","snapshot_observed_at":"2026-08-08T03:02:17.526361Z","submitted_at":"2025-08-06T06:58:51Z","title":"Polynomial-time sampling despite disorder chaos","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T01:06:12.715731Z"},"links":{"cited_paper":"/paper/2407.16627","citing_paper":"/paper/2508.04133"},"observation_digest":"sha256:1b10db0bb828df1f018ef2a222d192d690e5ee20b6c435f1db6917e1a8ea620b","observation_id":"7c0113fc-ca37-45ae-936a-ae456cdbefac","resolution":{"observed_at":"2026-08-06T01:06:14.523360Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2407.16627/citation-record","integrity":"/paper/2407.16627/integrity","json":"/paper/2407.16627/citation-record.json","paper":"/paper/2407.16627"},"outbound":[],"paper":{"arxiv_id":"2407.16627","last_updated":"2025-07-03T16:00:09Z","latest_version":2,"primary_category":"math.PR","snapshot_observed_at":"2026-08-03T19:52:07.328403Z","submitted_at":"2024-07-23T16:37:58Z","title":"Hardness of sampling solutions from the Symmetric Binary Perceptron"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.16627."}