{"as_of":"2026-08-08T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:044f184c4610594fe8a8f6854a42f8775b59ec90d9bdef94e6c8c10a3eafd948","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-08T06:32:00.761636+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-07-14T03:41:44.573679Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1209.6348","last_updated":"2012-09-27T19:54:28Z","snapshot_observed_at":"2026-07-06T02:56:30.680871Z","submitted_at":"2012-09-27T19:54:28Z","title":"Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.6348","snapshot_observed_at":"2026-07-14T03:41:44.573679Z","title":"arXiv preprint arXiv:1209.6348 (2012) 6 https://github.com/seokhyung-lee/msd-magic-state-prep-cycle-simulation Quantum Arithmetic Circuits in Public-Key Cryptography 21","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11713","last_updated":"2026-07-13T15:40:57Z","snapshot_observed_at":"2026-07-16T23:19:58.687068Z","submitted_at":"2026-07-13T15:40:57Z","title":"Quantum Arithmetic Circuits in Public-Key Cryptography","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T03:41:44.573679Z"},"links":{"cited_paper":"/paper/1209.6348","citing_paper":"/paper/2607.11713"},"observation_digest":"sha256:a88485f7fb03976fc451b9a5462932a3963b8708d213792ff0ccd35ccd186806","observation_id":"29c0b995-4fed-4702-8fe4-c3747752b640","resolution":{"observed_at":"2026-07-14T03:41:44.573679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1209.6348/citation-record","integrity":"/paper/1209.6348/integrity","json":"/paper/1209.6348/citation-record.json","paper":"/paper/1209.6348"},"outbound":[],"paper":{"arxiv_id":"1209.6348","last_updated":"2012-09-27T19:54:28Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T02:56:30.680871Z","submitted_at":"2012-09-27T19:54:28Z","title":"Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1209.6348."}