{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GGSP2UX2OVNKHRZY4NSXSGURXB","short_pith_number":"pith:GGSP2UX2","canonical_record":{"source":{"id":"1512.06401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-20T17:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"22ef61c30dd588be03e2108444fbba4e7249fe1f626618f9faa04c01b37300a4","abstract_canon_sha256":"0df0d041199ff0985e26c658eb7a249e25bd44396c35558b0a3f3953fa45a729"},"schema_version":"1.0"},"canonical_sha256":"31a4fd52fa755aa3c738e365791a91b864e898d6c75939d5330d8d75cb2413b9","source":{"kind":"arxiv","id":"1512.06401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06401","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06401v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06401","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"GGSP2UX2OVNK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGSP2UX2OVNKHRZY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGSP2UX2","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GGSP2UX2OVNKHRZY4NSXSGURXB","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-20T17:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"22ef61c30dd588be03e2108444fbba4e7249fe1f626618f9faa04c01b37300a4","abstract_canon_sha256":"0df0d041199ff0985e26c658eb7a249e25bd44396c35558b0a3f3953fa45a729"},"schema_version":"1.0"},"canonical_sha256":"31a4fd52fa755aa3c738e365791a91b864e898d6c75939d5330d8d75cb2413b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.088901Z","signature_b64":"sUXMS1MV/D9hbjlvZRi2uxxa2RzdF/WTy/92VU3GC2DUM06gWNTy6W35q3iVRfnTuyIiKtq6/nVcHzWi6tbJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a4fd52fa755aa3c738e365791a91b864e898d6c75939d5330d8d75cb2413b9","last_reissued_at":"2026-05-18T00:34:58.088244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.088244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06401","source_version":1,"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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MtrJmV3BjV08nSfrhdF2sqabvLZIIias49PebGYPMvvMdSGxDF9xJhAyWCCKhy9hK59UG9U1/b93g2eTVQHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:54:33.586694Z"},"content_sha256":"4152e6345c99ed486af58436f0950f6ea01bfbee905e21800be6c39dfbd64998","schema_version":"1.0","event_id":"sha256:4152e6345c99ed486af58436f0950f6ea01bfbee905e21800be6c39dfbd64998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GGSP2UX2OVNKHRZY4NSXSGURXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic factorization of sums and differences of powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Markus Hittmeir","submitted_at":"2015-12-20T17:06:30Z","abstract_excerpt":"Let $a,b\\in \\mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\\pm b^n$, $n\\in\\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime factorization of $N$ in \\[ \\mathcal{O}(\\text{M}_{\\text{int}}(N^{1/4}\\sqrt{\\log N})), \\] $\\text{M}_{\\text{int}}(k)$ denoting the cost for multiplying two $k$-bit integers. This result is better than the currently best known general bound for the runtime complexity for deterministic integer factorization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06401","kind":"arxiv","version":1},"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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLz7iTLY3X9ToHGhsoBhJ4hWKZhJKr9tEDscfCm1R43jp2EEhAd8ykqqlLluckWmhH+mNcfl8J9mh9lLafpWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:54:33.587037Z"},"content_sha256":"d4ecf808dc83dd04860d8dd6ddf8efbcafd35d506bdcf47f1cf6332950719d1a","schema_version":"1.0","event_id":"sha256:d4ecf808dc83dd04860d8dd6ddf8efbcafd35d506bdcf47f1cf6332950719d1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/bundle.json","state_url":"https://pith.science/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/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-23T14:54:33Z","links":{"resolver":"https://pith.science/pith/GGSP2UX2OVNKHRZY4NSXSGURXB","bundle":"https://pith.science/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/bundle.json","state":"https://pith.science/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGSP2UX2OVNKHRZY4NSXSGURXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GGSP2UX2OVNKHRZY4NSXSGURXB","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":"0df0d041199ff0985e26c658eb7a249e25bd44396c35558b0a3f3953fa45a729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-20T17:06:30Z","title_canon_sha256":"22ef61c30dd588be03e2108444fbba4e7249fe1f626618f9faa04c01b37300a4"},"schema_version":"1.0","source":{"id":"1512.06401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06401","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06401v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06401","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"GGSP2UX2OVNK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGSP2UX2OVNKHRZY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGSP2UX2","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:d4ecf808dc83dd04860d8dd6ddf8efbcafd35d506bdcf47f1cf6332950719d1a","target":"graph","created_at":"2026-05-18T00:34:58Z","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":"Let $a,b\\in \\mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\\pm b^n$, $n\\in\\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime factorization of $N$ in \\[ \\mathcal{O}(\\text{M}_{\\text{int}}(N^{1/4}\\sqrt{\\log N})), \\] $\\text{M}_{\\text{int}}(k)$ denoting the cost for multiplying two $k$-bit integers. This result is better than the currently best known general bound for the runtime complexity for deterministic integer factorization.","authors_text":"Markus Hittmeir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-20T17:06:30Z","title":"Deterministic factorization of sums and differences of powers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06401","kind":"arxiv","version":1},"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:4152e6345c99ed486af58436f0950f6ea01bfbee905e21800be6c39dfbd64998","target":"record","created_at":"2026-05-18T00:34:58Z","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":"0df0d041199ff0985e26c658eb7a249e25bd44396c35558b0a3f3953fa45a729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-20T17:06:30Z","title_canon_sha256":"22ef61c30dd588be03e2108444fbba4e7249fe1f626618f9faa04c01b37300a4"},"schema_version":"1.0","source":{"id":"1512.06401","kind":"arxiv","version":1}},"canonical_sha256":"31a4fd52fa755aa3c738e365791a91b864e898d6c75939d5330d8d75cb2413b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a4fd52fa755aa3c738e365791a91b864e898d6c75939d5330d8d75cb2413b9","first_computed_at":"2026-05-18T00:34:58.088244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:58.088244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sUXMS1MV/D9hbjlvZRi2uxxa2RzdF/WTy/92VU3GC2DUM06gWNTy6W35q3iVRfnTuyIiKtq6/nVcHzWi6tbJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:58.088901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4152e6345c99ed486af58436f0950f6ea01bfbee905e21800be6c39dfbd64998","sha256:d4ecf808dc83dd04860d8dd6ddf8efbcafd35d506bdcf47f1cf6332950719d1a"],"state_sha256":"2dc1e63a67165c8faabf211b6c5a6ee45c71ca5103ecfd33e0c76bdd29db5204"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyvylEM22mFbcPIagbvxOOctmgX31tpvrx5yFgr1Woopp+KkBrOUM5cZUz9rWzsN6pO6a6bwqH4UOpXhYnqlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:54:33.589059Z","bundle_sha256":"b750d4e19f9851e83f6e91407ee5ec2e1e333bdaf6c26b36374dcb689ceadae0"}}