{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4TW23STXUA2CMH5J2WDAO5IUKO","short_pith_number":"pith:4TW23STX","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"},"canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","source":{"kind":"arxiv","id":"1511.07842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07842","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07842v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07842","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"4TW23STXUA2C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TW23STXUA2CMH5J","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TW23STX","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4TW23STXUA2CMH5J2WDAO5IUKO","target":"record","payload":{"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"},"canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","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"},"source_kind":"arxiv","source_id":"1511.07842","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:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMGimov+ru6Vm5Oka19aO6yGUgd180AqhUJb+Ay8SHFubgxK55o29WzTici8kK94rWSOBj6XsVS9nIdlF3GFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:46.263880Z"},"content_sha256":"c34c9bf6da475c8ca729dd8b8db5b48eb465003f655da9f104c2959582b03449","schema_version":"1.0","event_id":"sha256:c34c9bf6da475c8ca729dd8b8db5b48eb465003f655da9f104c2959582b03449"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4TW23STXUA2CMH5J2WDAO5IUKO","target":"graph","payload":{"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"},"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:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCvTgcKlHGzOOjvVk+cETOFJQNnIHuTHP+Ur0jNqNCLIfnQwnu4u1IwR67GPZEowjXigOYVwaQ2xJONt1MghCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:46.264235Z"},"content_sha256":"91c3d2b16fb475fee9665421aafd9bb8a693cdf83251e903a349cd42b9c9466f","schema_version":"1.0","event_id":"sha256:91c3d2b16fb475fee9665421aafd9bb8a693cdf83251e903a349cd42b9c9466f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/bundle.json","state_url":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TW23STXUA2CMH5J2WDAO5IUKO/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-06-02T07:19:46Z","links":{"resolver":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO","bundle":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/bundle.json","state":"https://pith.science/pith/4TW23STXUA2CMH5J2WDAO5IUKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TW23STXUA2CMH5J2WDAO5IUKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4TW23STXUA2CMH5J2WDAO5IUKO","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":"bc49b523ee295600402d11f0e8224ac06ec27b02bd7517d085ef8518bd5286f1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-24T19:40:09Z","title_canon_sha256":"f1e951d8291676fbc6539ea1efc929aea99fdbb674a16812f47673e5bf0f8715"},"schema_version":"1.0","source":{"id":"1511.07842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07842","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07842v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07842","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"4TW23STXUA2C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TW23STXUA2CMH5J","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TW23STX","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:91c3d2b16fb475fee9665421aafd9bb8a693cdf83251e903a349cd42b9c9466f","target":"graph","created_at":"2026-05-18T00:53: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":"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","authors_text":"Christopher E. Shriver","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-24T19:40:09Z","title":"An Application of Markov Chain Analysis to Integer Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07842","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:c34c9bf6da475c8ca729dd8b8db5b48eb465003f655da9f104c2959582b03449","target":"record","created_at":"2026-05-18T00:53: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":"bc49b523ee295600402d11f0e8224ac06ec27b02bd7517d085ef8518bd5286f1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-24T19:40:09Z","title_canon_sha256":"f1e951d8291676fbc6539ea1efc929aea99fdbb674a16812f47673e5bf0f8715"},"schema_version":"1.0","source":{"id":"1511.07842","kind":"arxiv","version":2}},"canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4edadca77a034261fa9d58607751453ac0dccdc9f9e8ee55f8b641ef985b589","first_computed_at":"2026-05-18T00:53:02.809875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:02.809875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tjoog2hLkDVdWnqkGyyYWnH97aULSRpEyhdgf5EJr4LsprganR9/rHa1odl+E5rWvGXw8N/+wEsY4tk1/YoDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:02.810436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c34c9bf6da475c8ca729dd8b8db5b48eb465003f655da9f104c2959582b03449","sha256:91c3d2b16fb475fee9665421aafd9bb8a693cdf83251e903a349cd42b9c9466f"],"state_sha256":"03a8da572e6742caaf3f7204b5cbbe53c9a66c6659cfbb05b8989330ef412abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AarH6Pag8keaJrYV3gCCz5rWINQRrPZ/x6/e/NnjWiowE9VzawejV6R9soMzJD3iW6QhydMQwfeaTTs1dBJvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:19:46.266311Z","bundle_sha256":"f02ba3ad76379516a0245429afee3a1db1c73b4be77a616003384c5be98dc526"}}