{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CYIL5DTFIFMWGAXPXGCBGM4MOZ","short_pith_number":"pith:CYIL5DTF","canonical_record":{"source":{"id":"1905.04551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-11T16:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"11751cb0109b2bbdcd7b1bb4cf63adf114303bd2ae7fe2903081dafb48375b25","abstract_canon_sha256":"f7f3413ca256513135b666980c057f73ca5bf03f0b57cd2f84fb199c489e8b3b"},"schema_version":"1.0"},"canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","source":{"kind":"arxiv","id":"1905.04551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04551","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04551v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04551","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"CYIL5DTFIFMW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CYIL5DTFIFMWGAXP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CYIL5DTF","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CYIL5DTFIFMWGAXPXGCBGM4MOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-11T16:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"11751cb0109b2bbdcd7b1bb4cf63adf114303bd2ae7fe2903081dafb48375b25","abstract_canon_sha256":"f7f3413ca256513135b666980c057f73ca5bf03f0b57cd2f84fb199c489e8b3b"},"schema_version":"1.0"},"canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.417776Z","signature_b64":"szz6vQxQcm6pEzlf2mbAiB3co6I9lCew0yL1+x7wVd5n0nrU/Y4llJNlhzXdHFlhdjQL67jlz9sxCd19RamEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","last_reissued_at":"2026-05-17T23:46:24.417002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.417002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04551","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2KnxsSkQ+iIfQjJRVR0WOKOXFT6I+iXy/R5oPuTxcVp86+hI7eFJ3YHQeNsmx3Eax0huviWlKGOgxrajdc1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:08.472459Z"},"content_sha256":"fae5fa55062325a2e45223f6da8e1ddcf9d7a28acb17cf70899571d67d24f1e0","schema_version":"1.0","event_id":"sha256:fae5fa55062325a2e45223f6da8e1ddcf9d7a28acb17cf70899571d67d24f1e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CYIL5DTFIFMWGAXPXGCBGM4MOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Pseudo-Matchings in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behrooz Bagheri Gh., Benedikt Klocker, Herbert Fleischner","submitted_at":"2019-05-11T16:51:50Z","abstract_excerpt":"A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3.\n  In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings since G-E(C) is a perfect pseudo-matching.\n  Of special interest are such M where the graph G/M is planar because such G have a cycle double cover. We show that various well known classes of snarks contain planarizing perfect pseudo-matchings, and that there are at least as many snarks with planarizing perfect pseudo-matchings as there are cyclically 5-edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04551","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45+LoDVXf7vA0n6bmyMmDd9J13SxaLOn47va0mXlBDaZvIhNI/i6lNsPCVu2QbaEiqm0u0qhVFTzPVbw85vqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:08.473075Z"},"content_sha256":"bfd2355b38c8e0b6efebc5a7de729e877194e53af719bbfc6caa63895236c328","schema_version":"1.0","event_id":"sha256:bfd2355b38c8e0b6efebc5a7de729e877194e53af719bbfc6caa63895236c328"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/bundle.json","state_url":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/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-25T10:07:08Z","links":{"resolver":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ","bundle":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/bundle.json","state":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CYIL5DTFIFMWGAXPXGCBGM4MOZ","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":"f7f3413ca256513135b666980c057f73ca5bf03f0b57cd2f84fb199c489e8b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-11T16:51:50Z","title_canon_sha256":"11751cb0109b2bbdcd7b1bb4cf63adf114303bd2ae7fe2903081dafb48375b25"},"schema_version":"1.0","source":{"id":"1905.04551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04551","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04551v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04551","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"CYIL5DTFIFMW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CYIL5DTFIFMWGAXP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CYIL5DTF","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:bfd2355b38c8e0b6efebc5a7de729e877194e53af719bbfc6caa63895236c328","target":"graph","created_at":"2026-05-17T23:46:24Z","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 perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3.\n  In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings since G-E(C) is a perfect pseudo-matching.\n  Of special interest are such M where the graph G/M is planar because such G have a cycle double cover. We show that various well known classes of snarks contain planarizing perfect pseudo-matchings, and that there are at least as many snarks with planarizing perfect pseudo-matchings as there are cyclically 5-edge","authors_text":"Behrooz Bagheri Gh., Benedikt Klocker, Herbert Fleischner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-11T16:51:50Z","title":"Perfect Pseudo-Matchings in cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04551","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:fae5fa55062325a2e45223f6da8e1ddcf9d7a28acb17cf70899571d67d24f1e0","target":"record","created_at":"2026-05-17T23:46:24Z","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":"f7f3413ca256513135b666980c057f73ca5bf03f0b57cd2f84fb199c489e8b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-11T16:51:50Z","title_canon_sha256":"11751cb0109b2bbdcd7b1bb4cf63adf114303bd2ae7fe2903081dafb48375b25"},"schema_version":"1.0","source":{"id":"1905.04551","kind":"arxiv","version":1}},"canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","first_computed_at":"2026-05-17T23:46:24.417002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.417002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szz6vQxQcm6pEzlf2mbAiB3co6I9lCew0yL1+x7wVd5n0nrU/Y4llJNlhzXdHFlhdjQL67jlz9sxCd19RamEDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.417776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae5fa55062325a2e45223f6da8e1ddcf9d7a28acb17cf70899571d67d24f1e0","sha256:bfd2355b38c8e0b6efebc5a7de729e877194e53af719bbfc6caa63895236c328"],"state_sha256":"62c4d4661bd150797a52438ad91fe6cef749efa811dbe230a96e24883ab0f4b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtaWZACUnTIOMP3onEA7g7fttkJMrh79VSmtDWyxqbYkreD+VRK3X79BNHGWCJq+eFecI2BvgXRB6QhHYQePAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:07:08.477072Z","bundle_sha256":"aadb529d57b3073fd3e20f0a54287f8fe502026dabefee78db7916aa40b0bcb4"}}