{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TB2LRUICSB3H35W3DGW5JUX26M","short_pith_number":"pith:TB2LRUIC","schema_version":"1.0","canonical_sha256":"9874b8d10290767df6db19add4d2faf30fac9011e456fec5278cf0a37c3e4573","source":{"kind":"arxiv","id":"1408.2608","version":3},"attestation_state":"computed","paper":{"title":"A deterministic algorithm for integer factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ghaith A. Hiary","submitted_at":"2014-08-12T03:04:17Z","abstract_excerpt":"A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division. The algorithm is implemented."},"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":"1408.2608","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-08-12T03:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"952a6a7b2fe7e9fd860cbf535bfb5cab526641933a62c92756c67c46e361713e","abstract_canon_sha256":"e956e4d72be9f935570d556f578cf8814de00a67c98806facef423877222fadd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:18.617080Z","signature_b64":"p3wW4bCm55s9KTliO2jP4hvZ4Rc6u/hB+xfVjfEWtXjZVTS6sTqC+mFZr3c0joFVxzL7Y5S8crbFX91hPJUZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9874b8d10290767df6db19add4d2faf30fac9011e456fec5278cf0a37c3e4573","last_reissued_at":"2026-05-18T01:10:18.616451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:18.616451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A deterministic algorithm for integer factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ghaith A. Hiary","submitted_at":"2014-08-12T03:04:17Z","abstract_excerpt":"A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division. The algorithm is implemented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2608","kind":"arxiv","version":3},"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":"1408.2608","created_at":"2026-05-18T01:10:18.616545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2608v3","created_at":"2026-05-18T01:10:18.616545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2608","created_at":"2026-05-18T01:10:18.616545+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB2LRUICSB3H","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB2LRUICSB3H35W3","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB2LRUIC","created_at":"2026-05-18T12:28:49.207871+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/TB2LRUICSB3H35W3DGW5JUX26M","json":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M.json","graph_json":"https://pith.science/api/pith-number/TB2LRUICSB3H35W3DGW5JUX26M/graph.json","events_json":"https://pith.science/api/pith-number/TB2LRUICSB3H35W3DGW5JUX26M/events.json","paper":"https://pith.science/paper/TB2LRUIC"},"agent_actions":{"view_html":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M","download_json":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M.json","view_paper":"https://pith.science/paper/TB2LRUIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2608&json=true","fetch_graph":"https://pith.science/api/pith-number/TB2LRUICSB3H35W3DGW5JUX26M/graph.json","fetch_events":"https://pith.science/api/pith-number/TB2LRUICSB3H35W3DGW5JUX26M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M/action/storage_attestation","attest_author":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M/action/author_attestation","sign_citation":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M/action/citation_signature","submit_replication":"https://pith.science/pith/TB2LRUICSB3H35W3DGW5JUX26M/action/replication_record"}},"created_at":"2026-05-18T01:10:18.616545+00:00","updated_at":"2026-05-18T01:10:18.616545+00:00"}