{"as_of":"2026-08-11T16:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54f758872f1276f9b2d120b13582f58e9664ba0c370cfff0e326cf14ce731eab","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T00:49:40.902263Z","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-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.10041/citation-record","integrity":"/paper/2607.10041/integrity","json":"/paper/2607.10041/citation-record.json","paper":"/paper/2607.10041"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T00:49:40.902263Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T00:49:40.902263Z"},"links":{"citing_paper":"/paper/2607.10041"},"observation_digest":"sha256:466efac442503acd02611e5dc3808cf38b0a241f82a9d6d15110d5b352b4cfc1","observation_id":"ae353ef4-794d-450a-a961-5bfb009981ba","resolution":{"observed_at":"2026-07-14T00:49:40.902263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T00:49:40.902263Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T00:49:40.902263Z"},"links":{"citing_paper":"/paper/2607.10041"},"observation_digest":"sha256:4ad26f2213a6533263ca44c5034a21a4e7658fe530e1236a5c8c7764db453402","observation_id":"f79877b5-6c43-440c-a9bd-e84b4d3d3ec8","resolution":{"observed_at":"2026-07-14T00:49:40.902263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T00:49:40.902263Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T00:49:40.902263Z"},"links":{"citing_paper":"/paper/2607.10041"},"observation_digest":"sha256:998b88daa2b5cff1fe12429c4842733e730a082ad6fd7e5d5110c5a2f9264506","observation_id":"c577210b-e470-4c76-83da-2d9425bff92e","resolution":{"observed_at":"2026-07-14T00:49:40.902263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T00:49:40.902263Z","title":"Beyer and H.-P","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T00:49:40.902263Z"},"links":{"citing_paper":"/paper/2607.10041"},"observation_digest":"sha256:91aa2172d8b06e9cd232536a64d18cd3cb04fb38691559002cc02f647d26c67f","observation_id":"4473f464-878c-4fbd-85f8-9d0ef529d7c5","resolution":{"observed_at":"2026-07-14T00:49:40.902263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T00:49:40.902263Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T00:49:40.902263Z"},"links":{"citing_paper":"/paper/2607.10041"},"observation_digest":"sha256:ce4e8108bb8b41b89aa4d26c72bd33b4158895cefbdd4a543fe703c3fdd5ef17","observation_id":"877922ee-054e-45e6-8f45-dd28a7bbad90","resolution":{"observed_at":"2026-07-14T00:49:40.902263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10041","last_updated":"2026-07-10T23:45:46Z","latest_version":1,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-08T13:32:42.443388Z","submitted_at":"2026-07-10T23:45:46Z","title":"Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:2607.10041."}