{"as_of":"2026-08-11T00:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b9de85568edc101e21f70151be2a64792ffce63fe7d117eea14a75c13109795","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:55:08.969158Z","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-19T07:47:09.430254Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-08-09T21:52:51.926754Z","title":"Zhu and M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.18967","last_updated":"2025-01-31T08:57:49Z","snapshot_observed_at":"2026-08-10T16:35:12.459237Z","submitted_at":"2025-01-31T08:57:49Z","title":"Calibrated hypergraph states: I calibrated hypergraph and multi qudit state monads","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T21:52:51.926754Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2501.18967"},"observation_digest":"sha256:a8eb27e662d56ccc5c31199e78e221de6d1e9c1e6d0d32d46b4950bdbed9cd9f","observation_id":"ac7c19aa-e39d-4d49-8b7f-05e69c25311b","resolution":{"observed_at":"2026-08-09T21:52:51.926754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-08-09T21:55:08.969158Z","title":"Zhu and M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.18968","last_updated":"2025-01-31T08:57:56Z","snapshot_observed_at":"2026-08-10T16:35:02.438819Z","submitted_at":"2025-01-31T08:57:56Z","title":"Calibrated hypergraph states: II calibrated hypergraph state construction and applications","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T21:55:08.969158Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2501.18968"},"observation_digest":"sha256:6bace4a924c7b662a52466016a86b41e515f7bd2b537b5ba46c2eee2d7f3ee83","observation_id":"3def13d7-2836-4ef5-8489-1ba90270799e","resolution":{"observed_at":"2026-08-09T21:55:08.969158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":"1806.05565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ef- ficient verification of hypergraph states","venue":null,"work_id":"56443312-6026-4ce4-882e-a0a0c2c1f0c0","year":2019},"citing_paper":{"arxiv_id":"2506.20075","last_updated":"2026-04-10T10:42:35Z","snapshot_observed_at":"2026-07-06T21:47:15.902527Z","submitted_at":"2025-06-25T01:02:22Z","title":"Randomized hypergraph states and their entanglement properties","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T07:44:30.256238Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2506.20075"},"observation_digest":"sha256:f750c0a99b3c45086a9f6710ab3a9019d5ebc6a7add67d1357ee9a9390f8b6f9","observation_id":"0b73b550-abd2-42c0-9e06-2669567c397f","resolution":{"observed_at":"2026-05-19T07:47:09.432247Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-08-03T23:13:35.978338Z","title":"Efficient Verification of Hypergraph States,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.07300","last_updated":"2026-06-11T11:21:43Z","snapshot_observed_at":"2026-08-10T03:48:03.177133Z","submitted_at":"2025-11-10T17:01:51Z","title":"Efficient certification of intractable quantum states with few Pauli measurements","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T23:13:35.978338Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2511.07300"},"observation_digest":"sha256:3398410a4b82256aba31d0ee7be822a62a9904182eb5ff91d971bd615526d455","observation_id":"2bdc5fc7-5e22-4608-bbd1-fcc4b5f7106c","resolution":{"observed_at":"2026-08-03T23:13:35.978338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":"1806.05565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ef- ficient verification of hypergraph states","venue":null,"work_id":"56443312-6026-4ce4-882e-a0a0c2c1f0c0","year":2019},"citing_paper":{"arxiv_id":"2512.02955","last_updated":"2026-04-21T17:11:43Z","snapshot_observed_at":"2026-08-10T23:53:26.244497Z","submitted_at":"2025-12-02T17:32:05Z","title":"Quantum hypergraph states: a review","version":3},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-05-17T02:04:17.292494Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2512.02955"},"observation_digest":"sha256:050e1fbb2a2ddbe9a5ce35650b2836be7e655e2223b63cde51ebf107a8df0e22","observation_id":"b6d2487a-c873-4272-a84d-adeecded96aa","resolution":{"observed_at":"2026-05-17T02:08:51.601651Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.05565","snapshot_observed_at":"2026-08-01T08:06:50.198629Z","title":"Efficient verification of hypergraph states","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21288","last_updated":"2026-07-23T13:09:18Z","snapshot_observed_at":"2026-08-09T13:11:13.261812Z","submitted_at":"2026-07-23T13:09:18Z","title":"Device-Independent Self-Testing of the Three-Qubit CCZ Hypergraph State","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T08:06:50.198629Z"},"links":{"cited_paper":"/paper/1806.05565","citing_paper":"/paper/2607.21288"},"observation_digest":"sha256:c536ad7b00d1a16f395ae03fdd000a8e40ac52d7b444ec72b0f3f9dfbfd578c4","observation_id":"2a997fac-9e89-4018-8429-a6833b15598d","resolution":{"observed_at":"2026-08-01T08:06:50.198629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1806.05565/citation-record","integrity":"/paper/1806.05565/integrity","json":"/paper/1806.05565/citation-record.json","paper":"/paper/1806.05565"},"outbound":[],"paper":{"arxiv_id":"1806.05565","last_updated":"2019-12-30T14:39:46Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T20:45:33.201278Z","submitted_at":"2018-06-14T14:10:12Z","title":"Efficient Verification of Hypergraph States"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1806.05565."}