{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:BUVGCV3XP3KYOVD477VXYP4TAX","short_pith_number":"pith:BUVGCV3X","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"},"canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","source":{"kind":"arxiv","id":"0811.1595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1595","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1595v2","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1595","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"BUVGCV3XP3KY","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"BUVGCV3XP3KYOVD4","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"BUVGCV3X","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:BUVGCV3XP3KYOVD477VXYP4TAX","target":"record","payload":{"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"},"canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","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"},"source_kind":"arxiv","source_id":"0811.1595","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-18T01:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbYsKzXJM+RpVAkdpmNJKD7jY2tEVRfZ6GAraUo3mYPU6vRsAh1vTcNJ3JlOMHEGliT2ZbxAsdZpRv4DQQrmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:04:55.419967Z"},"content_sha256":"0a630f891f129bba66474cb241ecded3c84a769d3a120684b4e4aa944ef3c47c","schema_version":"1.0","event_id":"sha256:0a630f891f129bba66474cb241ecded3c84a769d3a120684b4e4aa944ef3c47c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:BUVGCV3XP3KYOVD477VXYP4TAX","target":"graph","payload":{"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"},"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-18T01:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRV0S/1rOzI7u4LoU2h0KUlQSGboeG0gKdkVitXKNXOl8gLHK+tNpcMVnVtqDkPILELbyWLXzEkV5qoaBogYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:04:55.420321Z"},"content_sha256":"a96243f07afbb55fdcddb3310c0f508253121c916e485cfb85dfbe38264510c9","schema_version":"1.0","event_id":"sha256:a96243f07afbb55fdcddb3310c0f508253121c916e485cfb85dfbe38264510c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/bundle.json","state_url":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUVGCV3XP3KYOVD477VXYP4TAX/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-02T22:04:55Z","links":{"resolver":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX","bundle":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/bundle.json","state":"https://pith.science/pith/BUVGCV3XP3KYOVD477VXYP4TAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUVGCV3XP3KYOVD477VXYP4TAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:BUVGCV3XP3KYOVD477VXYP4TAX","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":"0ce2f966ecb5f09cdccb157e6e519d7027da3ba46883eedb879a92fc0286873e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-10T22:27:49Z","title_canon_sha256":"174121ccad3f6fe086d46f6a0496dbcb735c69a17186dcc98999d92d98abff79"},"schema_version":"1.0","source":{"id":"0811.1595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1595","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1595v2","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1595","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"BUVGCV3XP3KY","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"BUVGCV3XP3KYOVD4","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"BUVGCV3X","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:a96243f07afbb55fdcddb3310c0f508253121c916e485cfb85dfbe38264510c9","target":"graph","created_at":"2026-05-18T01:55:43Z","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":"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. ","authors_text":"Augusto Garuccio, Heyi Zhang, Vincenzo Tamma, Xuehua He, Yanhua Shih","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-10T22:27:49Z","title":"New factorization algorithm based on a continuous representation of truncated Gauss sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1595","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:0a630f891f129bba66474cb241ecded3c84a769d3a120684b4e4aa944ef3c47c","target":"record","created_at":"2026-05-18T01:55:43Z","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":"0ce2f966ecb5f09cdccb157e6e519d7027da3ba46883eedb879a92fc0286873e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-10T22:27:49Z","title_canon_sha256":"174121ccad3f6fe086d46f6a0496dbcb735c69a17186dcc98999d92d98abff79"},"schema_version":"1.0","source":{"id":"0811.1595","kind":"arxiv","version":2}},"canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d2a6157777ed587547cffeb7c3f9305cd9fe66febda0cb86e59eb24a7f32b8c","first_computed_at":"2026-05-18T01:55:43.647012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:43.647012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JA8QF9yA1hWye0nwFEdKXly69r5qZd27vaMl7n4Mrox0OHeDdSmzsH1WZTsv4CDxdf5vgTn/xFfcvizn2FScCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:43.647992Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.1595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a630f891f129bba66474cb241ecded3c84a769d3a120684b4e4aa944ef3c47c","sha256:a96243f07afbb55fdcddb3310c0f508253121c916e485cfb85dfbe38264510c9"],"state_sha256":"813f201f478f53ed8bb2c4a6a3476042ce6988fac11785c9e62bc38eb3fb1536"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xbxj+yaquI6F7PcubdGCxaao8zn+9oAON03utAZrWrgFLbwHEdpNTePMomQSg3vzDuZ7CO0AV4vDWQcCB1mABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:04:55.422593Z","bundle_sha256":"6158ba22d7d4f15044bc1671e16d7262ad6c87c117b9719b2aebe1b5141d0e12"}}