{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XPMHRAXRUNEOR6SCUMRZDANJOU","short_pith_number":"pith:XPMHRAXR","schema_version":"1.0","canonical_sha256":"bbd87882f1a348e8fa42a3239181a97513b8ab2d6ec1766f6684df0e17013a35","source":{"kind":"arxiv","id":"1812.04294","version":1},"attestation_state":"computed","paper":{"title":"A Swan-like note for a family of binary pentanomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Giorgos Kapetanakis","submitted_at":"2018-12-11T09:35:11Z","abstract_excerpt":"In this note, we employ the techniques of Swan (Pacific J. Math. 12(3): 1099-1106, 1962) with the purpose of studying the parity of the number of the irreducible factors of the penatomial $X^n+X^{3s}+X^{2s}+X^{s}+1\\in\\mathbb{F}_2[X]$, where $s$ is even and $n>3s$. Our results imply that if $n \\not\\equiv \\pm 1 \\pmod{8}$, then the polynomial in question is reducible."},"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":"1812.04294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-12-11T09:35:11Z","cross_cats_sorted":[],"title_canon_sha256":"37041fbfbf58661d274f637b2bb5262bf4e29f2d48ef1823c22036a5817472ed","abstract_canon_sha256":"39ceb7f59fa606a3360c1e0722d28d9493384b4abacd8152f51f553404caf2d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:32.689596Z","signature_b64":"Sl9CVSUYBE+hbk/ulqXP4ukNn4MUDThSwXj6wNl4QR5A0N0pzYzcYlkLVQXQPq5m+ISmHllJPiy0PUlyWEg3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd87882f1a348e8fa42a3239181a97513b8ab2d6ec1766f6684df0e17013a35","last_reissued_at":"2026-05-17T23:58:32.688823Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:32.688823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Swan-like note for a family of binary pentanomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Giorgos Kapetanakis","submitted_at":"2018-12-11T09:35:11Z","abstract_excerpt":"In this note, we employ the techniques of Swan (Pacific J. Math. 12(3): 1099-1106, 1962) with the purpose of studying the parity of the number of the irreducible factors of the penatomial $X^n+X^{3s}+X^{2s}+X^{s}+1\\in\\mathbb{F}_2[X]$, where $s$ is even and $n>3s$. Our results imply that if $n \\not\\equiv \\pm 1 \\pmod{8}$, then the polynomial in question is reducible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04294","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.04294","created_at":"2026-05-17T23:58:32.688966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04294v1","created_at":"2026-05-17T23:58:32.688966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04294","created_at":"2026-05-17T23:58:32.688966+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPMHRAXRUNEO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPMHRAXRUNEOR6SC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPMHRAXR","created_at":"2026-05-18T12:33:01.666342+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/XPMHRAXRUNEOR6SCUMRZDANJOU","json":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU.json","graph_json":"https://pith.science/api/pith-number/XPMHRAXRUNEOR6SCUMRZDANJOU/graph.json","events_json":"https://pith.science/api/pith-number/XPMHRAXRUNEOR6SCUMRZDANJOU/events.json","paper":"https://pith.science/paper/XPMHRAXR"},"agent_actions":{"view_html":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU","download_json":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU.json","view_paper":"https://pith.science/paper/XPMHRAXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04294&json=true","fetch_graph":"https://pith.science/api/pith-number/XPMHRAXRUNEOR6SCUMRZDANJOU/graph.json","fetch_events":"https://pith.science/api/pith-number/XPMHRAXRUNEOR6SCUMRZDANJOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU/action/storage_attestation","attest_author":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU/action/author_attestation","sign_citation":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU/action/citation_signature","submit_replication":"https://pith.science/pith/XPMHRAXRUNEOR6SCUMRZDANJOU/action/replication_record"}},"created_at":"2026-05-17T23:58:32.688966+00:00","updated_at":"2026-05-17T23:58:32.688966+00:00"}