{"as_of":"2026-08-17T01:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0925e422705d3f3f760f29a57fa365ae9de681bccf9af0531c6c5e3558ebab9","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:20:48.836657Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01509/citation-record","integrity":"/paper/1908.01509/integrity","json":"/paper/1908.01509/citation-record.json","paper":"/paper/1908.01509"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.946511Z","title":null,"venue":null,"work_id":"c12b5a29-bcab-4dc8-af39-a53f9a2b2dde","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.808164Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:0bd3a87fea0a7cafa9bd6ead2f4aad8b4c4a62fcbb0fa2f039880e7def10c86a","observation_id":"81d37066-0dfd-43af-82ab-827a43ed59d6","resolution":{"observed_at":"2026-08-14T15:20:48.949740Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.935899Z","title":null,"venue":null,"work_id":"53e8269f-8cb9-4f16-b75f-23e45b0a4b1d","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.812209Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:f73d6e4903307587fcc75711de836ab227df232a60d3400f295fc2d94782f646","observation_id":"e9255f25-310c-4c18-a08e-123daa0196bf","resolution":{"observed_at":"2026-08-14T15:20:48.939337Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.924403Z","title":"It remains to be shown thatall of [3 + 3N0∪4 + 3N0] is indeed hit","venue":null,"work_id":"db6463b3-597d-48f6-baf0-a3ea10d8997f","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.815699Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:3d6a0885f5db76257862bb16f1c20f0638666880161032465456a082afefc77d","observation_id":"112ad814-b476-444d-b08e-f3410a7a4ad9","resolution":{"observed_at":"2026-08-14T15:20:48.928489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.912514Z","title":null,"venue":null,"work_id":"a5c7dd88-17c0-47c1-983a-914b496b554a","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.819484Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:54ce6694e2acd94ca76193b621fa6d9637d924c60954a37c0da242418084bf62","observation_id":"e699fd94-73ae-41e6-90a2-bd9eb4aeb610","resolution":{"observed_at":"2026-08-14T15:20:48.916400Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.899968Z","title":null,"venue":null,"work_id":"f1a83138-79cc-49d6-adfc-76b2cf43f5da","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.823563Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:e3e9b8d8700b54bfdc24ddd44cbc8b4fee68a5a6d1f93ae4f1fd74fc5abd0de3","observation_id":"5c7a711a-3154-441e-a749-146af4472556","resolution":{"observed_at":"2026-08-14T15:20:48.904225Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.888783Z","title":"of any and allN consecutive elements of [N\\1], exactlyN are included in the strings","venue":null,"work_id":"33f7e45d-c49e-42ae-9f96-0cdd7964363b","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.827264Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:4267d32ed0775f13a34f86ab5e31aa426ee1dd9fecbfe143de5be481abdceeae","observation_id":"df326aa9-a3b7-49b9-9c9e-6a5335ce6e24","resolution":{"observed_at":"2026-08-14T15:20:48.892562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.877815Z","title":"of any and all 4m consecutive elements of [N\\1], exactly so many are in the strings","venue":null,"work_id":"48284052-9b31-4421-8a3e-747a91e453de","year":2010},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.832464Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:c3c4039cf1e7faee6fb11c59ab2d3e560c3210994525875dae7d57c74e8af96a","observation_id":"efb11927-1ad7-4d08-bb24-852ec3eb9d41","resolution":{"observed_at":"2026-08-14T15:20:48.881633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:20:48.863541Z","title":"If this preimage is 3 (mod 4), take the preimage of it","venue":null,"work_id":"5c8c2f17-a4db-42cb-83f2-c1fe8b1e68e5","year":null},"citing_paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:20:48.836657Z"},"links":{"citing_paper":"/paper/1908.01509"},"observation_digest":"sha256:30d269c9cc58914b9ca88cdd5c8725284543f6eb662049becbbed6bc6f967ce5","observation_id":"eaa4153e-87b8-4820-b591-8ab7a105048e","resolution":{"observed_at":"2026-08-14T15:20:48.869644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1908.01509","last_updated":"2019-08-05T08:16:41Z","latest_version":1,"primary_category":"math.NT","snapshot_observed_at":"2026-08-16T06:29:40.979443Z","submitted_at":"2019-08-05T08:16:41Z","title":"The 3n+1 problem: a partition of interest"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":8},"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 17 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:1908.01509."}