{"as_of":"2026-08-10T21:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c8109d1cee61e4a7f2c43801616a7476a9e76d2263842915b3d77dd0ee292980","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:16:31.519531Z","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-07T05:21:07.220530Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.01699","last_updated":"2025-07-13T11:30:02Z","snapshot_observed_at":"2026-07-06T19:09:36.622509Z","submitted_at":"2024-09-03T08:36:23Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01699","snapshot_observed_at":"2026-08-08T17:16:31.519531Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-10T00:05:16.413830Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.519531Z"},"links":{"cited_paper":"/paper/2409.01699","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:8e73af76d1b2c58c0909676023f6255e3c7f2f0ac429c348b9fcdd35b07e6590","observation_id":"f2eef250-224b-4928-ab93-0444eca82736","resolution":{"observed_at":"2026-08-08T17:16:31.519531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01699","last_updated":"2025-07-13T11:30:02Z","snapshot_observed_at":"2026-07-06T19:09:36.622509Z","submitted_at":"2024-09-03T08:36:23Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization","version":3},"cited_work":{"arxiv_id":"2409.01699","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.01699","snapshot_observed_at":"2026-08-07T05:21:07.220530Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization","venue":"cond-mat.stat-mech","work_id":"6f4cf892-55b6-4564-98bf-9bbdfd5c7aa4","year":2024},"citing_paper":{"arxiv_id":"2506.08448","last_updated":"2025-06-10T04:50:09Z","snapshot_observed_at":"2026-08-10T07:58:58.786988Z","submitted_at":"2025-06-10T04:50:09Z","title":"Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:21:07.126633Z"},"links":{"cited_paper":"/paper/2409.01699","citing_paper":"/paper/2506.08448"},"observation_digest":"sha256:d83db47c8d65d221c00f787fe1a1d3ac653fb01e6d870ada7af3c4386544c380","observation_id":"a3a68a26-2cec-402c-a940-022522f011bb","resolution":{"observed_at":"2026-08-07T05:21:07.227813Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2409.01699/citation-record","integrity":"/paper/2409.01699/integrity","json":"/paper/2409.01699/citation-record.json","paper":"/paper/2409.01699"},"outbound":[],"paper":{"arxiv_id":"2409.01699","last_updated":"2025-07-13T11:30:02Z","latest_version":3,"primary_category":"cond-mat.stat-mech","snapshot_observed_at":"2026-07-06T19:09:36.622509Z","submitted_at":"2024-09-03T08:36:23Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2409.01699."}