{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JPKCDNWHX2UNKVZICVHQKMMUSO","short_pith_number":"pith:JPKCDNWH","schema_version":"1.0","canonical_sha256":"4bd421b6c7bea8d55728154f05319493b191a55fb7cb1cf27177945f9dc2eef4","source":{"kind":"arxiv","id":"2605.18348","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.18348","created_at":"2026-05-20T00:05:56.419786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18348v1","created_at":"2026-05-20T00:05:56.419786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18348","created_at":"2026-05-20T00:05:56.419786+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPKCDNWHX2UN","created_at":"2026-05-20T00:05:56.419786+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPKCDNWHX2UNKVZI","created_at":"2026-05-20T00:05:56.419786+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPKCDNWH","created_at":"2026-05-20T00:05:56.419786+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/JPKCDNWHX2UNKVZICVHQKMMUSO","json":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO.json","graph_json":"https://pith.science/api/pith-number/JPKCDNWHX2UNKVZICVHQKMMUSO/graph.json","events_json":"https://pith.science/api/pith-number/JPKCDNWHX2UNKVZICVHQKMMUSO/events.json","paper":"https://pith.science/paper/JPKCDNWH"},"agent_actions":{"view_html":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO","download_json":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO.json","view_paper":"https://pith.science/paper/JPKCDNWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18348&json=true","fetch_graph":"https://pith.science/api/pith-number/JPKCDNWHX2UNKVZICVHQKMMUSO/graph.json","fetch_events":"https://pith.science/api/pith-number/JPKCDNWHX2UNKVZICVHQKMMUSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/action/storage_attestation","attest_author":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/action/author_attestation","sign_citation":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/action/citation_signature","submit_replication":"https://pith.science/pith/JPKCDNWHX2UNKVZICVHQKMMUSO/action/replication_record"}},"created_at":"2026-05-20T00:05:56.419786+00:00","updated_at":"2026-05-20T00:05:56.419786+00:00"}