{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CYIL5DTFIFMWGAXPXGCBGM4MOZ","short_pith_number":"pith:CYIL5DTF","schema_version":"1.0","canonical_sha256":"1610be8e6541596302efb98413338c7649a697c04863f8dcd5474e94ce285485","source":{"kind":"arxiv","id":"1905.04551","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.04551","created_at":"2026-05-17T23:46:24.417135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04551v1","created_at":"2026-05-17T23:46:24.417135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04551","created_at":"2026-05-17T23:46:24.417135+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYIL5DTFIFMW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYIL5DTFIFMWGAXP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYIL5DTF","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ","json":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ.json","graph_json":"https://pith.science/api/pith-number/CYIL5DTFIFMWGAXPXGCBGM4MOZ/graph.json","events_json":"https://pith.science/api/pith-number/CYIL5DTFIFMWGAXPXGCBGM4MOZ/events.json","paper":"https://pith.science/paper/CYIL5DTF"},"agent_actions":{"view_html":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ","download_json":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ.json","view_paper":"https://pith.science/paper/CYIL5DTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04551&json=true","fetch_graph":"https://pith.science/api/pith-number/CYIL5DTFIFMWGAXPXGCBGM4MOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CYIL5DTFIFMWGAXPXGCBGM4MOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/action/storage_attestation","attest_author":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/action/author_attestation","sign_citation":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/action/citation_signature","submit_replication":"https://pith.science/pith/CYIL5DTFIFMWGAXPXGCBGM4MOZ/action/replication_record"}},"created_at":"2026-05-17T23:46:24.417135+00:00","updated_at":"2026-05-17T23:46:24.417135+00:00"}