{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JRABTQLNYWFVIRZIDUHES5F3QD","short_pith_number":"pith:JRABTQLN","canonical_record":{"source":{"id":"1412.3350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T16:00:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"93bbd69184b8f32cd72d1ed07113aa868b49d1c7cc9fe0a4fdb1c49b6d631de0","abstract_canon_sha256":"8550bebab46d7861ed99517c547371e1118cf859fec1146f454f7140ae153b94"},"schema_version":"1.0"},"canonical_sha256":"4c4019c16dc58b5447281d0e4974bb80c6713b0de01cbd0adeca618068498f85","source":{"kind":"arxiv","id":"1412.3350","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3350","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3350v2","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3350","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"JRABTQLNYWFV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JRABTQLNYWFVIRZI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JRABTQLN","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JRABTQLNYWFVIRZIDUHES5F3QD","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T16:00:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"93bbd69184b8f32cd72d1ed07113aa868b49d1c7cc9fe0a4fdb1c49b6d631de0","abstract_canon_sha256":"8550bebab46d7861ed99517c547371e1118cf859fec1146f454f7140ae153b94"},"schema_version":"1.0"},"canonical_sha256":"4c4019c16dc58b5447281d0e4974bb80c6713b0de01cbd0adeca618068498f85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:08.091690Z","signature_b64":"CxEwVxXrGKNDP/tR7ozoGGPpRjhRoYoFSxnwPKbk/CXC52w76VOGecOJ4i8Dwnl3xKd8oTfRuQQuqBhyshibCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c4019c16dc58b5447281d0e4974bb80c6713b0de01cbd0adeca618068498f85","last_reissued_at":"2026-05-18T02:02:08.091064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:08.091064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3350","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-18T02:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y+FzlD03ujABb57UnphbgU6M5JjhRnDFpp8YyGZehjEPBBpuN19g0taPU9jzYlgN9yo4qwpYEZFo9VlhkybBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:39:35.092442Z"},"content_sha256":"723762e8e2fcccb62b912870ea4f1842fdcef1ae4026b89d727b19a2a352bafa","schema_version":"1.0","event_id":"sha256:723762e8e2fcccb62b912870ea4f1842fdcef1ae4026b89d727b19a2a352bafa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JRABTQLNYWFVIRZIDUHES5F3QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A counterexample to the pseudo 2-factor isomorphic graph conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur","submitted_at":"2014-12-10T16:00:47Z","abstract_excerpt":"A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs (Abreu et al., Journal of Combinatorial Theory, Series B, 2008, Conjecture 3.6).\n  Using a computer search we show that this conjecture is false by constructing a counterexample with 30 vertices. We also show that this is the only counterexample up to at least 40 vertices.\n  A graph $G$ is 2-fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3350","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-18T02:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbsQmu/QzNmNZOIlfeZ1Ry19F446Uv96lt1+Y/K0NUXfYQxS1C7Ie8VFkRC9VjRvjU9G3kpXl1Qu1yeEN1KPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:39:35.092959Z"},"content_sha256":"67d71da4ef7591f607dfe7b31202f4ef29eb6773d5d2685a5c3eb6718e12928c","schema_version":"1.0","event_id":"sha256:67d71da4ef7591f607dfe7b31202f4ef29eb6773d5d2685a5c3eb6718e12928c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRABTQLNYWFVIRZIDUHES5F3QD/bundle.json","state_url":"https://pith.science/pith/JRABTQLNYWFVIRZIDUHES5F3QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRABTQLNYWFVIRZIDUHES5F3QD/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-30T19:39:35Z","links":{"resolver":"https://pith.science/pith/JRABTQLNYWFVIRZIDUHES5F3QD","bundle":"https://pith.science/pith/JRABTQLNYWFVIRZIDUHES5F3QD/bundle.json","state":"https://pith.science/pith/JRABTQLNYWFVIRZIDUHES5F3QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRABTQLNYWFVIRZIDUHES5F3QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JRABTQLNYWFVIRZIDUHES5F3QD","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":"8550bebab46d7861ed99517c547371e1118cf859fec1146f454f7140ae153b94","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T16:00:47Z","title_canon_sha256":"93bbd69184b8f32cd72d1ed07113aa868b49d1c7cc9fe0a4fdb1c49b6d631de0"},"schema_version":"1.0","source":{"id":"1412.3350","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3350","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3350v2","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3350","created_at":"2026-05-18T02:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"JRABTQLNYWFV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JRABTQLNYWFVIRZI","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JRABTQLN","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:67d71da4ef7591f607dfe7b31202f4ef29eb6773d5d2685a5c3eb6718e12928c","target":"graph","created_at":"2026-05-18T02:02:08Z","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":"A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs (Abreu et al., Journal of Combinatorial Theory, Series B, 2008, Conjecture 3.6).\n  Using a computer search we show that this conjecture is false by constructing a counterexample with 30 vertices. We also show that this is the only counterexample up to at least 40 vertices.\n  A graph $G$ is 2-fac","authors_text":"Jan Goedgebeur","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T16:00:47Z","title":"A counterexample to the pseudo 2-factor isomorphic graph conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3350","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:723762e8e2fcccb62b912870ea4f1842fdcef1ae4026b89d727b19a2a352bafa","target":"record","created_at":"2026-05-18T02:02:08Z","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":"8550bebab46d7861ed99517c547371e1118cf859fec1146f454f7140ae153b94","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T16:00:47Z","title_canon_sha256":"93bbd69184b8f32cd72d1ed07113aa868b49d1c7cc9fe0a4fdb1c49b6d631de0"},"schema_version":"1.0","source":{"id":"1412.3350","kind":"arxiv","version":2}},"canonical_sha256":"4c4019c16dc58b5447281d0e4974bb80c6713b0de01cbd0adeca618068498f85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c4019c16dc58b5447281d0e4974bb80c6713b0de01cbd0adeca618068498f85","first_computed_at":"2026-05-18T02:02:08.091064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:08.091064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CxEwVxXrGKNDP/tR7ozoGGPpRjhRoYoFSxnwPKbk/CXC52w76VOGecOJ4i8Dwnl3xKd8oTfRuQQuqBhyshibCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:08.091690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3350","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:723762e8e2fcccb62b912870ea4f1842fdcef1ae4026b89d727b19a2a352bafa","sha256:67d71da4ef7591f607dfe7b31202f4ef29eb6773d5d2685a5c3eb6718e12928c"],"state_sha256":"c455c7e60691fc455483cfbdeeda81c4da5a1672e256fea740010ae5ba3eee6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnAJ0MRww+5UIaR/+lLIcDwbNT5fLVB1Y6eOHnhbVVlTw0OlL02gvVAMuQmvYRJnxDY1UcgsdDXr3/9jyU8rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:39:35.096443Z","bundle_sha256":"33a9564ae478898c6a3d075c97eadfb62015606e69acdea4ef49597e7cf17b73"}}