{"as_of":"2026-08-08T05:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55e94ad5129897acbe95ece9b86b4dbcd220ebf4651e407437ff6550522a05e8","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:00:06.876121Z","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-07-03T02:27:35.279883Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.00291","last_updated":"2025-07-27T19:32:24Z","snapshot_observed_at":"2026-08-07T16:19:01.339198Z","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00291","snapshot_observed_at":"2026-08-03T20:00:06.876121Z","title":"Preparing graph states forbidding a vertex-minor, 2025.arXiv:2504.00291","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.22271","last_updated":"2026-07-21T18:26:30Z","snapshot_observed_at":"2026-08-06T09:16:30.633395Z","submitted_at":"2025-11-27T09:49:57Z","title":"Local Equivalences of Graph States","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-03T20:00:06.876121Z"},"links":{"cited_paper":"/paper/2504.00291","citing_paper":"/paper/2511.22271"},"observation_digest":"sha256:92e2fbda33961545c60e87e47d28334669cad936c112642687f9bb94e893c3a6","observation_id":"11ee7c1f-18e1-4440-895e-a396b03ba4ce","resolution":{"observed_at":"2026-08-03T20:00:06.876121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00291","last_updated":"2025-07-27T19:32:24Z","snapshot_observed_at":"2026-08-07T16:19:01.339198Z","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor","version":2},"cited_work":{"arxiv_id":"2504.00291","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.00291","snapshot_observed_at":"2026-07-03T02:27:35.279883Z","title":"Preparing graph states forbidding a vertex-minor","venue":null,"work_id":"f48c150f-19c2-4be7-aa1d-8aa51bacb6f4","year":null},"citing_paper":{"arxiv_id":"2606.07110","last_updated":"2026-06-05T10:04:54Z","snapshot_observed_at":"2026-08-06T17:42:39.375277Z","submitted_at":"2026-06-05T10:04:54Z","title":"Entanglement from Expansion: High Rank-Width in Deterministic Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T20:14:38.918687Z"},"links":{"cited_paper":"/paper/2504.00291","citing_paper":"/paper/2606.07110"},"observation_digest":"sha256:16d70023c4129bf987d14495f558a611098917054cc8b92e12c2e9c5a1f21f5c","observation_id":"34e279c0-5ed2-49ef-8bb3-2a4b6bb8f77c","resolution":{"observed_at":"2026-07-02T20:47:22.662233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00291","last_updated":"2025-07-27T19:32:24Z","snapshot_observed_at":"2026-08-07T16:19:01.339198Z","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor","version":2},"cited_work":{"arxiv_id":"2504.00291","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.00291","snapshot_observed_at":"2026-07-03T02:27:35.279883Z","title":"Preparing graph states forbidding a vertex-minor","venue":null,"work_id":"f48c150f-19c2-4be7-aa1d-8aa51bacb6f4","year":null},"citing_paper":{"arxiv_id":"2606.09785","last_updated":"2026-06-08T17:42:31Z","snapshot_observed_at":"2026-08-02T17:04:44.169209Z","submitted_at":"2026-06-08T17:42:31Z","title":"Biclique decompositions from Welzl orders","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T15:54:06.194541Z"},"links":{"cited_paper":"/paper/2504.00291","citing_paper":"/paper/2606.09785"},"observation_digest":"sha256:cc447962c1bbd7f42e338a568ee2bb4579b5a8ef30850829115cbbcb8b8b62e7","observation_id":"00fa04fd-98c3-4b4f-9c8c-58c3c6fb32c6","resolution":{"observed_at":"2026-07-03T02:27:35.281408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00291","last_updated":"2025-07-27T19:32:24Z","snapshot_observed_at":"2026-08-07T16:19:01.339198Z","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00291","snapshot_observed_at":"2026-07-13T02:48:08.655303Z","title":"arXiv preprint arXiv:2504.00291 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09469","last_updated":"2026-07-10T14:42:55Z","snapshot_observed_at":"2026-08-03T16:07:59.568002Z","submitted_at":"2026-07-10T14:42:55Z","title":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-13T02:48:08.655303Z"},"links":{"cited_paper":"/paper/2504.00291","citing_paper":"/paper/2607.09469"},"observation_digest":"sha256:6e88911a4433c8d44f3dbe4b9c5472fb2deac00bca617183f556b40d0edd2d8e","observation_id":"05c3855b-c562-4caf-9c2a-6c5fbc5e975a","resolution":{"observed_at":"2026-07-13T02:48:08.655303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.00291/citation-record","integrity":"/paper/2504.00291/integrity","json":"/paper/2504.00291/citation-record.json","paper":"/paper/2504.00291"},"outbound":[],"paper":{"arxiv_id":"2504.00291","last_updated":"2025-07-27T19:32:24Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:19:01.339198Z","submitted_at":"2025-03-31T23:25:35Z","title":"Preparing graph states forbidding a vertex-minor"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.00291."}