{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2GB5OJ6OYZ67U7GKEZYSGDLT7U","short_pith_number":"pith:2GB5OJ6O","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"},"canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","source":{"kind":"arxiv","id":"1001.4133","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4133","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4133v4","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4133","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"2GB5OJ6OYZ67","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2GB5OJ6OYZ67U7GK","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2GB5OJ6O","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2GB5OJ6OYZ67U7GKEZYSGDLT7U","target":"record","payload":{"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"},"canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","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"},"source_kind":"arxiv","source_id":"1001.4133","source_version":4,"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-18T04:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZ04V53avtXGGAYOC+qzdK8L/2VMWm673fAEINgM7QLkzFNSwjjD5KoKOOdLL2rV+PYsJ/GCVO4LvuKRe68rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:30:37.098604Z"},"content_sha256":"86354f61696e25eaa1acd686a0ea9aa8eeebc9f31f38501c4898ef0a9632b2ca","schema_version":"1.0","event_id":"sha256:86354f61696e25eaa1acd686a0ea9aa8eeebc9f31f38501c4898ef0a9632b2ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2GB5OJ6OYZ67U7GKEZYSGDLT7U","target":"graph","payload":{"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"},"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-18T04:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Twif59ew+z9I28wP7hH2JfLR4L5rpTciyIm3aPYfA8aXPnyj2gerXS644y599WbL3dXT+q8aFePGsrlDL3y+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:30:37.098954Z"},"content_sha256":"3811f801057b11a187dbe7565c9983e56415fa9926aca5cc3434cc7d30be07e2","schema_version":"1.0","event_id":"sha256:3811f801057b11a187dbe7565c9983e56415fa9926aca5cc3434cc7d30be07e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/bundle.json","state_url":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/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-22T16:30:37Z","links":{"resolver":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U","bundle":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/bundle.json","state":"https://pith.science/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GB5OJ6OYZ67U7GKEZYSGDLT7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2GB5OJ6OYZ67U7GKEZYSGDLT7U","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":"ef858f2f29e9481a7d2180867ec1265e58e55447a0381d9ad90cd13ef1ccc930","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-01-23T07:00:54Z","title_canon_sha256":"cadf9550b9400bfd1db9caaac72fdec75553cd4a4b55428fafcedb4ae59956c9"},"schema_version":"1.0","source":{"id":"1001.4133","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4133","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4133v4","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4133","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"2GB5OJ6OYZ67","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2GB5OJ6OYZ67U7GK","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2GB5OJ6O","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:3811f801057b11a187dbe7565c9983e56415fa9926aca5cc3434cc7d30be07e2","target":"graph","created_at":"2026-05-18T04:14:38Z","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":"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","authors_text":"Everett W. Howe, Vassil S. Dimitrov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-01-23T07:00:54Z","title":"Lower bounds on the lengths of double-base representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4133","kind":"arxiv","version":4},"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:86354f61696e25eaa1acd686a0ea9aa8eeebc9f31f38501c4898ef0a9632b2ca","target":"record","created_at":"2026-05-18T04:14:38Z","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":"ef858f2f29e9481a7d2180867ec1265e58e55447a0381d9ad90cd13ef1ccc930","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-01-23T07:00:54Z","title_canon_sha256":"cadf9550b9400bfd1db9caaac72fdec75553cd4a4b55428fafcedb4ae59956c9"},"schema_version":"1.0","source":{"id":"1001.4133","kind":"arxiv","version":4}},"canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d183d727cec67dfa7cca2671230d73fd0769599acd5bf94609d6baa12a851838","first_computed_at":"2026-05-18T04:14:38.268739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:38.268739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ph7PfVtgMAMVemvEa3yH4mgD9Gnf/w12FvQiB0GgqUS+GZtuAjqTbIMluZ3bLeNAzNqOyqyz5rFaUPUP+8M3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:38.269206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.4133","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86354f61696e25eaa1acd686a0ea9aa8eeebc9f31f38501c4898ef0a9632b2ca","sha256:3811f801057b11a187dbe7565c9983e56415fa9926aca5cc3434cc7d30be07e2"],"state_sha256":"0335e3f6bcd8702fd0febbfc771732c46ef2b1f211cb7b99581acd8cd08e68cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/5khLpJ6fOAouDP7O1RuuY6jwte51wjA/Bl5ev8f4S+4RGQlbCvT/SLATxkq3xLQaM7SM1jC9CSx+0u0BOICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:30:37.100918Z","bundle_sha256":"28414598cb3f3196682b3ec71192108d6c19ea67c7b5982d9f6f6724ca701d7e"}}