{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S43FE5AMMWQVU2MAE3IOCZKQ3A","short_pith_number":"pith:S43FE5AM","canonical_record":{"source":{"id":"1310.2894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-10T17:33:14Z","cross_cats_sorted":[],"title_canon_sha256":"f8c5a3844834740676242eed37530ff5b187aaf8f251ac38f694fb852637d742","abstract_canon_sha256":"374750579c77aa3cc2aae7ce524315c937c24709740d51a9892fd9ba607f6923"},"schema_version":"1.0"},"canonical_sha256":"973652740c65a15a698026d0e16550d8397c69ea3fe1c6a9ef3c94d3ca2a2772","source":{"kind":"arxiv","id":"1310.2894","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2894","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2894v2","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2894","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"S43FE5AMMWQV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S43FE5AMMWQVU2MA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S43FE5AM","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S43FE5AMMWQVU2MAE3IOCZKQ3A","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-10T17:33:14Z","cross_cats_sorted":[],"title_canon_sha256":"f8c5a3844834740676242eed37530ff5b187aaf8f251ac38f694fb852637d742","abstract_canon_sha256":"374750579c77aa3cc2aae7ce524315c937c24709740d51a9892fd9ba607f6923"},"schema_version":"1.0"},"canonical_sha256":"973652740c65a15a698026d0e16550d8397c69ea3fe1c6a9ef3c94d3ca2a2772","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:24.688527Z","signature_b64":"ZghpzwyMGWuH2GMKP8P2oOi9SJchyX3A+lwB8DdgdSWeLPyMSelQqocPUmi/iPQxaPlRDCxNCbtvJ+qysSLSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973652740c65a15a698026d0e16550d8397c69ea3fe1c6a9ef3c94d3ca2a2772","last_reissued_at":"2026-05-18T00:40:24.687963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:24.687963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2894","source_version":2,"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":"LV/6nw3aBSA96rct/7JNQvXpEu069GWt1fUK92BHQ9oDNKaxZ6JCJKJ+pGgI9GRhwyixsvvudKDQsvuqq9O6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:01.680990Z"},"content_sha256":"a856af91590b3b169ae71ac1c6723c55657da54a7a163c7fd7686d609b1124f6","schema_version":"1.0","event_id":"sha256:a856af91590b3b169ae71ac1c6723c55657da54a7a163c7fd7686d609b1124f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S43FE5AMMWQVU2MAE3IOCZKQ3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Complexity and Well-Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Harry Altman","submitted_at":"2013-10-10T17:33:14Z","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$. Define the defect of $n$, denoted $\\delta(n)$, to be $\\|n\\| - 3\\log_3 n$. In this paper, we consider the set $\\mathscr{D} := \\{\\delta(n): n \\ge 1 \\}$ of all defects. We show that as a subset of the real numbers, the set $\\mathscr{D}$ is well-ordered, of order type $\\omega^\\omega$. More specifically, for $k\\ge 1$ an integer, $\\mathscr{D}\\cap[0,k)$ has order type $\\omega^k$. We also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2894","kind":"arxiv","version":2},"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":"YaNRVU7RWRq6BdZ9jGzjmoCk0K13tj0p7VvehK6iR+VrLNpVidhiRdBsip0sriM5+gea0Z62rhHNYclcLyxoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:01.681362Z"},"content_sha256":"56c4867c7e46f49d231523f3751cce98e3ecdd0de2b0db0742af8ca31c7eea2f","schema_version":"1.0","event_id":"sha256:56c4867c7e46f49d231523f3751cce98e3ecdd0de2b0db0742af8ca31c7eea2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/bundle.json","state_url":"https://pith.science/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/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-30T08:56:01Z","links":{"resolver":"https://pith.science/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A","bundle":"https://pith.science/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/bundle.json","state":"https://pith.science/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S43FE5AMMWQVU2MAE3IOCZKQ3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S43FE5AMMWQVU2MAE3IOCZKQ3A","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":"374750579c77aa3cc2aae7ce524315c937c24709740d51a9892fd9ba607f6923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-10T17:33:14Z","title_canon_sha256":"f8c5a3844834740676242eed37530ff5b187aaf8f251ac38f694fb852637d742"},"schema_version":"1.0","source":{"id":"1310.2894","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2894","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2894v2","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2894","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"S43FE5AMMWQV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S43FE5AMMWQVU2MA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S43FE5AM","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:56c4867c7e46f49d231523f3751cce98e3ecdd0de2b0db0742af8ca31c7eea2f","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$. Define the defect of $n$, denoted $\\delta(n)$, to be $\\|n\\| - 3\\log_3 n$. In this paper, we consider the set $\\mathscr{D} := \\{\\delta(n): n \\ge 1 \\}$ of all defects. We show that as a subset of the real numbers, the set $\\mathscr{D}$ is well-ordered, of order type $\\omega^\\omega$. More specifically, for $k\\ge 1$ an integer, $\\mathscr{D}\\cap[0,k)$ has order type $\\omega^k$. We also","authors_text":"Harry Altman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-10T17:33:14Z","title":"Integer Complexity and Well-Ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2894","kind":"arxiv","version":2},"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:a856af91590b3b169ae71ac1c6723c55657da54a7a163c7fd7686d609b1124f6","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":"374750579c77aa3cc2aae7ce524315c937c24709740d51a9892fd9ba607f6923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-10T17:33:14Z","title_canon_sha256":"f8c5a3844834740676242eed37530ff5b187aaf8f251ac38f694fb852637d742"},"schema_version":"1.0","source":{"id":"1310.2894","kind":"arxiv","version":2}},"canonical_sha256":"973652740c65a15a698026d0e16550d8397c69ea3fe1c6a9ef3c94d3ca2a2772","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973652740c65a15a698026d0e16550d8397c69ea3fe1c6a9ef3c94d3ca2a2772","first_computed_at":"2026-05-18T00:40:24.687963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:24.687963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZghpzwyMGWuH2GMKP8P2oOi9SJchyX3A+lwB8DdgdSWeLPyMSelQqocPUmi/iPQxaPlRDCxNCbtvJ+qysSLSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:24.688527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2894","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a856af91590b3b169ae71ac1c6723c55657da54a7a163c7fd7686d609b1124f6","sha256:56c4867c7e46f49d231523f3751cce98e3ecdd0de2b0db0742af8ca31c7eea2f"],"state_sha256":"378e97a61581361b646aac113350633d3f4791febbe693fc1ea6c8b2c2ca3e7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wK5BuA727DoHaLlU659vt84jA3H7ve3dZkei3gQZ0asifcPgfZeV1bkhie1/sh4h0addHoD60yxNiUXgk//Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:56:01.683518Z","bundle_sha256":"8770abfc37a90fa91171d3c81bf1ea66006a8a2253424ec7054834421485c626"}}