{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TACX576IK6EDTATDVIXE6C4G3E","short_pith_number":"pith:TACX576I","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"},"canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","source":{"kind":"arxiv","id":"1404.2183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2183","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2183v2","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2183","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"TACX576IK6ED","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TACX576IK6EDTATD","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TACX576I","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TACX576IK6EDTATDVIXE6C4G3E","target":"record","payload":{"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"},"canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","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"},"source_kind":"arxiv","source_id":"1404.2183","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-18T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGjZozvLk8qjKcxV3rCEnwfYCjiGRAH9ErUvuYJAFDkzUAseCcLwS4EHvrOYzAQrvfpfPTXQEPHGp2f9kJw4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:10:58.987405Z"},"content_sha256":"3b17df1a1aaf1ba63a1950393bb5ab17d660ea6cd4b77fd64e76712668759afa","schema_version":"1.0","event_id":"sha256:3b17df1a1aaf1ba63a1950393bb5ab17d660ea6cd4b77fd64e76712668759afa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TACX576IK6EDTATDVIXE6C4G3E","target":"graph","payload":{"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"},"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-18T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2RnOeAaIEz6X2zPGuCjux9snW3czNHeLf0NySVkNLxEbH3ITSF/TAO1HtCXbOGq0VdAR7cGaUgacr1DwqqdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:10:58.987759Z"},"content_sha256":"396c698c9f53b4807fd867e15611d8b887a94d363dd0059adc5623d947bde7e9","schema_version":"1.0","event_id":"sha256:396c698c9f53b4807fd867e15611d8b887a94d363dd0059adc5623d947bde7e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/bundle.json","state_url":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TACX576IK6EDTATDVIXE6C4G3E/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-02T03:10:58Z","links":{"resolver":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E","bundle":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/bundle.json","state":"https://pith.science/pith/TACX576IK6EDTATDVIXE6C4G3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TACX576IK6EDTATDVIXE6C4G3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TACX576IK6EDTATDVIXE6C4G3E","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":"1b3a89d97bf6ae54e553407032ca5cbf85e003d6d964ed8fc97e0c4b66829cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-08T15:35:21Z","title_canon_sha256":"368e1f530432496977fd4c8ec62223b51055c8d8829795e0f13cb179878e7510"},"schema_version":"1.0","source":{"id":"1404.2183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2183","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2183v2","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2183","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"TACX576IK6ED","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TACX576IK6EDTATD","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TACX576I","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:396c698c9f53b4807fd867e15611d8b887a94d363dd0059adc5623d947bde7e9","target":"graph","created_at":"2026-05-18T02:53:52Z","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":"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","authors_text":"J. Arias de Reyna, J. van de Lune","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-08T15:35:21Z","title":"Algorithms for determining integer complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2183","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:3b17df1a1aaf1ba63a1950393bb5ab17d660ea6cd4b77fd64e76712668759afa","target":"record","created_at":"2026-05-18T02:53:52Z","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":"1b3a89d97bf6ae54e553407032ca5cbf85e003d6d964ed8fc97e0c4b66829cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-08T15:35:21Z","title_canon_sha256":"368e1f530432496977fd4c8ec62223b51055c8d8829795e0f13cb179878e7510"},"schema_version":"1.0","source":{"id":"1404.2183","kind":"arxiv","version":2}},"canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98057effc85788398263aa2e4f0b86d91af3179bd908a87094b16ff11cb3207c","first_computed_at":"2026-05-18T02:53:52.918408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:52.918408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoTTR7zIqdv9A4qlz/3hQDTU7pbHxWWxxqkPuvJ1LYSE6LZLYRoTW4fLEvyQsM5K6p3jJYjvSLp4P/jhN+//Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:52.919278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b17df1a1aaf1ba63a1950393bb5ab17d660ea6cd4b77fd64e76712668759afa","sha256:396c698c9f53b4807fd867e15611d8b887a94d363dd0059adc5623d947bde7e9"],"state_sha256":"2f32f61d38071dc38ac1ed54d545daebf7054c8e77f22f48a939df51572e0f71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONBZatM/diSJkkOBGF/LwLAJxaI3KRxRB3FHwh1zCRkawo3tCwJ9foLP3YpHG4uRgrBqMBrB6V+b2BJf+v4ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:10:58.991829Z","bundle_sha256":"5558d43452cf5dacd699c0af4b18d0bea834772dcd100a756ea1574f756b1feb"}}