{"as_of":"2026-08-16T14:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b10c5342fefaedd29e415f753f38861cd67d267e0d84eb94e9ad9122bd9f677","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:59:16.557455Z","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-06-30T05:54:18.804346Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.08975","last_updated":"2022-01-20T02:39:37Z","snapshot_observed_at":"2026-08-16T08:45:47.335132Z","submitted_at":"2021-03-16T11:05:48Z","title":"Tight Bounds for Inverting Permutations via Compressed Oracle Arguments","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.08975","snapshot_observed_at":"2026-08-16T10:59:16.557455Z","title":"SDitH in the QROM","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16887","last_updated":"2025-05-13T17:05:17Z","snapshot_observed_at":"2026-08-16T10:50:59.609252Z","submitted_at":"2025-04-23T17:04:25Z","title":"The Sponge is Quantum Indifferentiable","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T10:59:16.557455Z"},"links":{"cited_paper":"/paper/2103.08975","citing_paper":"/paper/2504.16887"},"observation_digest":"sha256:e7b26960bec96fcea1b711578c28efdec42560aa085677555476a97cc9d9bc1d","observation_id":"21d7cb5f-4f8f-4cc2-9b91-08a1082a8b7e","resolution":{"observed_at":"2026-08-16T10:59:16.557455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.08975","last_updated":"2022-01-20T02:39:37Z","snapshot_observed_at":"2026-08-16T08:45:47.335132Z","submitted_at":"2021-03-16T11:05:48Z","title":"Tight Bounds for Inverting Permutations via Compressed Oracle Arguments","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.08975","snapshot_observed_at":"2026-08-16T10:34:25.233823Z","title":"Hash Functions Based on Block Ciphers: A Synthetic Approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.18188","last_updated":"2025-04-25T09:07:55Z","snapshot_observed_at":"2026-08-16T10:20:02.232272Z","submitted_at":"2025-04-25T09:07:55Z","title":"Quantum Lifting for Invertible Permutations and Ideal Ciphers","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T10:34:25.233823Z"},"links":{"cited_paper":"/paper/2103.08975","citing_paper":"/paper/2504.18188"},"observation_digest":"sha256:73a4d6d969cc987f95c455859d729372753600f634790a3d6c9db0ab18817252","observation_id":"e9e23d9e-3f87-406b-baca-9bb7e0ff78ad","resolution":{"observed_at":"2026-08-16T10:34:25.233823Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.08975","last_updated":"2022-01-20T02:39:37Z","snapshot_observed_at":"2026-08-16T08:45:47.335132Z","submitted_at":"2021-03-16T11:05:48Z","title":"Tight Bounds for Inverting Permutations via Compressed Oracle Arguments","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.08975","snapshot_observed_at":"2026-08-15T16:24:36.954037Z","title":"Tight bounds for inverting permutations via compressed oracle arguments","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07876","last_updated":"2025-09-09T15:58:50Z","snapshot_observed_at":"2026-08-15T16:07:02.557763Z","submitted_at":"2025-09-09T15:58:50Z","title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:36.954037Z"},"links":{"cited_paper":"/paper/2103.08975","citing_paper":"/paper/2509.07876"},"observation_digest":"sha256:d70f119c0d58f2d8030d8197e5b83189dc99d2b788c48173a434029ecdcf9ef8","observation_id":"25c63adb-7923-4b3e-bf13-7a55dbbd25b6","resolution":{"observed_at":"2026-08-15T16:24:36.954037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.08975","last_updated":"2022-01-20T02:39:37Z","snapshot_observed_at":"2026-08-16T08:45:47.335132Z","submitted_at":"2021-03-16T11:05:48Z","title":"Tight Bounds for Inverting Permutations via Compressed Oracle Arguments","version":2},"cited_work":{"arxiv_id":"2103.08975","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.08975","snapshot_observed_at":"2026-06-30T05:54:18.804346Z","title":"Tight bounds for inverting permutations via compressed oracle arguments","venue":null,"work_id":"c659e48c-66d9-45ad-b002-7fe62963fbdd","year":null},"citing_paper":{"arxiv_id":"2606.30281","last_updated":"2026-06-29T13:23:17Z","snapshot_observed_at":"2026-08-13T21:10:08.099313Z","submitted_at":"2026-06-29T13:23:17Z","title":"Quantum Lazy Sampling and Path Recording for Any Group","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T05:50:31.479555Z"},"links":{"cited_paper":"/paper/2103.08975","citing_paper":"/paper/2606.30281"},"observation_digest":"sha256:6355910dfdba1ac5f6ca74d1452c7c53ff7bf330fb41b072469b92b0b70073f4","observation_id":"6af0c0d8-db10-4877-80e8-89aa9e21c174","resolution":{"observed_at":"2026-06-30T05:54:18.806017Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2103.08975/citation-record","integrity":"/paper/2103.08975/integrity","json":"/paper/2103.08975/citation-record.json","paper":"/paper/2103.08975"},"outbound":[],"paper":{"arxiv_id":"2103.08975","last_updated":"2022-01-20T02:39:37Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T08:45:47.335132Z","submitted_at":"2021-03-16T11:05:48Z","title":"Tight Bounds for Inverting Permutations via Compressed Oracle Arguments"},"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 4 inbound Pith citation observations for arXiv:2103.08975."}