{"as_of":"2026-08-23T05:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af270aa8d5394407708a4f7e02ec9fa80487f4c08e5b9fed91cef9d32fad67e6","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T12:01:57.764416Z","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-05-16T12:02:50.773006Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.03137","last_updated":"2015-11-10T15:29:19Z","snapshot_observed_at":"2026-08-14T22:24:04.041533Z","submitted_at":"2015-11-10T15:29:19Z","title":"k-way Hypergraph Partitioning via n-Level Recursive Bisection","version":1},"cited_work":{"arxiv_id":"1511.03137","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.03137","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"k-way Hypergraph Partitioning via n-Level Recursive Bisection","venue":"cs.DS","work_id":"2014ec6d-5e78-4563-8d64-5464624bfae0","year":2015},"citing_paper":{"arxiv_id":"2601.16118","last_updated":"2026-04-21T16:32:45Z","snapshot_observed_at":"2026-08-15T00:05:51.370698Z","submitted_at":"2026-01-22T17:13:57Z","title":"A Case for Hypergraphs to Model and Map SNNs on Neuromorphic Hardware","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-16T12:01:57.764416Z"},"links":{"cited_paper":"/paper/1511.03137","citing_paper":"/paper/2601.16118"},"observation_digest":"sha256:6d0a4b23ebbf2701a47a2b58caefb7378ce1d3c97341cfccece8416e7211da53","observation_id":"d53b3d99-a69e-46c1-8bff-749b5ef8abfe","resolution":{"observed_at":"2026-05-16T12:02:50.775445Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1511.03137/citation-record","integrity":"/paper/1511.03137/integrity","json":"/paper/1511.03137/citation-record.json","paper":"/paper/1511.03137"},"outbound":[],"paper":{"arxiv_id":"1511.03137","last_updated":"2015-11-10T15:29:19Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:24:04.041533Z","submitted_at":"2015-11-10T15:29:19Z","title":"k-way Hypergraph Partitioning via n-Level Recursive Bisection"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1511.03137."}