{"as_of":"2026-08-12T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb9f6e689d0c770487426e6310c7d349548c2a63294828e8895a291080e426f3","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-12T06:34:41.77262+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-11T17:11:46.320386Z","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-04T20:10:07.184427Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-08-11T04:41:22.730319Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","version":9},"cited_work":{"arxiv_id":"1311.1714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1311.1714","snapshot_observed_at":"2026-07-04T20:10:07.184427Z","title":"Sanders and C","venue":null,"work_id":"054d306b-b4a6-4a8d-b06e-eba8b8c66f05","year":2013},"citing_paper":{"arxiv_id":"2411.10406","last_updated":"2026-03-13T03:26:12Z","snapshot_observed_at":"2026-08-11T03:19:11.687962Z","submitted_at":"2024-11-15T18:22:46Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","version":3},"reference_index":175,"source":"pdf_text","source_observed_at":"2026-05-18T22:41:36.363536Z"},"links":{"cited_paper":"/paper/1311.1714","citing_paper":"/paper/2411.10406"},"observation_digest":"sha256:82bc717b881f45d8935a5b70e3a9d0475308141ad228102a62d5aa3125a418ac","observation_id":"cd4f2a1e-0bd2-44d9-b8aa-b32845681337","resolution":{"observed_at":"2026-05-18T22:41:36.743859Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-08-11T04:41:22.730319Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.1714","snapshot_observed_at":"2026-08-11T17:11:46.320386Z","title":"Sanders \\ and\\ author C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.09285","last_updated":"2024-12-12T13:54:37Z","snapshot_observed_at":"2026-08-12T13:47:12.250984Z","submitted_at":"2024-12-12T13:54:37Z","title":"Free-Energy Machine for Combinatorial Optimization","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T17:11:46.320386Z"},"links":{"cited_paper":"/paper/1311.1714","citing_paper":"/paper/2412.09285"},"observation_digest":"sha256:1e11cf4b97a1c69f94e2cd42ee3da7ec30174f3e3bf8ef784aba53c883684c63","observation_id":"d6eeff5e-8261-4930-ab4a-8402f20f39ef","resolution":{"observed_at":"2026-08-11T17:11:46.320386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-08-11T04:41:22.730319Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","version":9},"cited_work":{"arxiv_id":"1311.1714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1311.1714","snapshot_observed_at":"2026-07-04T20:10:07.184427Z","title":"Sanders and C","venue":null,"work_id":"054d306b-b4a6-4a8d-b06e-eba8b8c66f05","year":2013},"citing_paper":{"arxiv_id":"2606.03519","last_updated":"2026-06-02T11:39:43Z","snapshot_observed_at":"2026-08-09T18:36:14.803591Z","submitted_at":"2026-06-02T11:39:43Z","title":"SIGMA: A Versatile Streaming Graph Partitioner for Vertex- and Edge-Balanced Distributed GNN Training","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T08:26:09.374909Z"},"links":{"cited_paper":"/paper/1311.1714","citing_paper":"/paper/2606.03519"},"observation_digest":"sha256:4bab5e4d5b8e70d7191225ce48159e30c27817cf6cc5c2707cdf12999a4860c7","observation_id":"3c2b527b-5f05-482f-aaa5-ef0e5d962669","resolution":{"observed_at":"2026-07-02T05:16:38.934687Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-08-11T04:41:22.730319Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","version":9},"cited_work":{"arxiv_id":"1311.1714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1311.1714","snapshot_observed_at":"2026-07-04T20:10:07.184427Z","title":"Sanders and C","venue":null,"work_id":"054d306b-b4a6-4a8d-b06e-eba8b8c66f05","year":2013},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-08-11T17:37:54.786129Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/1311.1714","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2c364a044ec1fa9eb69d9322936a990f1b641db9d78bcb4f1127f9c59c9a49c6","observation_id":"4077170a-89ea-4403-913b-c1e4d9b149b7","resolution":{"observed_at":"2026-07-04T20:10:07.186379Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1311.1714/citation-record","integrity":"/paper/1311.1714/integrity","json":"/paper/1311.1714/citation-record.json","paper":"/paper/1311.1714"},"outbound":[],"paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","latest_version":9,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-11T04:41:22.730319Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1311.1714."}