{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2GB5OJ6OYZ67U7GKEZYSGDLT7U","short_pith_number":"pith:2GB5OJ6O","schema_version":"1.0","canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","source":{"kind":"arxiv","id":"1001.4133","version":4},"attestation_state":"computed","paper":{"title":"Lower bounds on the lengths of double-base representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Everett W. Howe, Vassil S. Dimitrov","submitted_at":"2010-01-23T07:00:54Z","abstract_excerpt":"A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of terms. It is known that there is a constant a > 0 such that every integer n has a double-base representation of length at most a log n / log log n. We show that there is a constant c > 0 such that there are infinitely many integers n whose shortest double-base representations have length greater than c log n / (log log n log log log n).\n  Our methods allow us to"},"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":"1001.4133","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-01-23T07:00:54Z","cross_cats_sorted":[],"title_canon_sha256":"cadf9550b9400bfd1db9caaac72fdec75553cd4a4b55428fafcedb4ae59956c9","abstract_canon_sha256":"ef858f2f29e9481a7d2180867ec1265e58e55447a0381d9ad90cd13ef1ccc930"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:38.269206Z","signature_b64":"ph7PfVtgMAMVemvEa3yH4mgD9Gnf/w12FvQiB0GgqUS+GZtuAjqTbIMluZ3bLeNAzNqOyqyz5rFaUPUP+8M3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","last_reissued_at":"2026-05-18T04:14:38.268739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:38.268739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the lengths of double-base representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Everett W. Howe, Vassil S. Dimitrov","submitted_at":"2010-01-23T07:00:54Z","abstract_excerpt":"A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of terms. It is known that there is a constant a > 0 such that every integer n has a double-base representation of length at most a log n / log log n. We show that there is a constant c > 0 such that there are infinitely many integers n whose shortest double-base representations have length greater than c log n / (log log n log log log n).\n  Our methods allow us to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4133","kind":"arxiv","version":4},"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":"1001.4133","created_at":"2026-05-18T04:14:38.268808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4133v4","created_at":"2026-05-18T04:14:38.268808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4133","created_at":"2026-05-18T04:14:38.268808+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GB5OJ6OYZ67","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GB5OJ6OYZ67U7GK","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GB5OJ6O","created_at":"2026-05-18T12:26:03.138858+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/2GB5OJ6OYZ67U7GKEZYSGDLT7U","json":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U.json","graph_json":"https://pith.science/api/pith-number/2GB5OJ6OYZ67U7GKEZYSGDLT7U/graph.json","events_json":"https://pith.science/api/pith-number/2GB5OJ6OYZ67U7GKEZYSGDLT7U/events.json","paper":"https://pith.science/paper/2GB5OJ6O"},"agent_actions":{"view_html":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U","download_json":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U.json","view_paper":"https://pith.science/paper/2GB5OJ6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4133&json=true","fetch_graph":"https://pith.science/api/pith-number/2GB5OJ6OYZ67U7GKEZYSGDLT7U/graph.json","fetch_events":"https://pith.science/api/pith-number/2GB5OJ6OYZ67U7GKEZYSGDLT7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/action/storage_attestation","attest_author":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/action/author_attestation","sign_citation":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/action/citation_signature","submit_replication":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/action/replication_record"}},"created_at":"2026-05-18T04:14:38.268808+00:00","updated_at":"2026-05-18T04:14:38.268808+00:00"}