{"as_of":"2026-08-08T20:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5de9efa6f348102af3e331def9f2260c24f64d18bed47ee25d0e14991b84119","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:29:24.460286Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T08:56:26.164734Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.13447","last_updated":"2026-06-02T06:53:31Z","snapshot_observed_at":"2026-07-06T18:17:46.369537Z","submitted_at":"2024-05-22T08:37:48Z","title":"Relaxations for binary polynomial optimization via signed certificates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13447","snapshot_observed_at":"2026-08-07T05:29:24.460286Z","title":"Xu and L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07866","last_updated":"2025-06-10T22:46:38Z","snapshot_observed_at":"2026-08-07T05:21:06.060556Z","submitted_at":"2025-06-09T15:34:02Z","title":"Protein folding with an all-to-all trapped-ion quantum computer","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:29:24.460286Z"},"links":{"cited_paper":"/paper/2405.13447","citing_paper":"/paper/2506.07866"},"observation_digest":"sha256:2a884e934f2e6e03ec27d250b8298bab886da59dc08bc4d69e2340efab42934a","observation_id":"54cec842-314b-4835-9b4d-afce14508b90","resolution":{"observed_at":"2026-08-07T05:29:24.460286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13447","last_updated":"2026-06-02T06:53:31Z","snapshot_observed_at":"2026-07-06T18:17:46.369537Z","submitted_at":"2024-05-22T08:37:48Z","title":"Relaxations for binary polynomial optimization via signed certificates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13447","snapshot_observed_at":"2026-08-03T23:15:40.769428Z","title":"Xu and L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17545","last_updated":"2026-06-05T11:50:58Z","snapshot_observed_at":"2026-08-03T23:15:37.877906Z","submitted_at":"2025-11-10T10:17:55Z","title":"Resource-Efficient Quantum Optimization via Higher-Order Encoding","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T23:15:40.769428Z"},"links":{"cited_paper":"/paper/2405.13447","citing_paper":"/paper/2511.17545"},"observation_digest":"sha256:8da1d463a42582225dbcdad9680b4c23ab543afb930404690e52bed4316d0bb9","observation_id":"2286c2e5-ec0f-469c-be6a-9a966f85a638","resolution":{"observed_at":"2026-08-03T23:15:40.769428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13447","last_updated":"2026-06-02T06:53:31Z","snapshot_observed_at":"2026-07-06T18:17:46.369537Z","submitted_at":"2024-05-22T08:37:48Z","title":"Relaxations for binary polynomial optimization via signed certificates","version":2},"cited_work":{"arxiv_id":"2405.13447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13447","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Xu and L","venue":null,"work_id":"1d37b199-515d-482c-a355-c70dd7dab1b4","year":2024},"citing_paper":{"arxiv_id":"2604.27030","last_updated":"2026-04-29T15:01:02Z","snapshot_observed_at":"2026-08-02T07:48:50.129794Z","submitted_at":"2026-04-29T15:01:02Z","title":"Efficient mapping of multi-constraint satisfaction problems to Rydberg platforms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T13:29:33.713789Z"},"links":{"cited_paper":"/paper/2405.13447","citing_paper":"/paper/2604.27030"},"observation_digest":"sha256:94d1bb4cd083d432eb1d20a246ec9f3c814ca6b64a29b1f4227ad84a0612a9b4","observation_id":"162a1db1-ac13-4cd4-9f3b-f005cddc5a95","resolution":{"observed_at":"2026-06-03T02:05:08.361706Z","resolver_source":"arxiv_id","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/2405.13447/citation-record","integrity":"/paper/2405.13447/integrity","json":"/paper/2405.13447/citation-record.json","paper":"/paper/2405.13447"},"outbound":[],"paper":{"arxiv_id":"2405.13447","last_updated":"2026-06-02T06:53:31Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T18:17:46.369537Z","submitted_at":"2024-05-22T08:37:48Z","title":"Relaxations for binary polynomial optimization via signed certificates"},"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 3 inbound Pith citation observations for arXiv:2405.13447."}