{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4HNAVGP4IOBQITSL57G7SJWAD7","short_pith_number":"pith:4HNAVGP4","canonical_record":{"source":{"id":"1207.4841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-20T02:23:25Z","cross_cats_sorted":[],"title_canon_sha256":"8cde91a57235ee945ad47ad8bf4a100cdeee09f5ce22683a5e557e491daae554","abstract_canon_sha256":"6c7b3f13140ac7c02e9191c9a13864cdaa26c72dbe28d03fe80f2cb16db391da"},"schema_version":"1.0"},"canonical_sha256":"e1da0a99fc4383044e4befcdf926c01ff57858abcfa07b7dd9805ff00b5a02d3","source":{"kind":"arxiv","id":"1207.4841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4841","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4841v1","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4841","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"4HNAVGP4IOBQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4HNAVGP4IOBQITSL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4HNAVGP4","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4HNAVGP4IOBQITSL57G7SJWAD7","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-20T02:23:25Z","cross_cats_sorted":[],"title_canon_sha256":"8cde91a57235ee945ad47ad8bf4a100cdeee09f5ce22683a5e557e491daae554","abstract_canon_sha256":"6c7b3f13140ac7c02e9191c9a13864cdaa26c72dbe28d03fe80f2cb16db391da"},"schema_version":"1.0"},"canonical_sha256":"e1da0a99fc4383044e4befcdf926c01ff57858abcfa07b7dd9805ff00b5a02d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:02.704914Z","signature_b64":"hexvumcdQ5upPWj9Bg7E57XCr6+Mp5smO1GbgXfa2KWrPUg6YB5Rg5Wn7zLNqYP1KYh2CJSYr4IQty+uZfyXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1da0a99fc4383044e4befcdf926c01ff57858abcfa07b7dd9805ff00b5a02d3","last_reissued_at":"2026-05-18T00:15:02.704151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:02.704151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4841","source_version":1,"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-18T00:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZzcXRwFdnD4WlScrZERg8FkW9zfcOh25Ii5cNuB5zw4Uy3QD7a6/aXXeGdm3rE7BQpUuMUHf0ssD6K5bDkWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:04.504251Z"},"content_sha256":"58e325e0610201987a444b02fba0e48af868dfb263375b08310ee256f1a49a56","schema_version":"1.0","event_id":"sha256:58e325e0610201987a444b02fba0e48af868dfb263375b08310ee256f1a49a56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4HNAVGP4IOBQITSL57G7SJWAD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numbers with Integer Complexity Close to the Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Harry Altman, Joshua Zelinsky","submitted_at":"2012-07-20T02:23:25Z","abstract_excerpt":"Define $|n|$ to be the complexity of $n$, the smallest number of 1's needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $|n|\\ge 3\\log_3 n$ for all $n$. Define the defect of $n$, denoted $\\delta(n)$, to be $|n|-3\\log_3 n$; in this paper we present a method for classifying all $n$ with $\\delta(n)<r$ for a given $r$. From this, we derive several consequences. We prove that $|2^m 3^k|=2m+3k$ for $m\\le 21$ with $m$ and $k$ not both zero, and present a method that can, with more computation, potentially prove the same for larger $m$. Further"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4841","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"},"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-18T00:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcDxrMrBwdgbqSHe6Iie4h3A4vzqC5l8ds53+OfQFseLVi8QLRgmRrpawj0LuXIp+fXhRoD1x1dY/FJ7KiNNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:04.504901Z"},"content_sha256":"31fa30ff418d66a3f343b48da13b75e55b2858a2116a1120b7bc5b2a676d373c","schema_version":"1.0","event_id":"sha256:31fa30ff418d66a3f343b48da13b75e55b2858a2116a1120b7bc5b2a676d373c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HNAVGP4IOBQITSL57G7SJWAD7/bundle.json","state_url":"https://pith.science/pith/4HNAVGP4IOBQITSL57G7SJWAD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HNAVGP4IOBQITSL57G7SJWAD7/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-05-30T12:05:04Z","links":{"resolver":"https://pith.science/pith/4HNAVGP4IOBQITSL57G7SJWAD7","bundle":"https://pith.science/pith/4HNAVGP4IOBQITSL57G7SJWAD7/bundle.json","state":"https://pith.science/pith/4HNAVGP4IOBQITSL57G7SJWAD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HNAVGP4IOBQITSL57G7SJWAD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4HNAVGP4IOBQITSL57G7SJWAD7","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":"6c7b3f13140ac7c02e9191c9a13864cdaa26c72dbe28d03fe80f2cb16db391da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-20T02:23:25Z","title_canon_sha256":"8cde91a57235ee945ad47ad8bf4a100cdeee09f5ce22683a5e557e491daae554"},"schema_version":"1.0","source":{"id":"1207.4841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4841","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4841v1","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4841","created_at":"2026-05-18T00:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"4HNAVGP4IOBQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4HNAVGP4IOBQITSL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4HNAVGP4","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:31fa30ff418d66a3f343b48da13b75e55b2858a2116a1120b7bc5b2a676d373c","target":"graph","created_at":"2026-05-18T00:15:02Z","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":"Define $|n|$ to be the complexity of $n$, the smallest number of 1's needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $|n|\\ge 3\\log_3 n$ for all $n$. Define the defect of $n$, denoted $\\delta(n)$, to be $|n|-3\\log_3 n$; in this paper we present a method for classifying all $n$ with $\\delta(n)<r$ for a given $r$. From this, we derive several consequences. We prove that $|2^m 3^k|=2m+3k$ for $m\\le 21$ with $m$ and $k$ not both zero, and present a method that can, with more computation, potentially prove the same for larger $m$. Further","authors_text":"Harry Altman, Joshua Zelinsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-20T02:23:25Z","title":"Numbers with Integer Complexity Close to the Lower Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4841","kind":"arxiv","version":1},"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:58e325e0610201987a444b02fba0e48af868dfb263375b08310ee256f1a49a56","target":"record","created_at":"2026-05-18T00:15:02Z","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":"6c7b3f13140ac7c02e9191c9a13864cdaa26c72dbe28d03fe80f2cb16db391da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-20T02:23:25Z","title_canon_sha256":"8cde91a57235ee945ad47ad8bf4a100cdeee09f5ce22683a5e557e491daae554"},"schema_version":"1.0","source":{"id":"1207.4841","kind":"arxiv","version":1}},"canonical_sha256":"e1da0a99fc4383044e4befcdf926c01ff57858abcfa07b7dd9805ff00b5a02d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1da0a99fc4383044e4befcdf926c01ff57858abcfa07b7dd9805ff00b5a02d3","first_computed_at":"2026-05-18T00:15:02.704151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:02.704151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hexvumcdQ5upPWj9Bg7E57XCr6+Mp5smO1GbgXfa2KWrPUg6YB5Rg5Wn7zLNqYP1KYh2CJSYr4IQty+uZfyXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:02.704914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58e325e0610201987a444b02fba0e48af868dfb263375b08310ee256f1a49a56","sha256:31fa30ff418d66a3f343b48da13b75e55b2858a2116a1120b7bc5b2a676d373c"],"state_sha256":"102c3c43703ee9d0f940ac0a1e6757d33f3ce4143404595f11ceecb84758d078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wkk0pbm9ClsccLUwz0IU5r6pVdYHAQ3pI3lKbE9LVHkIno/3yhrxo5t+49nofWBOiBssg8Gg1ZcoRkmHnbf7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:04.507807Z","bundle_sha256":"ec69cce3f794a0963cd142f41fb664d7c65d1374d702675344935b93cae95b17"}}