{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MRA7ZOOY6KN7LW6YUUCCOE5KBK","short_pith_number":"pith:MRA7ZOOY","schema_version":"1.0","canonical_sha256":"6441fcb9d8f29bf5dbd8a5042713aa0aa90ccba7985a6bd5ce2ec0cde2d59ec1","source":{"kind":"arxiv","id":"1301.1521","version":2},"attestation_state":"computed","paper":{"title":"On the excessive [m]-index of a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo","submitted_at":"2013-01-08T13:24:41Z","abstract_excerpt":"The excessive [m]-index of a graph G is the minimum number of matchings of size m needed to cover the edge-set of G. We call a graph G [m]-coverable if its excessive [m]-index is finite. Obviously the excessive [1]-index is |E(G)| for all graphs and it is an easy task the computation of the excessive [2]-index for a [2]-coverable graph. The case m=3 is completely solved by Cariolaro and Fu in 2009. In this paper we prove a general formula to compute the excessive [4]-index of a tree and we conjecture a possible generalization for any value of m. Furthermore, we prove that such a formula does n"},"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":"1301.1521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-08T13:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"336b01b241c9ffc3f8f744bf555875aada66ebcb329547866ebef55923709944","abstract_canon_sha256":"32733fc27fb56d40cd5f23c21c303a415a9eb6560987e18e7f0a5cfc2dc73ee9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:45.378070Z","signature_b64":"no6lWz4dD6iETn5zyDaMGjq1sD9emQV/FWOF2HBwe1rKEfpnSmr981dMqazfexKIE31gGR+hBWgkZpm7INp7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6441fcb9d8f29bf5dbd8a5042713aa0aa90ccba7985a6bd5ce2ec0cde2d59ec1","last_reissued_at":"2026-05-18T03:21:45.377294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:45.377294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the excessive [m]-index of a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo","submitted_at":"2013-01-08T13:24:41Z","abstract_excerpt":"The excessive [m]-index of a graph G is the minimum number of matchings of size m needed to cover the edge-set of G. We call a graph G [m]-coverable if its excessive [m]-index is finite. Obviously the excessive [1]-index is |E(G)| for all graphs and it is an easy task the computation of the excessive [2]-index for a [2]-coverable graph. The case m=3 is completely solved by Cariolaro and Fu in 2009. In this paper we prove a general formula to compute the excessive [4]-index of a tree and we conjecture a possible generalization for any value of m. Furthermore, we prove that such a formula does n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1521","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":""},"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":"1301.1521","created_at":"2026-05-18T03:21:45.377468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1521v2","created_at":"2026-05-18T03:21:45.377468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1521","created_at":"2026-05-18T03:21:45.377468+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRA7ZOOY6KN7","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRA7ZOOY6KN7LW6Y","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRA7ZOOY","created_at":"2026-05-18T12:27:52.871228+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/MRA7ZOOY6KN7LW6YUUCCOE5KBK","json":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK.json","graph_json":"https://pith.science/api/pith-number/MRA7ZOOY6KN7LW6YUUCCOE5KBK/graph.json","events_json":"https://pith.science/api/pith-number/MRA7ZOOY6KN7LW6YUUCCOE5KBK/events.json","paper":"https://pith.science/paper/MRA7ZOOY"},"agent_actions":{"view_html":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK","download_json":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK.json","view_paper":"https://pith.science/paper/MRA7ZOOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1521&json=true","fetch_graph":"https://pith.science/api/pith-number/MRA7ZOOY6KN7LW6YUUCCOE5KBK/graph.json","fetch_events":"https://pith.science/api/pith-number/MRA7ZOOY6KN7LW6YUUCCOE5KBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK/action/storage_attestation","attest_author":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK/action/author_attestation","sign_citation":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK/action/citation_signature","submit_replication":"https://pith.science/pith/MRA7ZOOY6KN7LW6YUUCCOE5KBK/action/replication_record"}},"created_at":"2026-05-18T03:21:45.377468+00:00","updated_at":"2026-05-18T03:21:45.377468+00:00"}