{"as_of":"2026-08-09T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1772233d1e0b332774505016d68380451d9171b8ac6225a0e1f9a7788018c481","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T23:15:44.681595Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2504.21335","last_updated":"2025-04-30T05:45:15Z","snapshot_observed_at":"2026-08-07T15:57:52.055197Z","submitted_at":"2025-04-30T05:45:15Z","title":"Efficient hybrid variational quantum algorithm for solving graph coloring problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21335","snapshot_observed_at":"2026-08-03T23:15:44.681595Z","title":null,"venue":null,"work_id":null,"year":2025},"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":42,"source":"pdf_text","source_observed_at":"2026-08-03T23:15:44.681595Z"},"links":{"cited_paper":"/paper/2504.21335","citing_paper":"/paper/2511.17545"},"observation_digest":"sha256:a483d34e87c14595aa963be16698c42875bfc9c4cc29b8fcdde7d89476b868b4","observation_id":"95855063-a937-4812-93d0-9f0f9a34cb00","resolution":{"observed_at":"2026-08-03T23:15:44.681595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.21335/citation-record","integrity":"/paper/2504.21335/integrity","json":"/paper/2504.21335/citation-record.json","paper":"/paper/2504.21335"},"outbound":[],"paper":{"arxiv_id":"2504.21335","last_updated":"2025-04-30T05:45:15Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T15:57:52.055197Z","submitted_at":"2025-04-30T05:45:15Z","title":"Efficient hybrid variational quantum algorithm for solving graph coloring problem"},"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 1 inbound Pith citation observation for arXiv:2504.21335."}