{"as_of":"2026-08-23T00:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ece39cb37cbb0ed79eb176a71e6380ef41a4ae4b75ee64427c01f36c86320ad8","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-22T06:32:14.747728+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-05T14:08:12.109332Z","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-21T23:04:25.684149Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.10077","last_updated":"2025-03-16T19:30:24Z","snapshot_observed_at":"2026-08-22T00:26:15.825628Z","submitted_at":"2025-03-13T05:57:40Z","title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA","version":2},"cited_work":{"arxiv_id":"2503.10077","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.10077","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The art of avoiding constraints: A penalty- free approach to constrained combinatorial optimization with qaoa","venue":null,"work_id":"48819382-ba00-41d3-971e-342126002fa3","year":2025},"citing_paper":{"arxiv_id":"2508.02590","last_updated":"2026-05-18T18:00:54Z","snapshot_observed_at":"2026-08-21T13:27:04.231006Z","submitted_at":"2025-08-04T16:44:53Z","title":"Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T23:02:50.850801Z"},"links":{"cited_paper":"/paper/2503.10077","citing_paper":"/paper/2508.02590"},"observation_digest":"sha256:97e9c699040fee64031189f304ce9cf89ed4dd3579f832ac0abe93d665fbbac1","observation_id":"552dac30-9715-44d7-93c9-2294197bc677","resolution":{"observed_at":"2026-05-21T23:04:25.686603Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10077","last_updated":"2025-03-16T19:30:24Z","snapshot_observed_at":"2026-08-22T00:26:15.825628Z","submitted_at":"2025-03-13T05:57:40Z","title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.10077","snapshot_observed_at":"2026-08-05T14:08:12.109332Z","title":"arXiv preprint arXiv:2503.10077 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21686","last_updated":"2025-08-29T14:53:56Z","snapshot_observed_at":"2026-08-22T18:10:19.711190Z","submitted_at":"2025-08-29T14:53:56Z","title":"An Exclusive-Sum-of-Products Pipeline for QAOA","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:08:12.109332Z"},"links":{"cited_paper":"/paper/2503.10077","citing_paper":"/paper/2508.21686"},"observation_digest":"sha256:0721c2dba8ede657225f3cd79efac3aa2e585cad75dbbb90f7f890e16e471f8b","observation_id":"3576612f-0f66-42ab-bc0a-6db9789dbaf4","resolution":{"observed_at":"2026-08-05T14:08:12.109332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10077","last_updated":"2025-03-16T19:30:24Z","snapshot_observed_at":"2026-08-22T00:26:15.825628Z","submitted_at":"2025-03-13T05:57:40Z","title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA","version":2},"cited_work":{"arxiv_id":"2503.10077","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.10077","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The art of avoiding constraints: A penalty- free approach to constrained combinatorial optimization with qaoa","venue":null,"work_id":"48819382-ba00-41d3-971e-342126002fa3","year":2025},"citing_paper":{"arxiv_id":"2604.25162","last_updated":"2026-04-29T21:38:07Z","snapshot_observed_at":"2026-08-17T18:20:36.765125Z","submitted_at":"2026-04-28T03:11:37Z","title":"Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T16:57:56.151010Z"},"links":{"cited_paper":"/paper/2503.10077","citing_paper":"/paper/2604.25162"},"observation_digest":"sha256:742c8ed17d9fcc19978db24ea7890a9b55ec091501340dc5ab594d69ec94b2d0","observation_id":"79631eca-36e2-4cf2-9cf7-71a834aea6b7","resolution":{"observed_at":"2026-05-11T23:26:22.544372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.10077/citation-record","integrity":"/paper/2503.10077/integrity","json":"/paper/2503.10077/citation-record.json","paper":"/paper/2503.10077"},"outbound":[],"paper":{"arxiv_id":"2503.10077","last_updated":"2025-03-16T19:30:24Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-22T00:26:15.825628Z","submitted_at":"2025-03-13T05:57:40Z","title":"The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2503.10077."}