{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KN2BRQY5TQ6JC5Z2RLMKRPI6BX","short_pith_number":"pith:KN2BRQY5","schema_version":"1.0","canonical_sha256":"537418c31d9c3c91773a8ad8a8bd1e0de1dc67638bc611e1b032a6f4763a7bbb","source":{"kind":"arxiv","id":"2402.08538","version":2},"attestation_state":"computed","paper":{"title":"Cubic graphs with edges in exactly one perfect matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Davide Mattiolo, Giuseppe Mazzuoccolo, Isaak H. Wolf, Jan Goedgebeur, Jarne Renders","submitted_at":"2024-02-13T15:43:14Z","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"},"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":"2402.08538","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-13T15:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"9e18488604c1c6b4867faab04622edfc59ce9147b9ce12c019b2a2554464e221","abstract_canon_sha256":"59ca2082b89d428a218ce335f9a9fdd606ed569579e2373d282dce7ffeae89da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:40.195352Z","signature_b64":"UNf1zhQumCu1y7AyJmrUHmq+VXvVw+Q7lI9iIUYnWmh8sx6WsYFDT0ri7zJolSs6jivBqSvNHKyKPw5zqMeEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"537418c31d9c3c91773a8ad8a8bd1e0de1dc67638bc611e1b032a6f4763a7bbb","last_reissued_at":"2026-07-05T09:20:40.194855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:40.194855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic graphs with edges in exactly one perfect matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Davide Mattiolo, Giuseppe Mazzuoccolo, Isaak H. Wolf, Jan Goedgebeur, Jarne Renders","submitted_at":"2024-02-13T15:43:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08538","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.08538/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.08538","created_at":"2026-07-05T09:20:40.194913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08538v2","created_at":"2026-07-05T09:20:40.194913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08538","created_at":"2026-07-05T09:20:40.194913+00:00"},{"alias_kind":"pith_short_12","alias_value":"KN2BRQY5TQ6J","created_at":"2026-07-05T09:20:40.194913+00:00"},{"alias_kind":"pith_short_16","alias_value":"KN2BRQY5TQ6JC5Z2","created_at":"2026-07-05T09:20:40.194913+00:00"},{"alias_kind":"pith_short_8","alias_value":"KN2BRQY5","created_at":"2026-07-05T09:20:40.194913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02794","citing_title":"Edge-Efficient Image Restoration: Transformer Distillation into State-Space Models","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX","json":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX.json","graph_json":"https://pith.science/api/pith-number/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/graph.json","events_json":"https://pith.science/api/pith-number/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/events.json","paper":"https://pith.science/paper/KN2BRQY5"},"agent_actions":{"view_html":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX","download_json":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX.json","view_paper":"https://pith.science/paper/KN2BRQY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08538&json=true","fetch_graph":"https://pith.science/api/pith-number/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/graph.json","fetch_events":"https://pith.science/api/pith-number/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/action/storage_attestation","attest_author":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/action/author_attestation","sign_citation":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/action/citation_signature","submit_replication":"https://pith.science/pith/KN2BRQY5TQ6JC5Z2RLMKRPI6BX/action/replication_record"}},"created_at":"2026-07-05T09:20:40.194913+00:00","updated_at":"2026-07-05T09:20:40.194913+00:00"}