{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OHUKCTCT4B5LXXQ7TEX7JPOZGG","short_pith_number":"pith:OHUKCTCT","schema_version":"1.0","canonical_sha256":"71e8a14c53e07abbde1f992ff4bdd9318d367743f175971861cd03fd7616e179","source":{"kind":"arxiv","id":"1911.01229","version":2},"attestation_state":"computed","paper":{"title":"The relationship between stopping time and number of odd terms in Collatz sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Rafael Ruggiero","submitted_at":"2019-11-01T12:33:51Z","abstract_excerpt":"The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such sequences end in 1 (Collatz conjecture), the alternative being the possibility of cycles or of unbounded sequences. In this paper, we present a formula relating the stopping time and the number of odd terms in a Collatz sequence, obtained numerically and tested for all numbers up to $10^7$ and for random numbers up to $2^{128.000}$. This result is presented a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1911.01229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-11-01T12:33:51Z","cross_cats_sorted":[],"title_canon_sha256":"a5e966d340354d77478a38152888172d1742b568e54722c224c04ab7904635d4","abstract_canon_sha256":"73ae9e4ae2c3835892265a1de22072af3a475e162c9dbdef4b53648d2db70a9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:39.274503Z","signature_b64":"/s9s9mNjlGkYL+kxrqN9Eb9X5qq837+7SpvX/YOcij4duYekERBfyndLT9oZNyOwumzA9wW+dk/LIWMU1CLkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e8a14c53e07abbde1f992ff4bdd9318d367743f175971861cd03fd7616e179","last_reissued_at":"2026-07-05T00:17:39.274081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:39.274081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The relationship between stopping time and number of odd terms in Collatz sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Rafael Ruggiero","submitted_at":"2019-11-01T12:33:51Z","abstract_excerpt":"The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such sequences end in 1 (Collatz conjecture), the alternative being the possibility of cycles or of unbounded sequences. In this paper, we present a formula relating the stopping time and the number of odd terms in a Collatz sequence, obtained numerically and tested for all numbers up to $10^7$ and for random numbers up to $2^{128.000}$. This result is presented a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01229","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.01229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.01229","created_at":"2026-07-05T00:17:39.274135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01229v2","created_at":"2026-07-05T00:17:39.274135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01229","created_at":"2026-07-05T00:17:39.274135+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHUKCTCT4B5L","created_at":"2026-07-05T00:17:39.274135+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHUKCTCT4B5LXXQ7","created_at":"2026-07-05T00:17:39.274135+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHUKCTCT","created_at":"2026-07-05T00:17:39.274135+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23070","citing_title":"Iteration Steps of 3x+1 Problem","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG","json":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG.json","graph_json":"https://pith.science/api/pith-number/OHUKCTCT4B5LXXQ7TEX7JPOZGG/graph.json","events_json":"https://pith.science/api/pith-number/OHUKCTCT4B5LXXQ7TEX7JPOZGG/events.json","paper":"https://pith.science/paper/OHUKCTCT"},"agent_actions":{"view_html":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG","download_json":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG.json","view_paper":"https://pith.science/paper/OHUKCTCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01229&json=true","fetch_graph":"https://pith.science/api/pith-number/OHUKCTCT4B5LXXQ7TEX7JPOZGG/graph.json","fetch_events":"https://pith.science/api/pith-number/OHUKCTCT4B5LXXQ7TEX7JPOZGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG/action/storage_attestation","attest_author":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG/action/author_attestation","sign_citation":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG/action/citation_signature","submit_replication":"https://pith.science/pith/OHUKCTCT4B5LXXQ7TEX7JPOZGG/action/replication_record"}},"created_at":"2026-07-05T00:17:39.274135+00:00","updated_at":"2026-07-05T00:17:39.274135+00:00"}