{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TACX576IK6EDTATDVIXE6C4G3E","short_pith_number":"pith:TACX576I","schema_version":"1.0","canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","source":{"kind":"arxiv","id":"1404.2183","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for determining integer complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J. Arias de Reyna, J. van de Lune","submitted_at":"2014-04-08T15:35:21Z","abstract_excerpt":"We present three algorithms to compute the complexity $\\Vert n\\Vert$ of all natural numbers $ n\\le N$. The first of them is a brute force algorithm, computing all these complexities in time $O(N^2)$ and space $O(N\\log^2 N)$. The main problem of this algorithm is the time needed for the computation. In 2008 there appeared three independent solutions to this problem: V. V. Srinivas and B. R. Shankar [11], M. N. Fuller [7], and J. Arias de Reyna and J. van de Lune [3]. All three are very similar. Only [11] gives an estimation of the performance of its algorithm, proving that the algorithm compute"},"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":"1404.2183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-08T15:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"368e1f530432496977fd4c8ec62223b51055c8d8829795e0f13cb179878e7510","abstract_canon_sha256":"1b3a89d97bf6ae54e553407032ca5cbf85e003d6d964ed8fc97e0c4b66829cb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:52.919278Z","signature_b64":"XoTTR7zIqdv9A4qlz/3hQDTU7pbHxWWxxqkPuvJ1LYSE6LZLYRoTW4fLEvyQsM5K6p3jJYjvSLp4P/jhN+//Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","last_reissued_at":"2026-05-18T02:53:52.918408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:52.918408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for determining integer complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J. Arias de Reyna, J. van de Lune","submitted_at":"2014-04-08T15:35:21Z","abstract_excerpt":"We present three algorithms to compute the complexity $\\Vert n\\Vert$ of all natural numbers $ n\\le N$. The first of them is a brute force algorithm, computing all these complexities in time $O(N^2)$ and space $O(N\\log^2 N)$. The main problem of this algorithm is the time needed for the computation. In 2008 there appeared three independent solutions to this problem: V. V. Srinivas and B. R. Shankar [11], M. N. Fuller [7], and J. Arias de Reyna and J. van de Lune [3]. All three are very similar. Only [11] gives an estimation of the performance of its algorithm, proving that the algorithm compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2183","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":"1404.2183","created_at":"2026-05-18T02:53:52.918548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2183v2","created_at":"2026-05-18T02:53:52.918548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2183","created_at":"2026-05-18T02:53:52.918548+00:00"},{"alias_kind":"pith_short_12","alias_value":"TACX576IK6ED","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TACX576IK6EDTATD","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TACX576I","created_at":"2026-05-18T12:28:49.207871+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":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E","json":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E.json","graph_json":"https://pith.science/api/pith-number/TACX576IK6EDTATDVIXE6C4G3E/graph.json","events_json":"https://pith.science/api/pith-number/TACX576IK6EDTATDVIXE6C4G3E/events.json","paper":"https://pith.science/paper/TACX576I"},"agent_actions":{"view_html":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E","download_json":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E.json","view_paper":"https://pith.science/paper/TACX576I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2183&json=true","fetch_graph":"https://pith.science/api/pith-number/TACX576IK6EDTATDVIXE6C4G3E/graph.json","fetch_events":"https://pith.science/api/pith-number/TACX576IK6EDTATDVIXE6C4G3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/action/storage_attestation","attest_author":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/action/author_attestation","sign_citation":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/action/citation_signature","submit_replication":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/action/replication_record"}},"created_at":"2026-05-18T02:53:52.918548+00:00","updated_at":"2026-05-18T02:53:52.918548+00:00"}