{"as_of":"2026-08-22T19:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f74b649597007900d3d9362b8dea2d5320eb38ef5e59e6dcfe62ef3949a8b858","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:41:16.869262Z","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-08-09T14:59:29.099544Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-11T10:41:16.869262Z","title":"Available as arXiv:2104.12019 https://arxiv.org/abs/2104.12019","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16386","last_updated":"2025-04-18T16:00:45Z","snapshot_observed_at":"2026-08-11T15:56:31.589561Z","submitted_at":"2024-12-20T22:45:54Z","title":"Groupoid Cardinality and Random Permutations","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:16.869262Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2412.16386"},"observation_digest":"sha256:56921e00721176c5fb25dc6412dce4abe3e5199648fc1922744dc2390d57e3c2","observation_id":"528878fa-b2db-423e-a704-8459d8708305","resolution":{"observed_at":"2026-08-11T10:41:16.869262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-10T17:12:50.001439Z","title":"Cycle type of random permutations: a toolkit","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-21T20:26:14.675985Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:50.001439Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:62c7b200ed7f8ea204481d0290456276ab92c63f3aeaa29c99891a78b681074a","observation_id":"9bae8b00-e2c2-4036-86db-2f3fb926659b","resolution":{"observed_at":"2026-08-10T17:12:50.001439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":"2104.12019","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-09T14:59:29.099544Z","title":"Cycle type of random permutations: A toolkit","venue":"math.CO","work_id":"ba22ced8-f1f9-4a5c-8009-335400b7162c","year":2021},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-14T16:05:47.035637Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.800845Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:7761605373f93327393d05df61c4dd08075d1587a5eeac3d43eff35bdd40bbe3","observation_id":"044cd301-d7be-49d5-ade7-722d939fc612","resolution":{"observed_at":"2026-08-09T14:59:29.109191Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-03T17:07:45.057756Z","title":"Ford, Cycle type of random permutations: A toolkit, Discrete Analysis 2022, 36 (2022) , arXiv:2104.12019","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.11054","last_updated":"2026-06-22T20:20:48Z","snapshot_observed_at":"2026-08-16T18:11:52.213711Z","submitted_at":"2025-12-11T19:11:26Z","title":"Crystalline Spectral Form Factors","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T17:07:45.057756Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2512.11054"},"observation_digest":"sha256:c061fcdf04c1c9b555a2c71f712d0a834c2662b77d6ded2e7c540f20983eb6bd","observation_id":"3876552b-6947-484a-a263-d95c92f92e9d","resolution":{"observed_at":"2026-08-03T17:07:45.057756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-11T04:20:46.913094Z","title":"Cycle type of random permutations: a toolkit.arXiv preprint arXiv:2104.12019, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.07790","last_updated":"2026-08-07T22:19:38Z","snapshot_observed_at":"2026-08-19T18:24:46.946444Z","submitted_at":"2026-08-07T22:19:38Z","title":"Permutation theory governs long-term dynamics of critical Boolean networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T04:20:46.913094Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2608.07790"},"observation_digest":"sha256:75b99e571a480bb8dfb11d6e83007d16839d83b56132122e94fc08543713107d","observation_id":"997dee1b-2dba-4117-a179-7fdbd432ea17","resolution":{"observed_at":"2026-08-11T04:20:46.913094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.12019/citation-record","integrity":"/paper/2104.12019/integrity","json":"/paper/2104.12019/citation-record.json","paper":"/paper/2104.12019"},"outbound":[],"paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-19T01:04:05.878720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit"},"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 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2104.12019."}