{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4TW23STXUA2CMH5J2WDAO5IUKO","short_pith_number":"pith:4TW23STX","schema_version":"1.0","canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","source":{"kind":"arxiv","id":"1511.07842","version":2},"attestation_state":"computed","paper":{"title":"An Application of Markov Chain Analysis to Integer Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Christopher E. Shriver","submitted_at":"2015-11-24T19:40:09Z","abstract_excerpt":"The complexity $f(n)$ of an integer was introduced in 1953 by Mahler & Popken: it is defined as the smallest number of $1$'s needed in conjunction with arbitrarily many +, * and parentheses to write an integer $n$ (for example, $f(6) \\leq 5$ since $6 = (1+1)(1+1+1)$). The best known bounds are $$ 3 \\log_{3}{n} \\leq f(n) \\leq 3.635 \\log_{3}{n}.$$ The lower bound is due to Selfridge (with equality for powers of 3); the upper bound was recently proven by Arias de Reyna & Van de Lune, and holds on a set of natural density one.\n  We use Markov chain methods to analyze a large class of algorithms, i"},"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":"1511.07842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-24T19:40:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f1e951d8291676fbc6539ea1efc929aea99fdbb674a16812f47673e5bf0f8715","abstract_canon_sha256":"bc49b523ee295600402d11f0e8224ac06ec27b02bd7517d085ef8518bd5286f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:02.810436Z","signature_b64":"Tjoog2hLkDVdWnqkGyyYWnH97aULSRpEyhdgf5EJr4LsprganR9/rHa1odl+E5rWvGXw8N/+wEsY4tk1/YoDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","last_reissued_at":"2026-05-18T00:53:02.809875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:02.809875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Application of Markov Chain Analysis to Integer Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Christopher E. Shriver","submitted_at":"2015-11-24T19:40:09Z","abstract_excerpt":"The complexity $f(n)$ of an integer was introduced in 1953 by Mahler & Popken: it is defined as the smallest number of $1$'s needed in conjunction with arbitrarily many +, * and parentheses to write an integer $n$ (for example, $f(6) \\leq 5$ since $6 = (1+1)(1+1+1)$). The best known bounds are $$ 3 \\log_{3}{n} \\leq f(n) \\leq 3.635 \\log_{3}{n}.$$ The lower bound is due to Selfridge (with equality for powers of 3); the upper bound was recently proven by Arias de Reyna & Van de Lune, and holds on a set of natural density one.\n  We use Markov chain methods to analyze a large class of algorithms, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07842","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07842","created_at":"2026-05-18T00:53:02.809943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07842v2","created_at":"2026-05-18T00:53:02.809943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07842","created_at":"2026-05-18T00:53:02.809943+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TW23STXUA2C","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TW23STXUA2CMH5J","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TW23STX","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.20876","citing_title":"Upper and lower estimates for integer complexity","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO","json":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO.json","graph_json":"https://pith.science/api/pith-number/4TW23STXUA2CMH5J2WDAO5IUKO/graph.json","events_json":"https://pith.science/api/pith-number/4TW23STXUA2CMH5J2WDAO5IUKO/events.json","paper":"https://pith.science/paper/4TW23STX"},"agent_actions":{"view_html":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO","download_json":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO.json","view_paper":"https://pith.science/paper/4TW23STX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07842&json=true","fetch_graph":"https://pith.science/api/pith-number/4TW23STXUA2CMH5J2WDAO5IUKO/graph.json","fetch_events":"https://pith.science/api/pith-number/4TW23STXUA2CMH5J2WDAO5IUKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/action/storage_attestation","attest_author":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/action/author_attestation","sign_citation":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/action/citation_signature","submit_replication":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/action/replication_record"}},"created_at":"2026-05-18T00:53:02.809943+00:00","updated_at":"2026-05-18T00:53:02.809943+00:00"}