{"as_of":"2026-08-19T12:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b21f1cf6ca9ce8b8330dcdef4e7e8eea0df99cedb4846bcaf68756959e4871b","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-19T06:32:44.657259+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-16T05:57:51.536948Z","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-10T11:50:20.160571Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.3935","last_updated":"2013-05-16T04:37:28Z","snapshot_observed_at":"2026-08-15T00:21:32.882007Z","submitted_at":"2013-04-14T19:21:14Z","title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.3935","snapshot_observed_at":"2026-08-16T05:57:51.536948Z","title":"Rosenbaum","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.536948Z"},"links":{"cited_paper":"/paper/1304.3935","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0c6d110c08f5cf727e9b58c2b06c9cfca0101c14d92983e988316bd07181a92e","observation_id":"dc080a37-3c58-4a67-be7e-fd062072e2fb","resolution":{"observed_at":"2026-08-16T05:57:51.536948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.3935","last_updated":"2013-05-16T04:37:28Z","snapshot_observed_at":"2026-08-15T00:21:32.882007Z","submitted_at":"2013-04-14T19:21:14Z","title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing","version":2},"cited_work":{"arxiv_id":"1304.3935","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1304.3935","snapshot_observed_at":"2026-07-04T18:29:25.652873Z","title":"Rosenbaum","venue":null,"work_id":"95729895-7d9f-4346-95c7-5ba92e15cbcf","year":null},"citing_paper":{"arxiv_id":"2604.13953","last_updated":"2026-04-15T15:04:26Z","snapshot_observed_at":"2026-08-16T23:46:42.945309Z","submitted_at":"2026-04-15T15:04:26Z","title":"Parallel Algorithms for Group Isomorphism via Code Equivalence","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T11:49:09.145117Z"},"links":{"cited_paper":"/paper/1304.3935","citing_paper":"/paper/2604.13953"},"observation_digest":"sha256:3b5d63e4518d199dc3320bbb4f8e94ec9e9f2c13cf0a516aa0dbddaa02dca775","observation_id":"8d85e484-9ef1-45d4-81ae-99b0ba2cf1ef","resolution":{"observed_at":"2026-07-04T18:29:25.652873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1304.3935/citation-record","integrity":"/paper/1304.3935/integrity","json":"/paper/1304.3935/citation-record.json","paper":"/paper/1304.3935"},"outbound":[],"paper":{"arxiv_id":"1304.3935","last_updated":"2013-05-16T04:37:28Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T00:21:32.882007Z","submitted_at":"2013-04-14T19:21:14Z","title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1304.3935."}