{"as_of":"2026-08-07T06:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7371b9a00ec76484118ec64a098289849ba10babb130e04e800ad67bf8e87722","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-07T06:34:17.273281+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-06-28T08:26:09.374909Z","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-07-06T03:27:38.351508Z","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-07-06T19:51:05.604758Z","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:461ea9fe22e3a3d28a0cc960a55f96864ec310ae9a6d14cdb4427982a0205729","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-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":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-07-06T03:27:38.351508Z","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-03T21:38:10.216890Z","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:a0e761d86ca4a087bd6c5dccc970736415a0e055a0c46d60e77ada8e378da7a3","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-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":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-07-06T03:27:38.351508Z","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-07T03:03:30.395220Z","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:ed17ecfa65278f7047b6a70e728defd28dbf59c6be79822a2b8b09a5348a9054","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-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/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-07-06T03:27:38.351508Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1311.1714."}