{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AUJXT5DCJ2DQYX5CUNKMGF5NOY","short_pith_number":"pith:AUJXT5DC","schema_version":"1.0","canonical_sha256":"051379f4624e870c5fa2a354c317ad76068521157195321140802ee78faef889","source":{"kind":"arxiv","id":"1706.08424","version":4},"attestation_state":"computed","paper":{"title":"On algorithms to calculate integer complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aaditya Sharma, Alyssa Epstein, Anand Hemmady, Eyvindur A. Palsson, Katherine Cordwell, Stefan Steinerberger, Steven J. Miller, Yen Nhi Truong Vu","submitted_at":"2017-06-26T15:02:26Z","abstract_excerpt":"We consider a problem first proposed by Mahler and Popken in 1953 and later developed by Coppersmith, Erd\\H{o}s, Guy, Isbell, Selfridge, and others. Let $f(n)$ be the complexity of $n \\in \\mathbb{Z^{+}}$, where $f(n)$ is defined as the least number of $1$'s needed to represent $n$ in conjunction with an arbitrary number of $+$'s, $*$'s, and parentheses. Several algorithms have been developed to calculate the complexity of all integers up to $n$. Currently, the fastest known algorithm runs in time $\\mathcal{O}(n^{1.230175})$ and was given by J. Arias de Reyna and J. van de Lune in 2014. This al"},"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":"1706.08424","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-26T15:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"5fb8b2938303f9c626cabb04cbbcce506e4c0e45675006911b984081cf9493e1","abstract_canon_sha256":"fb4648e11c6e0a7af45b3633468e3a0cfb919d9c8d1b24b9662dd85d48c60a1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:05.486859Z","signature_b64":"OfBVVSLb1iMQpsbaJuyVXQfumzsP42eDwTWK98/K65aMC8y4FShFtEB7dp37OIpI7y9DyQBMG61oKEiu+UTiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"051379f4624e870c5fa2a354c317ad76068521157195321140802ee78faef889","last_reissued_at":"2026-05-17T23:58:05.486430Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:05.486430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On algorithms to calculate integer complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aaditya Sharma, Alyssa Epstein, Anand Hemmady, Eyvindur A. Palsson, Katherine Cordwell, Stefan Steinerberger, Steven J. Miller, Yen Nhi Truong Vu","submitted_at":"2017-06-26T15:02:26Z","abstract_excerpt":"We consider a problem first proposed by Mahler and Popken in 1953 and later developed by Coppersmith, Erd\\H{o}s, Guy, Isbell, Selfridge, and others. Let $f(n)$ be the complexity of $n \\in \\mathbb{Z^{+}}$, where $f(n)$ is defined as the least number of $1$'s needed to represent $n$ in conjunction with an arbitrary number of $+$'s, $*$'s, and parentheses. Several algorithms have been developed to calculate the complexity of all integers up to $n$. Currently, the fastest known algorithm runs in time $\\mathcal{O}(n^{1.230175})$ and was given by J. Arias de Reyna and J. van de Lune in 2014. This al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08424","kind":"arxiv","version":4},"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":"1706.08424","created_at":"2026-05-17T23:58:05.486496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08424v4","created_at":"2026-05-17T23:58:05.486496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08424","created_at":"2026-05-17T23:58:05.486496+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUJXT5DCJ2DQ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUJXT5DCJ2DQYX5C","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUJXT5DC","created_at":"2026-05-18T12:31:08.081275+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/AUJXT5DCJ2DQYX5CUNKMGF5NOY","json":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY.json","graph_json":"https://pith.science/api/pith-number/AUJXT5DCJ2DQYX5CUNKMGF5NOY/graph.json","events_json":"https://pith.science/api/pith-number/AUJXT5DCJ2DQYX5CUNKMGF5NOY/events.json","paper":"https://pith.science/paper/AUJXT5DC"},"agent_actions":{"view_html":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY","download_json":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY.json","view_paper":"https://pith.science/paper/AUJXT5DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08424&json=true","fetch_graph":"https://pith.science/api/pith-number/AUJXT5DCJ2DQYX5CUNKMGF5NOY/graph.json","fetch_events":"https://pith.science/api/pith-number/AUJXT5DCJ2DQYX5CUNKMGF5NOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY/action/storage_attestation","attest_author":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY/action/author_attestation","sign_citation":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY/action/citation_signature","submit_replication":"https://pith.science/pith/AUJXT5DCJ2DQYX5CUNKMGF5NOY/action/replication_record"}},"created_at":"2026-05-17T23:58:05.486496+00:00","updated_at":"2026-05-17T23:58:05.486496+00:00"}