{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BNZHFNEBE4SC6RDINOMLTNXNUK","short_pith_number":"pith:BNZHFNEB","schema_version":"1.0","canonical_sha256":"0b7272b48127242f44686b98b9b6eda280b4967c0c10b0fc0a8fd96e326b8f54","source":{"kind":"arxiv","id":"1603.06122","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06122","created_at":"2026-05-18T00:40:24.387638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06122v1","created_at":"2026-05-18T00:40:24.387638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06122","created_at":"2026-05-18T00:40:24.387638+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNZHFNEBE4SC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNZHFNEBE4SC6RDI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNZHFNEB","created_at":"2026-05-18T12:30:07.202191+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/BNZHFNEBE4SC6RDINOMLTNXNUK","json":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK.json","graph_json":"https://pith.science/api/pith-number/BNZHFNEBE4SC6RDINOMLTNXNUK/graph.json","events_json":"https://pith.science/api/pith-number/BNZHFNEBE4SC6RDINOMLTNXNUK/events.json","paper":"https://pith.science/paper/BNZHFNEB"},"agent_actions":{"view_html":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK","download_json":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK.json","view_paper":"https://pith.science/paper/BNZHFNEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06122&json=true","fetch_graph":"https://pith.science/api/pith-number/BNZHFNEBE4SC6RDINOMLTNXNUK/graph.json","fetch_events":"https://pith.science/api/pith-number/BNZHFNEBE4SC6RDINOMLTNXNUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/action/storage_attestation","attest_author":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/action/author_attestation","sign_citation":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/action/citation_signature","submit_replication":"https://pith.science/pith/BNZHFNEBE4SC6RDINOMLTNXNUK/action/replication_record"}},"created_at":"2026-05-18T00:40:24.387638+00:00","updated_at":"2026-05-18T00:40:24.387638+00:00"}