{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KLIHLMAOLO3YDBC3ZPV3WYYBP2","short_pith_number":"pith:KLIHLMAO","canonical_record":{"source":{"id":"1211.3588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-15T12:33:07Z","cross_cats_sorted":[],"title_canon_sha256":"6f1db90abd191c2d0810cfa088a7a6983d5c447262025525db1a5483d6466d63","abstract_canon_sha256":"c051e4fda6bb5867300437830889fea6bab688a08ccb4aeed91091e1cfdab2d5"},"schema_version":"1.0"},"canonical_sha256":"52d075b00e5bb781845bcbebbb63017e83326ea43ae3544cf90afb2b09ae4116","source":{"kind":"arxiv","id":"1211.3588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3588","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3588v2","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3588","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"KLIHLMAOLO3Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KLIHLMAOLO3YDBC3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KLIHLMAO","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KLIHLMAOLO3YDBC3ZPV3WYYBP2","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-15T12:33:07Z","cross_cats_sorted":[],"title_canon_sha256":"6f1db90abd191c2d0810cfa088a7a6983d5c447262025525db1a5483d6466d63","abstract_canon_sha256":"c051e4fda6bb5867300437830889fea6bab688a08ccb4aeed91091e1cfdab2d5"},"schema_version":"1.0"},"canonical_sha256":"52d075b00e5bb781845bcbebbb63017e83326ea43ae3544cf90afb2b09ae4116","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:18.297693Z","signature_b64":"KavUmfFa6j96uFR6ZG1HXk1jWkqk68i26bnbcOWJXT/D7lG9O70yGl7/M864MkQVQYDrZ1QGA65O6hKR79pyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d075b00e5bb781845bcbebbb63017e83326ea43ae3544cf90afb2b09ae4116","last_reissued_at":"2026-05-17T23:53:18.297093Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:18.297093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3588","source_version":2,"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:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TsnBOg9T/Z52lE40TDzjVN3V7NWoR34H45QaiO5Tt8zuO3ImYFUyIUkLu4gVm6KTL3P5OJawOhQE7jR1Y9IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:12:02.851013Z"},"content_sha256":"9fb2b0ca610b010dd38a1a6accd2a9d67d35db3f20f13c2ca08d4f203cb2ffca","schema_version":"1.0","event_id":"sha256:9fb2b0ca610b010dd38a1a6accd2a9d67d35db3f20f13c2ca08d4f203cb2ffca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KLIHLMAOLO3YDBC3ZPV3WYYBP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of Galois groups of rational polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Claus Fieker, J\\\"urgen Kl\\\"uners","submitted_at":"2012-11-15T12:33:07Z","abstract_excerpt":"Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in the application of Stauduhar's method is to find, for a given pair of groups H<G a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3588","kind":"arxiv","version":2},"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:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GIJ77TE59JkKHiqVaDycNVGMAqq709eC1Mhm88qRXxwjoAc53pN1FgCbkP4OQEinoD334Rm1opS7jr66+KpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:12:02.851687Z"},"content_sha256":"be6904a08cdbff7b2cbbc65388366be24b5287dde8d8fe6565237b99bab99ec7","schema_version":"1.0","event_id":"sha256:be6904a08cdbff7b2cbbc65388366be24b5287dde8d8fe6565237b99bab99ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/bundle.json","state_url":"https://pith.science/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/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-31T19:12:02Z","links":{"resolver":"https://pith.science/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2","bundle":"https://pith.science/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/bundle.json","state":"https://pith.science/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLIHLMAOLO3YDBC3ZPV3WYYBP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KLIHLMAOLO3YDBC3ZPV3WYYBP2","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":"c051e4fda6bb5867300437830889fea6bab688a08ccb4aeed91091e1cfdab2d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-15T12:33:07Z","title_canon_sha256":"6f1db90abd191c2d0810cfa088a7a6983d5c447262025525db1a5483d6466d63"},"schema_version":"1.0","source":{"id":"1211.3588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3588","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3588v2","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3588","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"KLIHLMAOLO3Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KLIHLMAOLO3YDBC3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KLIHLMAO","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:be6904a08cdbff7b2cbbc65388366be24b5287dde8d8fe6565237b99bab99ec7","target":"graph","created_at":"2026-05-17T23:53:18Z","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":"Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in the application of Stauduhar's method is to find, for a given pair of groups H<G a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which","authors_text":"Claus Fieker, J\\\"urgen Kl\\\"uners","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-15T12:33:07Z","title":"Computation of Galois groups of rational polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3588","kind":"arxiv","version":2},"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:9fb2b0ca610b010dd38a1a6accd2a9d67d35db3f20f13c2ca08d4f203cb2ffca","target":"record","created_at":"2026-05-17T23:53:18Z","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":"c051e4fda6bb5867300437830889fea6bab688a08ccb4aeed91091e1cfdab2d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-15T12:33:07Z","title_canon_sha256":"6f1db90abd191c2d0810cfa088a7a6983d5c447262025525db1a5483d6466d63"},"schema_version":"1.0","source":{"id":"1211.3588","kind":"arxiv","version":2}},"canonical_sha256":"52d075b00e5bb781845bcbebbb63017e83326ea43ae3544cf90afb2b09ae4116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d075b00e5bb781845bcbebbb63017e83326ea43ae3544cf90afb2b09ae4116","first_computed_at":"2026-05-17T23:53:18.297093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:18.297093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KavUmfFa6j96uFR6ZG1HXk1jWkqk68i26bnbcOWJXT/D7lG9O70yGl7/M864MkQVQYDrZ1QGA65O6hKR79pyCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:18.297693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fb2b0ca610b010dd38a1a6accd2a9d67d35db3f20f13c2ca08d4f203cb2ffca","sha256:be6904a08cdbff7b2cbbc65388366be24b5287dde8d8fe6565237b99bab99ec7"],"state_sha256":"54dce2939b95d8676f04a89e7935dfb4aa19eb522fedde10302a9a0144c9db78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49K98kEvaEIE3uxB5PuK4rqFopD+SMIY8S1c3eKL/QE2H1wIQNzM3ji4FD/oDZ0wknNIIGK2ABgc0Nm2nuugCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:12:02.855534Z","bundle_sha256":"a9bdaf7bf53e8bf8599c7ae8229cf11e2b4bef05781bcb446bcb4822e5bfb5ed"}}