{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IZIWNA2R7LOKRJWQP7ER7ZWJRI","short_pith_number":"pith:IZIWNA2R","schema_version":"1.0","canonical_sha256":"4651668351fadca8a6d07fc91fe6c98a1cf9d76566e552c747af9fc4b0636420","source":{"kind":"arxiv","id":"1210.3930","version":1},"attestation_state":"computed","paper":{"title":"Covering cubic graphs with matchings of large size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo, Simona Bonvicini","submitted_at":"2012-10-15T07:55:20Z","abstract_excerpt":"Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called excessive [m]-index of G in literature. The case m=n, that is a covering with perfect matchings, is known to be strictly related to an outstanding conjecture of Berge and Fulkerson. In this paper we study in some details the case m=n-1. We show how this parameter can be large for cubic graphs with low connectivity and we furnish some evidence that each cyclically 4-connected cubic graph of order 2n has ex"},"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":"1210.3930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-15T07:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"5a917a876acfe72f9020f56892c3c7d54d58b680b9ac058ea71def6c8ca89fbf","abstract_canon_sha256":"01707e5ab479472e9925dc70dfb200e211f39f46fc5561663f4bd6fcaebe1f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:16.728258Z","signature_b64":"1MXtuxQSFTqJZNqDbo67Ie0LBW266m8g9oyTVyDBQnspFxLLwg2ZPlPQ69Waok4hc93C2L01rmT3t2oMSxsDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4651668351fadca8a6d07fc91fe6c98a1cf9d76566e552c747af9fc4b0636420","last_reissued_at":"2026-05-18T03:43:16.727650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:16.727650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering cubic graphs with matchings of large size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo, Simona Bonvicini","submitted_at":"2012-10-15T07:55:20Z","abstract_excerpt":"Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called excessive [m]-index of G in literature. The case m=n, that is a covering with perfect matchings, is known to be strictly related to an outstanding conjecture of Berge and Fulkerson. In this paper we study in some details the case m=n-1. We show how this parameter can be large for cubic graphs with low connectivity and we furnish some evidence that each cyclically 4-connected cubic graph of order 2n has ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3930","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":"1210.3930","created_at":"2026-05-18T03:43:16.727771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3930v1","created_at":"2026-05-18T03:43:16.727771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3930","created_at":"2026-05-18T03:43:16.727771+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZIWNA2R7LOK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZIWNA2R7LOKRJWQ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZIWNA2R","created_at":"2026-05-18T12:27:09.501522+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/IZIWNA2R7LOKRJWQP7ER7ZWJRI","json":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI.json","graph_json":"https://pith.science/api/pith-number/IZIWNA2R7LOKRJWQP7ER7ZWJRI/graph.json","events_json":"https://pith.science/api/pith-number/IZIWNA2R7LOKRJWQP7ER7ZWJRI/events.json","paper":"https://pith.science/paper/IZIWNA2R"},"agent_actions":{"view_html":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI","download_json":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI.json","view_paper":"https://pith.science/paper/IZIWNA2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3930&json=true","fetch_graph":"https://pith.science/api/pith-number/IZIWNA2R7LOKRJWQP7ER7ZWJRI/graph.json","fetch_events":"https://pith.science/api/pith-number/IZIWNA2R7LOKRJWQP7ER7ZWJRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI/action/storage_attestation","attest_author":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI/action/author_attestation","sign_citation":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI/action/citation_signature","submit_replication":"https://pith.science/pith/IZIWNA2R7LOKRJWQP7ER7ZWJRI/action/replication_record"}},"created_at":"2026-05-18T03:43:16.727771+00:00","updated_at":"2026-05-18T03:43:16.727771+00:00"}