{"as_of":"2026-08-08T16:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6867b4561b3d66c70252c062288f2684b35ee0ec1e04241d8cfe53d88815ec9a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T14:24:36.211111Z","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-24T06:03:58.096011Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-07-06T20:33:34.521641Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":"2502.05981","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55c3e50a-2459-4ccd-ac6e-ca25d057aab0","year":2025},"citing_paper":{"arxiv_id":"2311.10433","last_updated":"2026-04-28T18:26:03Z","snapshot_observed_at":"2026-08-05T12:30:09.585763Z","submitted_at":"2023-11-17T10:10:46Z","title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-24T06:01:35.666365Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2311.10433"},"observation_digest":"sha256:9fe8910bd82f0afc8fd0f51b27c43b4caa704dcaac2f6817816cc26f6884d9b1","observation_id":"14667945-33f8-4997-8d16-42bb8c90b3bc","resolution":{"observed_at":"2026-05-24T06:03:58.099537Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-07-06T20:33:34.521641Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":"2502.05981","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55c3e50a-2459-4ccd-ac6e-ca25d057aab0","year":2025},"citing_paper":{"arxiv_id":"2508.00907","last_updated":"2026-04-30T07:53:34Z","snapshot_observed_at":"2026-08-06T08:46:45.697161Z","submitted_at":"2025-07-29T10:38:51Z","title":"Prime Factorization Equation from a Tensor Network Perspective","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T03:16:45.449657Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2508.00907"},"observation_digest":"sha256:d8e8d9ac1b6659e1feba269051d376e05140c800abfa9ed1e7b76808312acb44","observation_id":"7ca4496c-6162-4715-a9a8-e64d28fa841a","resolution":{"observed_at":"2026-05-19T03:17:00.729291Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-07-06T20:33:34.521641Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-08-03T14:24:36.211111Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.20613","last_updated":"2026-07-09T11:03:32Z","snapshot_observed_at":"2026-08-08T08:08:32.578749Z","submitted_at":"2025-12-23T18:58:35Z","title":"Variational matrix product states for combinatorial optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T14:24:36.211111Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2512.20613"},"observation_digest":"sha256:1c8c0ec7a8fbcd2eca4b408edd7e38c2036848bacdf383cce2a3a9de1c856d53","observation_id":"bfa45dfe-05cf-4ab6-8c2a-7c9fcf054896","resolution":{"observed_at":"2026-08-03T14:24:36.211111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05981/citation-record","integrity":"/paper/2502.05981/integrity","json":"/paper/2502.05981/citation-record.json","paper":"/paper/2502.05981"},"outbound":[],"paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","latest_version":1,"primary_category":"cs.ET","snapshot_observed_at":"2026-07-06T20:33:34.521641Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.05981."}