{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IQT5E4BU4KO24RENO3HFII6FDJ","short_pith_number":"pith:IQT5E4BU","canonical_record":{"source":{"id":"1303.0963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-03-05T09:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"a9415167b504a87afd6e1a3829241f0e2a994a9aa8ce063b6a57486f6ee7fa6e","abstract_canon_sha256":"f58ec0aa35a9def143e209f41270caa09c6370cf141e64c178426448e58db83f"},"schema_version":"1.0"},"canonical_sha256":"4427d27034e29dae448d76ce5423c51a4a212c8f895a50132e004a77a8786f4e","source":{"kind":"arxiv","id":"1303.0963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0963","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0963v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0963","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"IQT5E4BU4KO2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IQT5E4BU4KO24REN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IQT5E4BU","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IQT5E4BU4KO24RENO3HFII6FDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-03-05T09:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"a9415167b504a87afd6e1a3829241f0e2a994a9aa8ce063b6a57486f6ee7fa6e","abstract_canon_sha256":"f58ec0aa35a9def143e209f41270caa09c6370cf141e64c178426448e58db83f"},"schema_version":"1.0"},"canonical_sha256":"4427d27034e29dae448d76ce5423c51a4a212c8f895a50132e004a77a8786f4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:53.333563Z","signature_b64":"CIk19/WSznxXJqai5YbOo1UUg9oKy+W0m/0GObFTmBhXqGnuufy2MRgPh0SmaXP5qRWr8vD04nHxbHC6F45fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4427d27034e29dae448d76ce5423c51a4a212c8f895a50132e004a77a8786f4e","last_reissued_at":"2026-05-18T03:31:53.333058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:53.333058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0963","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-18T03:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPf5/PE4246eiegRWcxqos0VTbKZgegFaA/rPYxmh8Yt6h81KGfhp5hfdnnquLzUSKflUkOZzXZfnfue3sG9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:07:22.348325Z"},"content_sha256":"d07261f858b8a1c89f77762627be810ffe9f1366c508e536da39592591704c0e","schema_version":"1.0","event_id":"sha256:d07261f858b8a1c89f77762627be810ffe9f1366c508e536da39592591704c0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IQT5E4BU4KO24RENO3HFII6FDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"G-complete reducibility in non-connected groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Benjamin Martin, Gerhard Roehrle, Michael Bate, Sebastian Herpel","submitted_at":"2013-03-05T09:35:36Z","abstract_excerpt":"In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup of G^0 is G^0 -cr. This essentially reduces the problem of determining G-complete reducibility to the connected case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0963","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-18T03:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjw3Q8v1YczuikE/fn2/deP7oaJyywl2pTmdyuscqPumYtn8P/0v4dgpF3GrW+IjpzUmxb/Jmmk1L8P6Xrs2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:07:22.348680Z"},"content_sha256":"274dde75557f022d3eca96f72d0af966b3d3ff1771b3372e34d3335ceca8ffbd","schema_version":"1.0","event_id":"sha256:274dde75557f022d3eca96f72d0af966b3d3ff1771b3372e34d3335ceca8ffbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQT5E4BU4KO24RENO3HFII6FDJ/bundle.json","state_url":"https://pith.science/pith/IQT5E4BU4KO24RENO3HFII6FDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQT5E4BU4KO24RENO3HFII6FDJ/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-28T11:07:22Z","links":{"resolver":"https://pith.science/pith/IQT5E4BU4KO24RENO3HFII6FDJ","bundle":"https://pith.science/pith/IQT5E4BU4KO24RENO3HFII6FDJ/bundle.json","state":"https://pith.science/pith/IQT5E4BU4KO24RENO3HFII6FDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQT5E4BU4KO24RENO3HFII6FDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IQT5E4BU4KO24RENO3HFII6FDJ","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":"f58ec0aa35a9def143e209f41270caa09c6370cf141e64c178426448e58db83f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-03-05T09:35:36Z","title_canon_sha256":"a9415167b504a87afd6e1a3829241f0e2a994a9aa8ce063b6a57486f6ee7fa6e"},"schema_version":"1.0","source":{"id":"1303.0963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0963","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0963v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0963","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"IQT5E4BU4KO2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IQT5E4BU4KO24REN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IQT5E4BU","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:274dde75557f022d3eca96f72d0af966b3d3ff1771b3372e34d3335ceca8ffbd","target":"graph","created_at":"2026-05-18T03:31:53Z","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":"In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup of G^0 is G^0 -cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.","authors_text":"Benjamin Martin, Gerhard Roehrle, Michael Bate, Sebastian Herpel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-03-05T09:35:36Z","title":"G-complete reducibility in non-connected groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0963","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:d07261f858b8a1c89f77762627be810ffe9f1366c508e536da39592591704c0e","target":"record","created_at":"2026-05-18T03:31:53Z","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":"f58ec0aa35a9def143e209f41270caa09c6370cf141e64c178426448e58db83f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-03-05T09:35:36Z","title_canon_sha256":"a9415167b504a87afd6e1a3829241f0e2a994a9aa8ce063b6a57486f6ee7fa6e"},"schema_version":"1.0","source":{"id":"1303.0963","kind":"arxiv","version":1}},"canonical_sha256":"4427d27034e29dae448d76ce5423c51a4a212c8f895a50132e004a77a8786f4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4427d27034e29dae448d76ce5423c51a4a212c8f895a50132e004a77a8786f4e","first_computed_at":"2026-05-18T03:31:53.333058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:53.333058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIk19/WSznxXJqai5YbOo1UUg9oKy+W0m/0GObFTmBhXqGnuufy2MRgPh0SmaXP5qRWr8vD04nHxbHC6F45fDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:53.333563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d07261f858b8a1c89f77762627be810ffe9f1366c508e536da39592591704c0e","sha256:274dde75557f022d3eca96f72d0af966b3d3ff1771b3372e34d3335ceca8ffbd"],"state_sha256":"e56a7ac7404ac5f61b763d70827860841c0b53edd75d22988c1416a5e2558552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMysPwPu3W30VW6hyjUFvgZggvfOMzwo6LajQrFdWTasnwp80AiRTODf2FmJSuy0OiqqgXYnPrnaliofznXKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:07:22.350650Z","bundle_sha256":"e6e3fb0bf1ee6133632400e7b68f12d222e5e4967b893fba57fd472c0e623523"}}