{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WVKP2H32TQSFLMIST7RVOOOABM","short_pith_number":"pith:WVKP2H32","canonical_record":{"source":{"id":"2606.23826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"ab48fb61d67a5047a78f2d47218c74eb60d5d04ad82686d1d0c43fec8e6f99de","abstract_canon_sha256":"79a78e2c72ed13b72a7175578976c8c1fc4c7e7b3d3dc5fe726b09a134e9a635"},"schema_version":"1.0"},"canonical_sha256":"b554fd1f7a9c2455b1129fe35739c00b0c7e571cd7cf35ef6b8b042f0ba7c962","source":{"kind":"arxiv","id":"2606.23826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23826","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23826v1","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23826","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"WVKP2H32TQSF","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"WVKP2H32TQSFLMIS","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"WVKP2H32","created_at":"2026-06-24T00:14:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WVKP2H32TQSFLMIST7RVOOOABM","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"ab48fb61d67a5047a78f2d47218c74eb60d5d04ad82686d1d0c43fec8e6f99de","abstract_canon_sha256":"79a78e2c72ed13b72a7175578976c8c1fc4c7e7b3d3dc5fe726b09a134e9a635"},"schema_version":"1.0"},"canonical_sha256":"b554fd1f7a9c2455b1129fe35739c00b0c7e571cd7cf35ef6b8b042f0ba7c962","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:27.994755Z","signature_b64":"RbBdFCWA4szpOr7BZaY7y7W/KtMTwmX6B8uwvNh+Vn+dyAEKnGMvJzncF/tegg5slPKKtv8YzSUqgVXiZGfuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b554fd1f7a9c2455b1129fe35739c00b0c7e571cd7cf35ef6b8b042f0ba7c962","last_reissued_at":"2026-06-24T00:14:27.994368Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:27.994368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23826","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-06-24T00:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+yOh8ebIY8XTDjQ4t4ObJn/RIiFaf+pS1JNJiAOsrlthaHjHUoYGoPS7iajHGyVTH4E4SSgFItwNFXxrZjEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T07:53:41.562056Z"},"content_sha256":"0a932cced142271d79c96ca38a02302c3707104726ae089539e74c067d66213c","schema_version":"1.0","event_id":"sha256:0a932cced142271d79c96ca38a02302c3707104726ae089539e74c067d66213c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WVKP2H32TQSFLMIST7RVOOOABM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The excluded minors for $\\mathsf{Z}_{3}$-gainable and regular biased graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daryl Funk, Dillon Mayhew, Nick Brettell, Rutger Campbell","submitted_at":"2026-06-22T18:10:44Z","abstract_excerpt":"We prove that a biased graph is gainable over the group $\\mathsf{Z}_{3}$ if and only if it contains no minor isomorphic to $(4K_{2},\\emptyset)$, $\\pm K_{3}$, or $-K_{4}$. We develop a theory of \"partial groups\" that is analogous to that of partial fields, and we use this theory to show that a biased graph is gainable over every non-trivial group if and only if it is gainable over $\\mathsf{Z}_{2}$ and $\\mathsf{Z}_{3}$. From this we derive an independent proof of the theorem due to Gerards that a biased graph is gainable over every non-trivial group if and only if it has no minor isomorphic to $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23826","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23826/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-24T00:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgOljGQ9OX1gwKUwngfYTaYdz/1s7c9vytDtl5jfZn81xBlcGcpgMvlpHwSEbC19tKWLQQ34SkuoR1jipvUjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T07:53:41.562612Z"},"content_sha256":"ded18498f4c12843bf77fe48f14b34d56272b9356c253510751d927bf074ddbe","schema_version":"1.0","event_id":"sha256:ded18498f4c12843bf77fe48f14b34d56272b9356c253510751d927bf074ddbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVKP2H32TQSFLMIST7RVOOOABM/bundle.json","state_url":"https://pith.science/pith/WVKP2H32TQSFLMIST7RVOOOABM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVKP2H32TQSFLMIST7RVOOOABM/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-08-22T07:53:41Z","links":{"resolver":"https://pith.science/pith/WVKP2H32TQSFLMIST7RVOOOABM","bundle":"https://pith.science/pith/WVKP2H32TQSFLMIST7RVOOOABM/bundle.json","state":"https://pith.science/pith/WVKP2H32TQSFLMIST7RVOOOABM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVKP2H32TQSFLMIST7RVOOOABM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WVKP2H32TQSFLMIST7RVOOOABM","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":"79a78e2c72ed13b72a7175578976c8c1fc4c7e7b3d3dc5fe726b09a134e9a635","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:10:44Z","title_canon_sha256":"ab48fb61d67a5047a78f2d47218c74eb60d5d04ad82686d1d0c43fec8e6f99de"},"schema_version":"1.0","source":{"id":"2606.23826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23826","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23826v1","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23826","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"WVKP2H32TQSF","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"WVKP2H32TQSFLMIS","created_at":"2026-06-24T00:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"WVKP2H32","created_at":"2026-06-24T00:14:27Z"}],"graph_snapshots":[{"event_id":"sha256:ded18498f4c12843bf77fe48f14b34d56272b9356c253510751d927bf074ddbe","target":"graph","created_at":"2026-06-24T00:14:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.23826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that a biased graph is gainable over the group $\\mathsf{Z}_{3}$ if and only if it contains no minor isomorphic to $(4K_{2},\\emptyset)$, $\\pm K_{3}$, or $-K_{4}$. We develop a theory of \"partial groups\" that is analogous to that of partial fields, and we use this theory to show that a biased graph is gainable over every non-trivial group if and only if it is gainable over $\\mathsf{Z}_{2}$ and $\\mathsf{Z}_{3}$. From this we derive an independent proof of the theorem due to Gerards that a biased graph is gainable over every non-trivial group if and only if it has no minor isomorphic to $","authors_text":"Daryl Funk, Dillon Mayhew, Nick Brettell, Rutger Campbell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:10:44Z","title":"The excluded minors for $\\mathsf{Z}_{3}$-gainable and regular biased graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23826","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:0a932cced142271d79c96ca38a02302c3707104726ae089539e74c067d66213c","target":"record","created_at":"2026-06-24T00:14:27Z","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":"79a78e2c72ed13b72a7175578976c8c1fc4c7e7b3d3dc5fe726b09a134e9a635","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:10:44Z","title_canon_sha256":"ab48fb61d67a5047a78f2d47218c74eb60d5d04ad82686d1d0c43fec8e6f99de"},"schema_version":"1.0","source":{"id":"2606.23826","kind":"arxiv","version":1}},"canonical_sha256":"b554fd1f7a9c2455b1129fe35739c00b0c7e571cd7cf35ef6b8b042f0ba7c962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b554fd1f7a9c2455b1129fe35739c00b0c7e571cd7cf35ef6b8b042f0ba7c962","first_computed_at":"2026-06-24T00:14:27.994368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T00:14:27.994368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RbBdFCWA4szpOr7BZaY7y7W/KtMTwmX6B8uwvNh+Vn+dyAEKnGMvJzncF/tegg5slPKKtv8YzSUqgVXiZGfuBA==","signature_status":"signed_v1","signed_at":"2026-06-24T00:14:27.994755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a932cced142271d79c96ca38a02302c3707104726ae089539e74c067d66213c","sha256:ded18498f4c12843bf77fe48f14b34d56272b9356c253510751d927bf074ddbe"],"state_sha256":"fbc2392cf6347b6e23c628ad96f9577bb4c5d463fcd93424928bfde5b6cfb111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1e3OVfJZajBkPj0NoWo5JF7ShFceMiPnJrmk0WrcdJP8LAPjBOnthFQYL0qmJmzkB0xmk9AQMrMIZ8e0Xy1aDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T07:53:41.567292Z","bundle_sha256":"ccd760abe20ab1b01d9560b6bba1500110050292fb8f5f9302a2a2397eadc658"}}