{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BNZHFNEBE4SC6RDINOMLTNXNUK","short_pith_number":"pith:BNZHFNEB","canonical_record":{"source":{"id":"1603.06122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-19T18:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"1fb76c728ab00c3489fa2473ddc77893ad7fe9026772e9b71c2b56f75a4e4468","abstract_canon_sha256":"834d8b97e4b3c4154737d9ed99ad869e759f79853b7499b9932e84f39343dae4"},"schema_version":"1.0"},"canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","source":{"kind":"arxiv","id":"1603.06122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06122","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06122v1","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06122","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"BNZHFNEBE4SC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BNZHFNEBE4SC6RDI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BNZHFNEB","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BNZHFNEBE4SC6RDINOMLTNXNUK","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-19T18:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"1fb76c728ab00c3489fa2473ddc77893ad7fe9026772e9b71c2b56f75a4e4468","abstract_canon_sha256":"834d8b97e4b3c4154737d9ed99ad869e759f79853b7499b9932e84f39343dae4"},"schema_version":"1.0"},"canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:24.388096Z","signature_b64":"SeH0jV1lHxcco2sIsBAdlrveJ+o+SDrKYLUWd3AZjtGDV30HwFHJjPmIpCvcd9Zpuvdq2I7SxeTeo4hA4YDgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","last_reissued_at":"2026-05-18T00:40:24.387559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:24.387559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06122","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:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+vxjcOdKVC/FPW+RxPO+J+VL3y+9WzHcT+kUsJfT7a9FlowccJQhoiV9zX0by1xwWXS8FMBO/y1BJYpWbrTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:22:20.907600Z"},"content_sha256":"dbe3cee1014e17597795c3c2f74ab7d817b9ddb940c8d3afde33041041229217","schema_version":"1.0","event_id":"sha256:dbe3cee1014e17597795c3c2f74ab7d817b9ddb940c8d3afde33041041229217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BNZHFNEBE4SC6RDINOMLTNXNUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Complexity: Representing Numbers of Bounded Defect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Harry Altman","submitted_at":"2016-03-19T18:00:33Z","abstract_excerpt":"Define $\\|n\\|$ to be the complexity of $n$, the smallest number of ones 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$. Based on this, this author and Zelinsky defined the \"defect\" of $n$, $\\delta(n):=\\|n\\|-3\\log_3 n$, and this author showed that the set of all defects is a well-ordered subset of the real numbers. This was accomplished by showing that for a fixed real number $r$, there is a finite set $S$ of polynomials called \"low-defect polynomials\" such that for any $n$ with $\\delta(n)<r$, $n$ ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06122","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:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20+xxOmmn353+R4YF1JZkbdfTBK7vwGqjfbLFzfz8qVCByJvZtV7gCENpaXA5Nb4IL0iSHUHfEWka2OaKjsWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:22:20.908237Z"},"content_sha256":"f79e0472588035dffb2491c3bac2116e7acdc1edba57be772ce8a02790c7d27e","schema_version":"1.0","event_id":"sha256:f79e0472588035dffb2491c3bac2116e7acdc1edba57be772ce8a02790c7d27e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/bundle.json","state_url":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/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-30T07:22:20Z","links":{"resolver":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK","bundle":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/bundle.json","state":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BNZHFNEBE4SC6RDINOMLTNXNUK","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":"834d8b97e4b3c4154737d9ed99ad869e759f79853b7499b9932e84f39343dae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-19T18:00:33Z","title_canon_sha256":"1fb76c728ab00c3489fa2473ddc77893ad7fe9026772e9b71c2b56f75a4e4468"},"schema_version":"1.0","source":{"id":"1603.06122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06122","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06122v1","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06122","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"BNZHFNEBE4SC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BNZHFNEBE4SC6RDI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BNZHFNEB","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f79e0472588035dffb2491c3bac2116e7acdc1edba57be772ce8a02790c7d27e","target":"graph","created_at":"2026-05-18T00:40:24Z","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 ones 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$. Based on this, this author and Zelinsky defined the \"defect\" of $n$, $\\delta(n):=\\|n\\|-3\\log_3 n$, and this author showed that the set of all defects is a well-ordered subset of the real numbers. This was accomplished by showing that for a fixed real number $r$, there is a finite set $S$ of polynomials called \"low-defect polynomials\" such that for any $n$ with $\\delta(n)<r$, $n$ ha","authors_text":"Harry Altman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-19T18:00:33Z","title":"Integer Complexity: Representing Numbers of Bounded Defect"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06122","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:dbe3cee1014e17597795c3c2f74ab7d817b9ddb940c8d3afde33041041229217","target":"record","created_at":"2026-05-18T00:40:24Z","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":"834d8b97e4b3c4154737d9ed99ad869e759f79853b7499b9932e84f39343dae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-19T18:00:33Z","title_canon_sha256":"1fb76c728ab00c3489fa2473ddc77893ad7fe9026772e9b71c2b56f75a4e4468"},"schema_version":"1.0","source":{"id":"1603.06122","kind":"arxiv","version":1}},"canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","first_computed_at":"2026-05-18T00:40:24.387559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:24.387559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SeH0jV1lHxcco2sIsBAdlrveJ+o+SDrKYLUWd3AZjtGDV30HwFHJjPmIpCvcd9Zpuvdq2I7SxeTeo4hA4YDgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:24.388096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbe3cee1014e17597795c3c2f74ab7d817b9ddb940c8d3afde33041041229217","sha256:f79e0472588035dffb2491c3bac2116e7acdc1edba57be772ce8a02790c7d27e"],"state_sha256":"c4d98324c6d2c77c42d0d88b0c576cebb77968eff5111c9cf21812760011d373"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huPmt52sNeEfd6VhXg3alzMiFlADj1XbH5FlaVBwVF7bGSH09Fy8S+neI9xv7q2zcPv3OfZ6n4IgcVNl17n9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:22:20.911742Z","bundle_sha256":"f8bd763864ccfba59221a0c0b402161a4c8441f1ffc8dc21f59f85dee6574033"}}