{"as_of":"2026-08-08T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4139ef00c7c8ae86f4b7956c0178e76cef0d5278eb0ca10595db4944061a9e1","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:16:58.422024Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06T17:49:46.807860Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T17:49:47.212876Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"cited_work":{"arxiv_id":"2506.08547","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.08547","snapshot_observed_at":"2026-08-06T17:49:47.212876Z","title":"A Refined Algorithm For the EPR model","venue":"quant-ph","work_id":"9a8052ea-a6c4-4e57-8aef-6c0ca3767f18","year":2025},"citing_paper":{"arxiv_id":"2507.10050","last_updated":"2025-07-14T08:31:08Z","snapshot_observed_at":"2026-08-07T02:35:12.044748Z","submitted_at":"2025-07-14T08:31:08Z","title":"Testing APS conjecture on regular graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:49:46.807860Z"},"links":{"cited_paper":"/paper/2506.08547","citing_paper":"/paper/2507.10050"},"observation_digest":"sha256:a5e2a23745b757fdfe03c930b4d1a8b3c903603c7d85201c67db9256ad3f4497","observation_id":"6e1d3549-37e2-4fc0-943e-38d752a66b48","resolution":{"observed_at":"2026-08-06T17:49:47.218143Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.08547/citation-record","integrity":"/paper/2506.08547/integrity","json":"/paper/2506.08547/citation-record.json","paper":"/paper/2506.08547"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02589","snapshot_observed_at":"2026-08-07T05:16:58.379901Z","title":"[https://arxiv.org/abs/2209.02589]","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.379901Z"},"links":{"cited_paper":"/paper/2209.02589","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:9597bd625a88d888b9801df83391db77f6815cb1cea770d779fe37d557e3acb4","observation_id":"90ca42e9-32bd-48c5-b27d-acbc9b501732","resolution":{"observed_at":"2026-08-07T05:16:58.379901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.04014","last_updated":"2015-12-15T15:35:49Z","snapshot_observed_at":"2026-07-06T04:20:43.185357Z","submitted_at":"2015-06-12T13:26:26Z","title":"The complexity of antiferromagnetic interactions and 2D lattices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.04014","snapshot_observed_at":"2026-08-07T05:16:58.383938Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.383938Z"},"links":{"cited_paper":"/paper/1506.04014","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:6d243929df6c47966ae483d525553563801225604017eda498979f7414045182","observation_id":"f3fdad90-4e10-42d8-b62a-a24c28e40cb9","resolution":{"observed_at":"2026-08-07T05:16:58.383938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0606140","last_updated":"2007-10-02T17:22:07Z","snapshot_observed_at":"2026-07-07T07:22:56.686152Z","submitted_at":"2006-06-16T19:36:58Z","title":"The Complexity of Stoquastic Local Hamiltonian Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0606140","snapshot_observed_at":"2026-08-07T05:16:58.387970Z","title":"DiVincenzo, Roberto I","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.387970Z"},"links":{"cited_paper":"/paper/quant-ph/0606140","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:596e87106d674900683f2f6290f2c7a041f187181d3643599d5b596977127ff2","observation_id":"8d1a7e17-bc37-4ad5-ac7a-a3bc8d2674a8","resolution":{"observed_at":"2026-08-07T05:16:58.387970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9907047","last_updated":"1999-07-24T07:01:01Z","snapshot_observed_at":"2026-07-07T07:29:21.743276Z","submitted_at":"1999-07-13T07:38:38Z","title":"Distributed Entanglement","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9907047","snapshot_observed_at":"2026-08-07T05:16:58.392000Z","title":"Wootters, 1999 Distributed Entanglement,Phys.Rev","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.392000Z"},"links":{"cited_paper":"/paper/quant-ph/9907047","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:9f2afb306c3a6c1b5d5593707289657d2e40fb35b23bfaafc4e6be3c351b8291","observation_id":"fd993ca8-8d35-4b3f-a4d4-cfeb9578367c","resolution":{"observed_at":"2026-08-07T05:16:58.392000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.14394","last_updated":"2020-03-31T17:41:13Z","snapshot_observed_at":"2026-08-04T12:56:37.044749Z","submitted_at":"2020-03-31T17:41:13Z","title":"Beyond product state approximations for a quantum analogue of Max Cut","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.14394","snapshot_observed_at":"2026-08-07T05:16:58.395911Z","title":"[https://arxiv.org/abs/2003.14394]","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.395911Z"},"links":{"cited_paper":"/paper/2003.14394","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:738bd23880a22f10db89d60cf979870a3c5f80f3026bade54185b0023c25819e","observation_id":"84df9eef-4b4f-4699-9eaa-f4f652b1e7b4","resolution":{"observed_at":"2026-08-07T05:16:58.395911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:16:58.399787Z","title":"[https://arxiv.org/abs/2401.03616]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.399787Z"},"links":{"citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:e7a511f83771f86220694d49f4dc414d03b7b5a30af61d25ac850e5f06ad7ce9","observation_id":"307f6d76-e475-4c6d-9d73-0e488a708dfa","resolution":{"observed_at":"2026-08-07T05:16:58.399787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11120","last_updated":"2025-04-15T12:08:07Z","snapshot_observed_at":"2026-08-07T16:05:31.260290Z","submitted_at":"2025-04-15T12:08:07Z","title":"Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11120","snapshot_observed_at":"2026-08-07T05:16:58.403423Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.403423Z"},"links":{"cited_paper":"/paper/2504.11120","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:d6832169d080adc72cdcb5ce67659c2235828084377992d9f736300c0fc69f2a","observation_id":"4d31fa0c-0f2e-4c8b-aca8-5d7807c40b8d","resolution":{"observed_at":"2026-08-07T05:16:58.403423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03441","last_updated":"2026-05-27T19:08:09Z","snapshot_observed_at":"2026-08-07T11:00:41.565142Z","submitted_at":"2025-06-03T22:52:10Z","title":"Conjectured Bounds for 2-Local Hamiltonians via Token Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03441","snapshot_observed_at":"2026-08-07T05:16:58.407220Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.407220Z"},"links":{"cited_paper":"/paper/2506.03441","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:4208137a10e2965ebc61f2f15e6ee0d8c4d4a9bc9a5abe57b8004b2f5d02b436","observation_id":"a4b0e97c-af29-486f-a31a-315150ddd45a","resolution":{"observed_at":"2026-08-07T05:16:58.407220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10712","last_updated":"2025-04-14T21:08:40Z","snapshot_observed_at":"2026-08-07T16:05:43.994872Z","submitted_at":"2025-04-14T21:08:40Z","title":"Improved approximation algorithms for the EPR Hamiltonian","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10712","snapshot_observed_at":"2026-08-07T05:16:58.410950Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.410950Z"},"links":{"cited_paper":"/paper/2504.10712","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:0a7b186edd9db8750ab6c6c5a1129ef8c66a40bd92e7d512830eb5732afdce98","observation_id":"5a0f8a9d-43e3-405f-a12b-fdda51248400","resolution":{"observed_at":"2026-08-07T05:16:58.410950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:16:58.648495Z","title":"Fractional Entanglement Distribution","venue":null,"work_id":"ec00b9c7-d4da-4079-8eb6-83593dec9070","year":null},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.375031Z"},"links":{"citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:cbbd6912956b857a586db9448873d0b8964fcf1b71ea1fb53083ebb118653dbc","observation_id":"c071c428-a09b-44df-8f5a-17178f22e8f5","resolution":{"observed_at":"2026-08-07T05:16:58.652578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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.15276","last_updated":"2025-04-21T17:59:02Z","snapshot_observed_at":"2026-08-07T16:00:30.184505Z","submitted_at":"2025-04-21T17:59:02Z","title":"Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15276","snapshot_observed_at":"2026-08-07T05:16:58.414761Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.414761Z"},"links":{"cited_paper":"/paper/2504.15276","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:547371bf9472401efee7ec18c94cdbf99c28300f149bf44460faff1fbefe7a80","observation_id":"4c05fc27-b79b-4364-80ee-ce13a54be2dc","resolution":{"observed_at":"2026-08-07T05:16:58.414761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:16:58.637703Z","title":"Lovász, and M","venue":null,"work_id":"76541172-9a46-4b7a-b423-e134bab7d6a8","year":1986},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.418489Z"},"links":{"citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:0b441dd2e77ff7347d167ecd29dd78faab666a9308de75a9241a504d96147ac0","observation_id":"0946b913-19eb-4896-a29d-0ff441130427","resolution":{"observed_at":"2026-08-07T05:16:58.641415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:16:58.624054Z","title":null,"venue":null,"work_id":"d997a52b-ef31-4cde-bc88-37c915652013","year":1931},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.422024Z"},"links":{"citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:48fbc26e70dd02f038a2d9f0f7ae62445953cc55a8bd3a3aea1fcb9bffa0f30a","observation_id":"93df93a1-2889-486e-aea8-c055582bab4f","resolution":{"observed_at":"2026-08-07T05:16:58.629900Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":13},"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 13 of 13 outbound references and 1 inbound Pith citation observation for arXiv:2506.08547."}