{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MQHQG2RO6CLDMJE3X7X7I5KFW3","short_pith_number":"pith:MQHQG2RO","canonical_record":{"source":{"id":"1907.07088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-07-14T21:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"5781c829b69bdf5bd30035294741265afe6b4ebae47c904eb79540b45a6ff089","abstract_canon_sha256":"5028549c8423813084ed4db288830343ac3b076f978b48bcc09fbabf7e3b810e"},"schema_version":"1.0"},"canonical_sha256":"640f036a2ef09636249bbfeff47545b6df46600a4b0af4601788882995481170","source":{"kind":"arxiv","id":"1907.07088","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07088","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07088v2","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07088","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"MQHQG2RO6CLD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MQHQG2RO6CLDMJE3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MQHQG2RO","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MQHQG2RO6CLDMJE3X7X7I5KFW3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-07-14T21:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"5781c829b69bdf5bd30035294741265afe6b4ebae47c904eb79540b45a6ff089","abstract_canon_sha256":"5028549c8423813084ed4db288830343ac3b076f978b48bcc09fbabf7e3b810e"},"schema_version":"1.0"},"canonical_sha256":"640f036a2ef09636249bbfeff47545b6df46600a4b0af4601788882995481170","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.925567Z","signature_b64":"qS/+pB5UogHx5TZbt+WZbpECgGDDENfskLcMmUdwAQs1MwI4yW5whPWQERAEyUON0N3vK6Qn8wcc7+LKnhh8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"640f036a2ef09636249bbfeff47545b6df46600a4b0af4601788882995481170","last_reissued_at":"2026-05-17T23:40:22.924932Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.924932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07088","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQXr6cx6jkEhN2myJV6ULs2vFTV8RDxqsBjcoo53DduKDdy4I65gDK/VO8o4uAo1kMwkyRvJB8OWzcCZ2DekAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:13:45.295132Z"},"content_sha256":"c3602438b71e541d58d30a13d54b8a3d2dbc4a1f9355fabad9fbf47c25306b48","schema_version":"1.0","event_id":"sha256:c3602438b71e541d58d30a13d54b8a3d2dbc4a1f9355fabad9fbf47c25306b48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MQHQG2RO6CLDMJE3X7X7I5KFW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer patterns in Collatz sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Zenon B. Batang","submitted_at":"2019-07-14T21:37:14Z","abstract_excerpt":"The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an arborescence graph constructed from iterations of $g(x) = (2^{e(x)}x - 1)/3$, which is the inverse of $f(x)$ and where $x \\not \\equiv [0]_3$ and $e(x)$ is any positive integer satisfying $2^{e(x)}x - 1 \\equiv [0]_3$, with $[0]_3$ denoting $0\\pmod{3}$. The integer patterns inferred from the resulting arborescence provide new insights into proving the validity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07088","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2GMqHQt0mR5avPMopwRaOPQ8Kk2A5k0P1xyv2uIahAayUlGb82iqibgHdCdMpi9nQwB94gTiWLECg503H9gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:13:45.295714Z"},"content_sha256":"93674ea0f019b93180a9cf426c8d88527f85b2ae335d02eaa01a66f4929f7f4a","schema_version":"1.0","event_id":"sha256:93674ea0f019b93180a9cf426c8d88527f85b2ae335d02eaa01a66f4929f7f4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/bundle.json","state_url":"https://pith.science/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T05:13:45Z","links":{"resolver":"https://pith.science/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3","bundle":"https://pith.science/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/bundle.json","state":"https://pith.science/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQHQG2RO6CLDMJE3X7X7I5KFW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MQHQG2RO6CLDMJE3X7X7I5KFW3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5028549c8423813084ed4db288830343ac3b076f978b48bcc09fbabf7e3b810e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-07-14T21:37:14Z","title_canon_sha256":"5781c829b69bdf5bd30035294741265afe6b4ebae47c904eb79540b45a6ff089"},"schema_version":"1.0","source":{"id":"1907.07088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07088","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07088v2","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07088","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"MQHQG2RO6CLD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MQHQG2RO6CLDMJE3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MQHQG2RO","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:93674ea0f019b93180a9cf426c8d88527f85b2ae335d02eaa01a66f4929f7f4a","target":"graph","created_at":"2026-05-17T23:40:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an arborescence graph constructed from iterations of $g(x) = (2^{e(x)}x - 1)/3$, which is the inverse of $f(x)$ and where $x \\not \\equiv [0]_3$ and $e(x)$ is any positive integer satisfying $2^{e(x)}x - 1 \\equiv [0]_3$, with $[0]_3$ denoting $0\\pmod{3}$. The integer patterns inferred from the resulting arborescence provide new insights into proving the validity","authors_text":"Zenon B. Batang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-07-14T21:37:14Z","title":"Integer patterns in Collatz sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07088","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3602438b71e541d58d30a13d54b8a3d2dbc4a1f9355fabad9fbf47c25306b48","target":"record","created_at":"2026-05-17T23:40:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5028549c8423813084ed4db288830343ac3b076f978b48bcc09fbabf7e3b810e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2019-07-14T21:37:14Z","title_canon_sha256":"5781c829b69bdf5bd30035294741265afe6b4ebae47c904eb79540b45a6ff089"},"schema_version":"1.0","source":{"id":"1907.07088","kind":"arxiv","version":2}},"canonical_sha256":"640f036a2ef09636249bbfeff47545b6df46600a4b0af4601788882995481170","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"640f036a2ef09636249bbfeff47545b6df46600a4b0af4601788882995481170","first_computed_at":"2026-05-17T23:40:22.924932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.924932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qS/+pB5UogHx5TZbt+WZbpECgGDDENfskLcMmUdwAQs1MwI4yW5whPWQERAEyUON0N3vK6Qn8wcc7+LKnhh8Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.925567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3602438b71e541d58d30a13d54b8a3d2dbc4a1f9355fabad9fbf47c25306b48","sha256:93674ea0f019b93180a9cf426c8d88527f85b2ae335d02eaa01a66f4929f7f4a"],"state_sha256":"3776d2f7c406716b0a56459fe87b4eaa28c4da4f619cb5ec152f9ae9b54fed51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XblQKdZtIzrt+IZn7DoGJxmFFGj+8/nmLHOGfD1pHBW6AtVNa6AAtvtCfhyc4HD6KjyWjsWXzQrQOTcHAI8QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:13:45.299033Z","bundle_sha256":"1b66b27a5f26c0bfef8cf006ba670e6d1475d73a9c72ed4c363a25dcde962da9"}}