{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C4XH6SI5RH5J5E3O7GGBBTDPFM","short_pith_number":"pith:C4XH6SI5","canonical_record":{"source":{"id":"1511.08918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-28T18:35:05Z","cross_cats_sorted":[],"title_canon_sha256":"b1e7e67032604816805c99f6560d53036589841433426a41fa0dd421b6f56db5","abstract_canon_sha256":"58c144c42ac7b71105206db8548d8c1168f30449f684ff346377b9ff8b66b55b"},"schema_version":"1.0"},"canonical_sha256":"172e7f491d89fa9e936ef98c10cc6f2b2a56549c6698b0a7413b2e34676d8edc","source":{"kind":"arxiv","id":"1511.08918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08918","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08918v1","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08918","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"C4XH6SI5RH5J","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C4XH6SI5RH5J5E3O","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C4XH6SI5","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C4XH6SI5RH5J5E3O7GGBBTDPFM","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-28T18:35:05Z","cross_cats_sorted":[],"title_canon_sha256":"b1e7e67032604816805c99f6560d53036589841433426a41fa0dd421b6f56db5","abstract_canon_sha256":"58c144c42ac7b71105206db8548d8c1168f30449f684ff346377b9ff8b66b55b"},"schema_version":"1.0"},"canonical_sha256":"172e7f491d89fa9e936ef98c10cc6f2b2a56549c6698b0a7413b2e34676d8edc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:46.111866Z","signature_b64":"7KKccqzLYAjIWHe5G9plTDI5dXOdti6Ztkh4AAvVPIxX0F/Ev/cXG95eSa2aeegcm0abUXB0piIqiW9v/5z+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172e7f491d89fa9e936ef98c10cc6f2b2a56549c6698b0a7413b2e34676d8edc","last_reissued_at":"2026-05-18T01:25:46.111176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:46.111176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08918","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-18T01:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoS6XeRfi4y4rTf5efZG5ksq71dfHEG39qwV/I+9Ym5vvvNyaBYFh4Q0XCMSd1efrYHq0e5tbr/tm7N9wM9+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:21:01.770048Z"},"content_sha256":"7bc40d13709d25fe3b6518e4803f1456c18c71f43a0fd7600b2f81f41b789568","schema_version":"1.0","event_id":"sha256:7bc40d13709d25fe3b6518e4803f1456c18c71f43a0fd7600b2f81f41b789568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C4XH6SI5RH5J5E3O7GGBBTDPFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factoring polynomials of the form $f(x^n)\\in \\mathbb{F}_q[x]$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"F.E. Brochero Mart\\'inez, Lucas Reis","submitted_at":"2015-11-28T18:35:05Z","abstract_excerpt":"Let $f(x)\\in \\mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\\nu_p(q-1)\\ge \\nu_{p}(e)+\\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine the irreducible factors of $f(x^n)$. We also show the irreducible factors in the case when ${\\rm rad}(n)$ divides $q-1$ and ${\\rm gcd}(m, n)=1$. Finally, using this algorithm we split $x^n-1$ into irreducible factors, in the case when $n=2^mp^t$ and $q$ is a generator of the group $\\mathbb{Z}_{p^2}^*$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08918","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-18T01:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfF2QlB9TgX+wihVwd21u3v1JujwUiONy4loRZl6xd+jYNW/MXlT9jUmIkDV6WYtrcKhkQWidseCiJjejpAxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:21:01.770659Z"},"content_sha256":"456dec758f0b87d9ad340f0193d630d3b0f161f4e54e86b78dd6a4abbe767aa7","schema_version":"1.0","event_id":"sha256:456dec758f0b87d9ad340f0193d630d3b0f161f4e54e86b78dd6a4abbe767aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/bundle.json","state_url":"https://pith.science/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/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-30T02:21:01Z","links":{"resolver":"https://pith.science/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM","bundle":"https://pith.science/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/bundle.json","state":"https://pith.science/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4XH6SI5RH5J5E3O7GGBBTDPFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C4XH6SI5RH5J5E3O7GGBBTDPFM","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":"58c144c42ac7b71105206db8548d8c1168f30449f684ff346377b9ff8b66b55b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-28T18:35:05Z","title_canon_sha256":"b1e7e67032604816805c99f6560d53036589841433426a41fa0dd421b6f56db5"},"schema_version":"1.0","source":{"id":"1511.08918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08918","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08918v1","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08918","created_at":"2026-05-18T01:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"C4XH6SI5RH5J","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C4XH6SI5RH5J5E3O","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C4XH6SI5","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:456dec758f0b87d9ad340f0193d630d3b0f161f4e54e86b78dd6a4abbe767aa7","target":"graph","created_at":"2026-05-18T01:25:46Z","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 $f(x)\\in \\mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\\nu_p(q-1)\\ge \\nu_{p}(e)+\\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine the irreducible factors of $f(x^n)$. We also show the irreducible factors in the case when ${\\rm rad}(n)$ divides $q-1$ and ${\\rm gcd}(m, n)=1$. Finally, using this algorithm we split $x^n-1$ into irreducible factors, in the case when $n=2^mp^t$ and $q$ is a generator of the group $\\mathbb{Z}_{p^2}^*$.","authors_text":"F.E. Brochero Mart\\'inez, Lucas Reis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-28T18:35:05Z","title":"Factoring polynomials of the form $f(x^n)\\in \\mathbb{F}_q[x]$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08918","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:7bc40d13709d25fe3b6518e4803f1456c18c71f43a0fd7600b2f81f41b789568","target":"record","created_at":"2026-05-18T01:25:46Z","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":"58c144c42ac7b71105206db8548d8c1168f30449f684ff346377b9ff8b66b55b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-28T18:35:05Z","title_canon_sha256":"b1e7e67032604816805c99f6560d53036589841433426a41fa0dd421b6f56db5"},"schema_version":"1.0","source":{"id":"1511.08918","kind":"arxiv","version":1}},"canonical_sha256":"172e7f491d89fa9e936ef98c10cc6f2b2a56549c6698b0a7413b2e34676d8edc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172e7f491d89fa9e936ef98c10cc6f2b2a56549c6698b0a7413b2e34676d8edc","first_computed_at":"2026-05-18T01:25:46.111176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:46.111176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7KKccqzLYAjIWHe5G9plTDI5dXOdti6Ztkh4AAvVPIxX0F/Ev/cXG95eSa2aeegcm0abUXB0piIqiW9v/5z+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:46.111866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc40d13709d25fe3b6518e4803f1456c18c71f43a0fd7600b2f81f41b789568","sha256:456dec758f0b87d9ad340f0193d630d3b0f161f4e54e86b78dd6a4abbe767aa7"],"state_sha256":"192143d167ee21e73dbf596a07bcad7d0ccab220426a2a6ee92455198cd83488"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VtandryZ7hp1l4uqQG5HRBiwGuf6d+UNUaFA+2LXOMCpRMw7N1Oxoe7sxK2hyadKqwViuuI0g/on/MxxQbLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T02:21:01.773514Z","bundle_sha256":"d0addf923534d823e54947cfdb44b8c04432dab619751eafcccc203a08303b46"}}