{"as_of":"2026-08-07T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:baadfa5635b90a27493f535202580bf609a1ab01eb4ea7c5e4bb78dfed1c8b54","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-08-05T23:50:27.453540Z","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-13T01:42:04.397614Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1504.05155","last_updated":"2015-04-20T18:50:53Z","snapshot_observed_at":"2026-08-05T04:07:00.330913Z","submitted_at":"2015-04-20T18:50:53Z","title":"The Classification of Reversible Bit Operations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.05155","snapshot_observed_at":"2026-08-05T23:50:12.539893Z","title":"The classification of reversible bit operations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.04794","last_updated":"2025-08-06T18:10:37Z","snapshot_observed_at":"2026-08-06T07:25:20.927061Z","submitted_at":"2025-08-06T18:10:37Z","title":"Automorphism gadgets in homological product codes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:12.539893Z"},"links":{"cited_paper":"/paper/1504.05155","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:72b4ca114672e75c3668548d5487d914cf147ce03d958b189daa0f77ac82fe3e","observation_id":"64227948-4cbc-466f-ae3a-6f6dadf4755b","resolution":{"observed_at":"2026-08-05T23:50:12.539893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1504.05155","last_updated":"2015-04-20T18:50:53Z","snapshot_observed_at":"2026-08-05T04:07:00.330913Z","submitted_at":"2015-04-20T18:50:53Z","title":"The Classification of Reversible Bit Operations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.05155","snapshot_observed_at":"2026-08-05T23:50:27.453540Z","title":"The classification of reversible bit operations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.04796","last_updated":"2026-07-02T23:06:55Z","snapshot_observed_at":"2026-08-06T12:35:36.047653Z","submitted_at":"2025-08-06T18:14:43Z","title":"Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:27.453540Z"},"links":{"cited_paper":"/paper/1504.05155","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:248c59c46c53484197068e2b3cf8e02150b2551703e2175c786f029a71ae5ed1","observation_id":"8e9e80f3-94c0-4ea0-8636-e8175b2a5b6e","resolution":{"observed_at":"2026-08-05T23:50:27.453540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1504.05155","last_updated":"2015-04-20T18:50:53Z","snapshot_observed_at":"2026-08-05T04:07:00.330913Z","submitted_at":"2015-04-20T18:50:53Z","title":"The Classification of Reversible Bit Operations","version":1},"cited_work":{"arxiv_id":"1504.05155","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1504.05155","snapshot_observed_at":"2026-07-04T19:28:47.858875Z","title":"The classification of reversible bit operations","venue":null,"work_id":"beef7c42-cfb1-4ee6-8930-8e0389122b4a","year":2015},"citing_paper":{"arxiv_id":"2605.11318","last_updated":"2026-05-11T23:11:40Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-11T23:11:40Z","title":"Spatial overhead reduction for 2D hypergraph product codes","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-13T01:34:06.657863Z"},"links":{"cited_paper":"/paper/1504.05155","citing_paper":"/paper/2605.11318"},"observation_digest":"sha256:6602488888e82a84e5477290aa1aefd0328acb3cf3bd391f214edb917feb58fc","observation_id":"0df61cb2-a754-4a6b-8677-ff084f2a18bb","resolution":{"observed_at":"2026-07-04T19:28:47.858875Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1504.05155/citation-record","integrity":"/paper/1504.05155/integrity","json":"/paper/1504.05155/citation-record.json","paper":"/paper/1504.05155"},"outbound":[],"paper":{"arxiv_id":"1504.05155","last_updated":"2015-04-20T18:50:53Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-05T04:07:00.330913Z","submitted_at":"2015-04-20T18:50:53Z","title":"The Classification of Reversible Bit Operations"},"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:1504.05155."}