{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:BUVGCV3XP3KYOVD477VXYP4TAX","short_pith_number":"pith:BUVGCV3X","schema_version":"1.0","canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","source":{"kind":"arxiv","id":"0811.1595","version":2},"attestation_state":"computed","paper":{"title":"New factorization algorithm based on a continuous representation of truncated Gauss sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Augusto Garuccio, Heyi Zhang, Vincenzo Tamma, Xuehua He, Yanhua Shih","submitted_at":"2008-11-10T22:27:49Z","abstract_excerpt":"In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a single run without precalculating the ratio N/l, where l are all the possible trial factors. Continuous truncated exponential sums turn out to be a powerful tool for distinguishing factors from non-factors (we also suggest, with regard to this topic, to read an interesting paper by S. Woelk et al. also published in this issue [Woelk, Feiler, Schleich, J. Mod. "},"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":"0811.1595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-10T22:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"174121ccad3f6fe086d46f6a0496dbcb735c69a17186dcc98999d92d98abff79","abstract_canon_sha256":"0ce2f966ecb5f09cdccb157e6e519d7027da3ba46883eedb879a92fc0286873e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:43.647992Z","signature_b64":"JA8QF9yA1hWye0nwFEdKXly69r5qZd27vaMl7n4Mrox0OHeDdSmzsH1WZTsv4CDxdf5vgTn/xFfcvizn2FScCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","last_reissued_at":"2026-05-18T01:55:43.647012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:43.647012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New factorization algorithm based on a continuous representation of truncated Gauss sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Augusto Garuccio, Heyi Zhang, Vincenzo Tamma, Xuehua He, Yanhua Shih","submitted_at":"2008-11-10T22:27:49Z","abstract_excerpt":"In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a single run without precalculating the ratio N/l, where l are all the possible trial factors. Continuous truncated exponential sums turn out to be a powerful tool for distinguishing factors from non-factors (we also suggest, with regard to this topic, to read an interesting paper by S. Woelk et al. also published in this issue [Woelk, Feiler, Schleich, J. Mod. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1595","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":"0811.1595","created_at":"2026-05-18T01:55:43.647184+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.1595v2","created_at":"2026-05-18T01:55:43.647184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1595","created_at":"2026-05-18T01:55:43.647184+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUVGCV3XP3KY","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUVGCV3XP3KYOVD4","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUVGCV3X","created_at":"2026-05-18T12:25:56.245647+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/BUVGCV3XP3KYOVD477VXYP4TAX","json":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX.json","graph_json":"https://pith.science/api/pith-number/BUVGCV3XP3KYOVD477VXYP4TAX/graph.json","events_json":"https://pith.science/api/pith-number/BUVGCV3XP3KYOVD477VXYP4TAX/events.json","paper":"https://pith.science/paper/BUVGCV3X"},"agent_actions":{"view_html":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX","download_json":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX.json","view_paper":"https://pith.science/paper/BUVGCV3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.1595&json=true","fetch_graph":"https://pith.science/api/pith-number/BUVGCV3XP3KYOVD477VXYP4TAX/graph.json","fetch_events":"https://pith.science/api/pith-number/BUVGCV3XP3KYOVD477VXYP4TAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/action/storage_attestation","attest_author":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/action/author_attestation","sign_citation":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/action/citation_signature","submit_replication":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/action/replication_record"}},"created_at":"2026-05-18T01:55:43.647184+00:00","updated_at":"2026-05-18T01:55:43.647184+00:00"}