{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JPKCDNWHX2UNKVZICVHQKMMUSO","short_pith_number":"pith:JPKCDNWH","canonical_record":{"source":{"id":"2605.18348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-18T13:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"687d199697ed8fd53bdfbcc0490fcfeb36c8b34949733639e401394309936b9d","abstract_canon_sha256":"00a4524dce49c1f447559c017490e00baf1621a1eb4c0fbd62d1d9a157ef7df8"},"schema_version":"1.0"},"canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","source":{"kind":"arxiv","id":"2605.18348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18348","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18348v1","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18348","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"JPKCDNWHX2UN","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"JPKCDNWHX2UNKVZI","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"JPKCDNWH","created_at":"2026-05-20T00:05:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JPKCDNWHX2UNKVZICVHQKMMUSO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-18T13:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"687d199697ed8fd53bdfbcc0490fcfeb36c8b34949733639e401394309936b9d","abstract_canon_sha256":"00a4524dce49c1f447559c017490e00baf1621a1eb4c0fbd62d1d9a157ef7df8"},"schema_version":"1.0"},"canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:56.420363Z","signature_b64":"bz3gf+mus9ADFizbPqo+7JwMcvwyofrn8zC2ZReETfUnkAqxKYyObtzc0rK0Y0fhxZUESsVKvhSDUWbCfc05AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","last_reissued_at":"2026-05-20T00:05:56.419654Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:56.419654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18348","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-20T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTvk2nMTjZ+GBPN1ShBSpbFliv1/7wE5niQli1RpegUEYbcerAKPEDvTIDB50m4E70zmpjGn3no9wj9jmOErBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:49:20.156953Z"},"content_sha256":"3713ba480e014b1d01f0b595968bdf18ffc453108d9d32e00ca2b4da820595d9","schema_version":"1.0","event_id":"sha256:3713ba480e014b1d01f0b595968bdf18ffc453108d9d32e00ca2b4da820595d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JPKCDNWHX2UNKVZICVHQKMMUSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum of consecutive powers as a perfect power","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Angelos Koutsianas, Nikos Tzanakis","submitted_at":"2026-05-18T13:06:04Z","abstract_excerpt":"In this paper we study the equation $$\n  x^k + (x+1)^k = y^n,\\quad n\\geq 3, $$ when $k\\equiv 2\\pmod{4}$. We prove that the only solutions are for $x=0, -1$ when $6\\leq k\\leq 100$ or for a $k$ with odd prime factors congruent to $3\\pmod{4}$. We use linear forms in logarithms, the modular method and the resolution of Thue equations."},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We prove that the only solutions are for x=0, -1 when 6≤k≤100 or for a k with odd prime factors congruent to 3 mod 4.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The linear forms in logarithms and the modular method together produce effective bounds that cover all possible solutions without exception for the stated range of k (abstract, methods paragraph).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"535be2a00dfa9925af4fde2529c4c57c5965fa9217f2641517f943dd3cbe276b"},"source":{"id":"2605.18348","kind":"arxiv","version":1},"verdict":{"id":"eeda31ac-14ca-4d10-ad67-70ad64a9cdf0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:02:59.223182Z","strongest_claim":"We prove that the only solutions are for x=0, -1 when 6≤k≤100 or for a k with odd prime factors congruent to 3 mod 4.","one_line_summary":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The linear forms in logarithms and the modular method together produce effective bounds that cover all possible solutions without exception for the stated range of k (abstract, methods paragraph).","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18348/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.155125Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:32:00.443138Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.815804Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"41533a28d672fb205cb2055eb7f7dc683b7b9269a4177bb7de1466a42ff17703"},"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":"eeda31ac-14ca-4d10-ad67-70ad64a9cdf0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYurs1Wwy0+dp53rERDsFt24Ywt17qPMWnKAqt+BsdpQr6lz4gWgOMZImVY2vGeEXuUt8thx9I3cVEZPDaz3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:49:20.158195Z"},"content_sha256":"78cd7a041f57dd10953904c54577f6523c87a4c71c7b6e72147b7c7dd843f20e","schema_version":"1.0","event_id":"sha256:78cd7a041f57dd10953904c54577f6523c87a4c71c7b6e72147b7c7dd843f20e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/bundle.json","state_url":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/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-05T21:49:20Z","links":{"resolver":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO","bundle":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/bundle.json","state":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JPKCDNWHX2UNKVZICVHQKMMUSO","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":"00a4524dce49c1f447559c017490e00baf1621a1eb4c0fbd62d1d9a157ef7df8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-18T13:06:04Z","title_canon_sha256":"687d199697ed8fd53bdfbcc0490fcfeb36c8b34949733639e401394309936b9d"},"schema_version":"1.0","source":{"id":"2605.18348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18348","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18348v1","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18348","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"JPKCDNWHX2UN","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"JPKCDNWHX2UNKVZI","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"JPKCDNWH","created_at":"2026-05-20T00:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:78cd7a041f57dd10953904c54577f6523c87a4c71c7b6e72147b7c7dd843f20e","target":"graph","created_at":"2026-05-20T00:05:56Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that the only solutions are for x=0, -1 when 6≤k≤100 or for a k with odd prime factors congruent to 3 mod 4."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The linear forms in logarithms and the modular method together produce effective bounds that cover all possible solutions without exception for the stated range of k (abstract, methods paragraph)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4."}],"snapshot_sha256":"535be2a00dfa9925af4fde2529c4c57c5965fa9217f2641517f943dd3cbe276b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.155125Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:32:00.443138Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.815804Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18348/integrity.json","findings":[],"snapshot_sha256":"41533a28d672fb205cb2055eb7f7dc683b7b9269a4177bb7de1466a42ff17703","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study the equation $$\n  x^k + (x+1)^k = y^n,\\quad n\\geq 3, $$ when $k\\equiv 2\\pmod{4}$. We prove that the only solutions are for $x=0, -1$ when $6\\leq k\\leq 100$ or for a $k$ with odd prime factors congruent to $3\\pmod{4}$. We use linear forms in logarithms, the modular method and the resolution of Thue equations.","authors_text":"Angelos Koutsianas, Nikos Tzanakis","cross_cats":[],"headline":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-18T13:06:04Z","title":"Sum of consecutive powers as a perfect power"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18348","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-20T00:02:59.223182Z","id":"eeda31ac-14ca-4d10-ad67-70ad64a9cdf0","model_set":{"reader":"grok-4.3"},"one_line_summary":"For k ≡ 2 mod 4 the equation x^k + (x+1)^k = y^n (n ≥ 3) has only the solutions x = 0, -1 when 6 ≤ k ≤ 100 or k has an odd prime factor ≡ 3 mod 4.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"We prove that the only solutions are for x=0, -1 when 6≤k≤100 or for a k with odd prime factors congruent to 3 mod 4.","weakest_assumption":"The linear forms in logarithms and the modular method together produce effective bounds that cover all possible solutions without exception for the stated range of k (abstract, methods paragraph)."}},"verdict_id":"eeda31ac-14ca-4d10-ad67-70ad64a9cdf0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3713ba480e014b1d01f0b595968bdf18ffc453108d9d32e00ca2b4da820595d9","target":"record","created_at":"2026-05-20T00:05:56Z","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":"00a4524dce49c1f447559c017490e00baf1621a1eb4c0fbd62d1d9a157ef7df8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-18T13:06:04Z","title_canon_sha256":"687d199697ed8fd53bdfbcc0490fcfeb36c8b34949733639e401394309936b9d"},"schema_version":"1.0","source":{"id":"2605.18348","kind":"arxiv","version":1}},"canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","first_computed_at":"2026-05-20T00:05:56.419654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:56.419654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bz3gf+mus9ADFizbPqo+7JwMcvwyofrn8zC2ZReETfUnkAqxKYyObtzc0rK0Y0fhxZUESsVKvhSDUWbCfc05AQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:56.420363Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3713ba480e014b1d01f0b595968bdf18ffc453108d9d32e00ca2b4da820595d9","sha256:78cd7a041f57dd10953904c54577f6523c87a4c71c7b6e72147b7c7dd843f20e"],"state_sha256":"f6b765de0600a68b0c0b8627485982edf930f92f66d7c6ca061dc749b09856c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bm9bCPY3/AC9anoS+OduAlU0jihQJoAR7bQ8z9pF3AXZkTt9KPUGxEqKDuuo1uNKYeKUDic3crmkkQv3OA+LAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:49:20.162687Z","bundle_sha256":"1dd08636bfec092c53bf0d7a9767bd736cbe855f2a762515efff86b4b3580244"}}