{"as_of":"2026-08-16T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a187270421b5b66e1b5dd0afe2d7a538d3394f62ffe7488919a1b2a831bbd35","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-16T06:30:59.297886+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-10T19:16:12.133454Z","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-05T15:36:03.951264Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.13451","last_updated":"2025-01-06T11:18:07Z","snapshot_observed_at":"2026-08-16T07:10:15.546690Z","submitted_at":"2024-10-17T11:25:44Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13451","snapshot_observed_at":"2026-08-10T19:16:12.133454Z","title":"Parallel and distributed expander decomposition: Simple, fast, and near-optimal","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-12T22:34:32.774764Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.133454Z"},"links":{"cited_paper":"/paper/2410.13451","citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:eb72cb91a4e7b3359aea232506f4cd840c790b44d9d728517cd1f69ae9f72fef","observation_id":"70d4fd31-4bab-45f5-9ccf-7f179832c52d","resolution":{"observed_at":"2026-08-10T19:16:12.133454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13451","last_updated":"2025-01-06T11:18:07Z","snapshot_observed_at":"2026-08-16T07:10:15.546690Z","submitted_at":"2024-10-17T11:25:44Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","version":2},"cited_work":{"arxiv_id":"2410.13451","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.13451","snapshot_observed_at":"2026-08-05T15:36:03.951264Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","venue":"cs.DS","work_id":"c8cebe66-3163-4fbb-b111-b5dcbc04750f","year":2024},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.737504Z"},"links":{"cited_paper":"/paper/2410.13451","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:ee75b53c9386433c59ee752b809333dd945309efaaaa9576ad9a208985a36f3f","observation_id":"a1c6045b-2e9e-41a7-aac6-de22dbe673a3","resolution":{"observed_at":"2026-08-05T15:36:03.955212Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.13451/citation-record","integrity":"/paper/2410.13451/integrity","json":"/paper/2410.13451/citation-record.json","paper":"/paper/2410.13451"},"outbound":[],"paper":{"arxiv_id":"2410.13451","last_updated":"2025-01-06T11:18:07Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T07:10:15.546690Z","submitted_at":"2024-10-17T11:25:44Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.13451."}