{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KN2BRQY5TQ6JC5Z2RLMKRPI6BX","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":"59ca2082b89d428a218ce335f9a9fdd606ed569579e2373d282dce7ffeae89da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-13T15:43:14Z","title_canon_sha256":"9e18488604c1c6b4867faab04622edfc59ce9147b9ce12c019b2a2554464e221"},"schema_version":"1.0","source":{"id":"2402.08538","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08538","created_at":"2026-07-05T09:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08538v2","created_at":"2026-07-05T09:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08538","created_at":"2026-07-05T09:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"KN2BRQY5TQ6J","created_at":"2026-07-05T09:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"KN2BRQY5TQ6JC5Z2","created_at":"2026-07-05T09:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"KN2BRQY5","created_at":"2026-07-05T09:20:40Z"}],"graph_snapshots":[{"event_id":"sha256:baa8f5e3b5d01d8a8be4e188a1c6101cea0049bf7aa507839880ab818e5eee05","target":"graph","created_at":"2026-07-05T09:20:40Z","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/2402.08538/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every edge belongs to at least two distinct perfect matchings. In this paper, we study the class of non-double covered cubic graphs, i.e.\\ graphs having an edge, called lonely edge, which belongs to exactly one perfect matching. First of all, we provide a reduction of the problem to the subclass $\\cal U$ of $3$-connected cubic graphs. Then, we furnish an inductive","authors_text":"Davide Mattiolo, Giuseppe Mazzuoccolo, Isaak H. Wolf, Jan Goedgebeur, Jarne Renders","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-13T15:43:14Z","title":"Cubic graphs with edges in exactly one perfect matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08538","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:acbf9378d905737d7a0452079346a6e0dd15b40f19e543fd699d27cfd283725a","target":"record","created_at":"2026-07-05T09:20:40Z","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":"59ca2082b89d428a218ce335f9a9fdd606ed569579e2373d282dce7ffeae89da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-13T15:43:14Z","title_canon_sha256":"9e18488604c1c6b4867faab04622edfc59ce9147b9ce12c019b2a2554464e221"},"schema_version":"1.0","source":{"id":"2402.08538","kind":"arxiv","version":2}},"canonical_sha256":"537418c31d9c3c91773a8ad8a8bd1e0de1dc67638bc611e1b032a6f4763a7bbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"537418c31d9c3c91773a8ad8a8bd1e0de1dc67638bc611e1b032a6f4763a7bbb","first_computed_at":"2026-07-05T09:20:40.194855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:40.194855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UNf1zhQumCu1y7AyJmrUHmq+VXvVw+Q7lI9iIUYnWmh8sx6WsYFDT0ri7zJolSs6jivBqSvNHKyKPw5zqMeEAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:40.195352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.08538","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acbf9378d905737d7a0452079346a6e0dd15b40f19e543fd699d27cfd283725a","sha256:baa8f5e3b5d01d8a8be4e188a1c6101cea0049bf7aa507839880ab818e5eee05"],"state_sha256":"3b5ad2d658c6b2b5a69358d5a2a02206f963116c6b8d716468f756c19f096dc5"}