{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G2OVLNDMQSZ2M2DZAT2GBSRHIN","short_pith_number":"pith:G2OVLNDM","canonical_record":{"source":{"id":"1609.04391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-14T19:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"8335f259417f1c912b1dc0cfbf28e0114ec07918f8f79cd5030406558890feae","abstract_canon_sha256":"e8de3a8f919b5c9c2f15661e0a7dafbeafb81082f8281c733586e8a5506e2615"},"schema_version":"1.0"},"canonical_sha256":"369d55b46c84b3a6687904f460ca274367a8311ae8dd687af345b99647290965","source":{"kind":"arxiv","id":"1609.04391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04391","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04391v1","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04391","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"G2OVLNDMQSZ2","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2OVLNDMQSZ2M2DZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2OVLNDM","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G2OVLNDMQSZ2M2DZAT2GBSRHIN","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-14T19:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"8335f259417f1c912b1dc0cfbf28e0114ec07918f8f79cd5030406558890feae","abstract_canon_sha256":"e8de3a8f919b5c9c2f15661e0a7dafbeafb81082f8281c733586e8a5506e2615"},"schema_version":"1.0"},"canonical_sha256":"369d55b46c84b3a6687904f460ca274367a8311ae8dd687af345b99647290965","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.489931Z","signature_b64":"l2XXSqoNEPApPCSxKg2boGbuInHvDchGeEml8ai1iX9KYOgCd9bcvd9oLmKmBoIBdXPrTCTab/Rgcr7PLfI9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"369d55b46c84b3a6687904f460ca274367a8311ae8dd687af345b99647290965","last_reissued_at":"2026-05-17T23:48:02.489366Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.489366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04391","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-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bcvo3ifPptpQMsdPFSxRqXZsD2RtPRsgVAIoY+UK+XcdcyuoKckC85eayQHfH/rmntQIO943KyQzWNhPdVHUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:52:42.881243Z"},"content_sha256":"ae5a0c58cfe22a90513a2f9d7f467ef8c149bc02f4b1db8b8984a57962645dc8","schema_version":"1.0","event_id":"sha256:ae5a0c58cfe22a90513a2f9d7f467ef8c149bc02f4b1db8b8984a57962645dc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G2OVLNDMQSZ2M2DZAT2GBSRHIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When is $a^{n} + 1$ the sum of two squares?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aaron Schmitt, Emily Stamm, Greg Dresden, Jeremy Rouse, Kylie Hess, Pan Yue, Saimon Islam, Terrin Warren","submitted_at":"2016-09-14T19:50:18Z","abstract_excerpt":"Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares for all $n \\in \\mathbb{N}$ if and only if $a$ is a perfect square. We also prove that for $a\\equiv 0,1,2\\pmod{4},$ if $a^{n} + 1$ is the sum of two squares, then $a^{\\delta} + 1$ is the sum of two squares for all $\\delta | n, \\ \\delta>1$. Using Aurifeuillian factorization, we show that if $a$ is a prime and $a\\equiv 1 \\pmod{4}$, then there are either zero or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04391","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-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZ/B2jalWpTFPtfC6J4Dp01Y+vjyrcO6Kgjnhlt7dYzU34AkQAVrlLk4KpyiKqmY8NtGMTHZZzcSqwO/HNKCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:52:42.881928Z"},"content_sha256":"ced4582b7fb5f7bcb5b50a06debc484028db7113081ace2719f92081dabac69f","schema_version":"1.0","event_id":"sha256:ced4582b7fb5f7bcb5b50a06debc484028db7113081ace2719f92081dabac69f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/bundle.json","state_url":"https://pith.science/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/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-05-26T18:52:42Z","links":{"resolver":"https://pith.science/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN","bundle":"https://pith.science/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/bundle.json","state":"https://pith.science/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2OVLNDMQSZ2M2DZAT2GBSRHIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G2OVLNDMQSZ2M2DZAT2GBSRHIN","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":"e8de3a8f919b5c9c2f15661e0a7dafbeafb81082f8281c733586e8a5506e2615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-14T19:50:18Z","title_canon_sha256":"8335f259417f1c912b1dc0cfbf28e0114ec07918f8f79cd5030406558890feae"},"schema_version":"1.0","source":{"id":"1609.04391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04391","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04391v1","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04391","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"G2OVLNDMQSZ2","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2OVLNDMQSZ2M2DZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2OVLNDM","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:ced4582b7fb5f7bcb5b50a06debc484028db7113081ace2719f92081dabac69f","target":"graph","created_at":"2026-05-17T23:48:02Z","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":"Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares for all $n \\in \\mathbb{N}$ if and only if $a$ is a perfect square. We also prove that for $a\\equiv 0,1,2\\pmod{4},$ if $a^{n} + 1$ is the sum of two squares, then $a^{\\delta} + 1$ is the sum of two squares for all $\\delta | n, \\ \\delta>1$. Using Aurifeuillian factorization, we show that if $a$ is a prime and $a\\equiv 1 \\pmod{4}$, then there are either zero or","authors_text":"Aaron Schmitt, Emily Stamm, Greg Dresden, Jeremy Rouse, Kylie Hess, Pan Yue, Saimon Islam, Terrin Warren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-14T19:50:18Z","title":"When is $a^{n} + 1$ the sum of two squares?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04391","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:ae5a0c58cfe22a90513a2f9d7f467ef8c149bc02f4b1db8b8984a57962645dc8","target":"record","created_at":"2026-05-17T23:48:02Z","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":"e8de3a8f919b5c9c2f15661e0a7dafbeafb81082f8281c733586e8a5506e2615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-14T19:50:18Z","title_canon_sha256":"8335f259417f1c912b1dc0cfbf28e0114ec07918f8f79cd5030406558890feae"},"schema_version":"1.0","source":{"id":"1609.04391","kind":"arxiv","version":1}},"canonical_sha256":"369d55b46c84b3a6687904f460ca274367a8311ae8dd687af345b99647290965","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"369d55b46c84b3a6687904f460ca274367a8311ae8dd687af345b99647290965","first_computed_at":"2026-05-17T23:48:02.489366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:02.489366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2XXSqoNEPApPCSxKg2boGbuInHvDchGeEml8ai1iX9KYOgCd9bcvd9oLmKmBoIBdXPrTCTab/Rgcr7PLfI9Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:02.489931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae5a0c58cfe22a90513a2f9d7f467ef8c149bc02f4b1db8b8984a57962645dc8","sha256:ced4582b7fb5f7bcb5b50a06debc484028db7113081ace2719f92081dabac69f"],"state_sha256":"be6172455dca6236b396bc9ba57f3537db7bacf7e31f45620b902adbf64cdfbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7oYnbE1JiYOZBV6fyB8fje1qwadjYh2yYi20CUrvM+uBur03/pWBfay+V5uDqW7oFSbwCzv6yvurR/qHg75Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:52:42.885156Z","bundle_sha256":"8f9ca9a6b851338a797ca939e0eb60c010115ee17215e453a03a0f5fab7b7e85"}}