{"as_of":"2026-08-09T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3078096f52206317ed3295b352e6707780bfa530cc4d6c2d09f2a2cd60e94cf","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-09T06:31:02.800959+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-05T12:51:29.803115Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.09742","last_updated":"2026-07-16T10:48:31Z","snapshot_observed_at":"2026-08-06T10:22:26.731044Z","submitted_at":"2024-03-13T20:12:05Z","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","version":2},"cited_work":{"arxiv_id":"2403.09742","doi":"10.48550/arxiv.2403.09742","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.09742","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Marino, L","venue":"arXiv (Cornell University)","work_id":"46d20032-4709-4e1b-bb4a-3075a72df184","year":2024},"citing_paper":{"arxiv_id":"2504.07204","last_updated":"2026-04-27T18:03:03Z","snapshot_observed_at":"2026-08-03T03:33:03.916539Z","submitted_at":"2025-04-09T18:30:14Z","title":"Rounding the Lov\\'asz Theta Function with a Value Function Approximation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T19:54:56.927821Z"},"links":{"cited_paper":"/paper/2403.09742","citing_paper":"/paper/2504.07204"},"observation_digest":"sha256:baccb995ff1f3b5cb6ba00260b2944445c6246a00b774869ed91be8fb91a5853","observation_id":"e0855baa-660c-4a5c-9d99-19160e53c9fb","resolution":{"observed_at":"2026-07-17T01:20:32.539168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09742","last_updated":"2026-07-16T10:48:31Z","snapshot_observed_at":"2026-08-06T10:22:26.731044Z","submitted_at":"2024-03-13T20:12:05Z","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09742","snapshot_observed_at":"2026-08-05T12:51:29.803115Z","title":"& Zavalnij, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01261","last_updated":"2025-09-01T08:50:54Z","snapshot_observed_at":"2026-08-08T03:43:19.224926Z","submitted_at":"2025-09-01T08:50:54Z","title":"Efficient Maximum Clique Detection via Grover's Algorithm with Real-time Global Size Tracking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T12:51:29.803115Z"},"links":{"cited_paper":"/paper/2403.09742","citing_paper":"/paper/2509.01261"},"observation_digest":"sha256:230e4644be582d22174d11828ba04ffce86f7b5a0cac76feb77b9c4c9858af64","observation_id":"79212d59-2abe-4bc3-bab7-feaa13fc4440","resolution":{"observed_at":"2026-08-05T12:51:29.803115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09742","last_updated":"2026-07-16T10:48:31Z","snapshot_observed_at":"2026-08-06T10:22:26.731044Z","submitted_at":"2024-03-13T20:12:05Z","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","version":2},"cited_work":{"arxiv_id":"2403.09742","doi":"10.48550/arxiv.2403.09742","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.09742","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Marino, L","venue":"arXiv (Cornell University)","work_id":"46d20032-4709-4e1b-bb4a-3075a72df184","year":2024},"citing_paper":{"arxiv_id":"2605.27522","last_updated":"2026-05-26T18:00:21Z","snapshot_observed_at":"2026-08-06T14:06:59.817048Z","submitted_at":"2026-05-26T18:00:21Z","title":"Displaced Gaussian Boson Sampling for enhanced max-clique search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T17:06:45.238843Z"},"links":{"cited_paper":"/paper/2403.09742","citing_paper":"/paper/2605.27522"},"observation_digest":"sha256:f08eeca1e6f18d382320616554264f2271ba1f8fbe004044a9cdf08cde62be02","observation_id":"dc624633-646b-465b-9933-6eb476add0b4","resolution":{"observed_at":"2026-07-17T01:20:32.539168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.09742/citation-record","integrity":"/paper/2403.09742/integrity","json":"/paper/2403.09742/citation-record.json","paper":"/paper/2403.09742"},"outbound":[],"paper":{"arxiv_id":"2403.09742","last_updated":"2026-07-16T10:48:31Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T10:22:26.731044Z","submitted_at":"2024-03-13T20:12:05Z","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.09742."}