{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:NRCGEVHLGUSZYRSSBA4JIDQAFG","short_pith_number":"pith:NRCGEVHL","schema_version":"1.0","canonical_sha256":"6c446254eb35259c46520838940e0029af2acf901345956ce0cd8df40d5a5930","source":{"kind":"arxiv","id":"math/0205002","version":1},"attestation_state":"computed","paper":{"title":"Bounds for the 3x+1 Problem using Difference Inequalities","license":"","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Ilia Krasikov, Jeffrey C. Lagarias","submitted_at":"2002-04-30T21:57:00Z","abstract_excerpt":"We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1 in their forward orbit under the 3x+1 map. Previous methods gave away some information in these inequalities. We give an improvement which apparantly extracts full information from the inequalities. By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map."},"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":"math/0205002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2002-04-30T21:57:00Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"c1c336037cab4fe32a8d29e57358112412429d6c57f082e446960e6bb7f7e513","abstract_canon_sha256":"6806b9709ef53326b0d8bf3b678cce75a6acf30ff4cf2048d7c8122322763b3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:29.597923Z","signature_b64":"UODOxVSw/RDgEuHLFoZpKMTHYJ5TABw8OmofUWXxAShk4zYWX0CDDLgUORtuXwluCy91VzeiTv0OXjfrkNC6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c446254eb35259c46520838940e0029af2acf901345956ce0cd8df40d5a5930","last_reissued_at":"2026-05-18T01:38:29.597400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:29.597400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for the 3x+1 Problem using Difference Inequalities","license":"","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Ilia Krasikov, Jeffrey C. Lagarias","submitted_at":"2002-04-30T21:57:00Z","abstract_excerpt":"We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1 in their forward orbit under the 3x+1 map. Previous methods gave away some information in these inequalities. We give an improvement which apparantly extracts full information from the inequalities. By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0205002","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0205002","created_at":"2026-05-18T01:38:29.597482+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0205002v1","created_at":"2026-05-18T01:38:29.597482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0205002","created_at":"2026-05-18T01:38:29.597482+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRCGEVHLGUSZ","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRCGEVHLGUSZYRSS","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRCGEVHL","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG","json":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG.json","graph_json":"https://pith.science/api/pith-number/NRCGEVHLGUSZYRSSBA4JIDQAFG/graph.json","events_json":"https://pith.science/api/pith-number/NRCGEVHLGUSZYRSSBA4JIDQAFG/events.json","paper":"https://pith.science/paper/NRCGEVHL"},"agent_actions":{"view_html":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG","download_json":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG.json","view_paper":"https://pith.science/paper/NRCGEVHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0205002&json=true","fetch_graph":"https://pith.science/api/pith-number/NRCGEVHLGUSZYRSSBA4JIDQAFG/graph.json","fetch_events":"https://pith.science/api/pith-number/NRCGEVHLGUSZYRSSBA4JIDQAFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG/action/storage_attestation","attest_author":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG/action/author_attestation","sign_citation":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG/action/citation_signature","submit_replication":"https://pith.science/pith/NRCGEVHLGUSZYRSSBA4JIDQAFG/action/replication_record"}},"created_at":"2026-05-18T01:38:29.597482+00:00","updated_at":"2026-05-18T01:38:29.597482+00:00"}