{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LQG62MC5B224RNTV5WRSWPSLNW","short_pith_number":"pith:LQG62MC5","canonical_record":{"source":{"id":"1305.4005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T08:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"5c2d107f3172830483f0e209c705b10fa23f5c612de8d01f8506d7b629bae21d","abstract_canon_sha256":"08c1fa76431a677d3320e3d9afbb2b35ab3d6eeb47302b6f38179ebd3cf71fec"},"schema_version":"1.0"},"canonical_sha256":"5c0ded305d0eb5c8b675eda32b3e4b6dbe5419bdd3b9458706eec2816bb2e352","source":{"kind":"arxiv","id":"1305.4005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4005","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4005v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4005","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"LQG62MC5B224","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQG62MC5B224RNTV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQG62MC5","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LQG62MC5B224RNTV5WRSWPSLNW","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T08:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"5c2d107f3172830483f0e209c705b10fa23f5c612de8d01f8506d7b629bae21d","abstract_canon_sha256":"08c1fa76431a677d3320e3d9afbb2b35ab3d6eeb47302b6f38179ebd3cf71fec"},"schema_version":"1.0"},"canonical_sha256":"5c0ded305d0eb5c8b675eda32b3e4b6dbe5419bdd3b9458706eec2816bb2e352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.591800Z","signature_b64":"ABLmuINT9wWbpZnRVVxyKtP2dhQvvP+1qOYTaV9JKeYXHbMRKpJ811zuEtmhQBeOG3O3Yy7FqsOjPM0TW2zvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c0ded305d0eb5c8b675eda32b3e4b6dbe5419bdd3b9458706eec2816bb2e352","last_reissued_at":"2026-05-18T03:25:26.591020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.591020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4005","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4fWwQBQiV2okvjYBWdBWUc/hfsbKAmI87rwnvnIXb9BkzPj76c3EcXRZ3yQVuSGs4eSXDL2iZ83f6evZTXvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:31:52.640819Z"},"content_sha256":"18d2f9966ce355a8b5fc80a8c13bec8aebe4575979fc0fd79e519fc006f28795","schema_version":"1.0","event_id":"sha256:18d2f9966ce355a8b5fc80a8c13bec8aebe4575979fc0fd79e519fc006f28795"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LQG62MC5B224RNTV5WRSWPSLNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excessive [l,m]-factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Cariolaro, Giuseppe Mazzuoccolo","submitted_at":"2013-05-17T08:08:40Z","abstract_excerpt":"Given two positive integers l and m, with l \\le m, an [l,m]-covering of a graph G is a set M of matchings of G whose union is the edge set of G and such that l \\le |L| \\le m for every matching L of M. An [l,m]-covering M of G is an excessive [l,m]-factorization of G if the cardinality of M is as small as possible. The number of matchings in an excessive [l,m]-factorization of G (or \\infty, if G does not admit an excessive [l,m]-factorization) is a graph parameter called the excessive [l,m]-index of G and denoted by \\chi'[l,m](G). In this paper we study such parameter. Our main result is a gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4005","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Mk0ax3JZxnKGfECfeLCFVngdlVGTBW6RFVREW5JPl4i+G9xIBJbaQl6C7yO4JXA63c1PDFWJjkpIei+I+4VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:31:52.641494Z"},"content_sha256":"882d8e9e9db064a92940b4ce296e372b06f9593cf1d36e30d3b01150c006617e","schema_version":"1.0","event_id":"sha256:882d8e9e9db064a92940b4ce296e372b06f9593cf1d36e30d3b01150c006617e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQG62MC5B224RNTV5WRSWPSLNW/bundle.json","state_url":"https://pith.science/pith/LQG62MC5B224RNTV5WRSWPSLNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQG62MC5B224RNTV5WRSWPSLNW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T09:31:52Z","links":{"resolver":"https://pith.science/pith/LQG62MC5B224RNTV5WRSWPSLNW","bundle":"https://pith.science/pith/LQG62MC5B224RNTV5WRSWPSLNW/bundle.json","state":"https://pith.science/pith/LQG62MC5B224RNTV5WRSWPSLNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQG62MC5B224RNTV5WRSWPSLNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LQG62MC5B224RNTV5WRSWPSLNW","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":"08c1fa76431a677d3320e3d9afbb2b35ab3d6eeb47302b6f38179ebd3cf71fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T08:08:40Z","title_canon_sha256":"5c2d107f3172830483f0e209c705b10fa23f5c612de8d01f8506d7b629bae21d"},"schema_version":"1.0","source":{"id":"1305.4005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4005","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4005v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4005","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"LQG62MC5B224","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQG62MC5B224RNTV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQG62MC5","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:882d8e9e9db064a92940b4ce296e372b06f9593cf1d36e30d3b01150c006617e","target":"graph","created_at":"2026-05-18T03:25:26Z","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"},"paper":{"abstract_excerpt":"Given two positive integers l and m, with l \\le m, an [l,m]-covering of a graph G is a set M of matchings of G whose union is the edge set of G and such that l \\le |L| \\le m for every matching L of M. An [l,m]-covering M of G is an excessive [l,m]-factorization of G if the cardinality of M is as small as possible. The number of matchings in an excessive [l,m]-factorization of G (or \\infty, if G does not admit an excessive [l,m]-factorization) is a graph parameter called the excessive [l,m]-index of G and denoted by \\chi'[l,m](G). In this paper we study such parameter. Our main result is a gene","authors_text":"David Cariolaro, Giuseppe Mazzuoccolo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T08:08:40Z","title":"Excessive [l,m]-factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4005","kind":"arxiv","version":1},"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:18d2f9966ce355a8b5fc80a8c13bec8aebe4575979fc0fd79e519fc006f28795","target":"record","created_at":"2026-05-18T03:25:26Z","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":"08c1fa76431a677d3320e3d9afbb2b35ab3d6eeb47302b6f38179ebd3cf71fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-17T08:08:40Z","title_canon_sha256":"5c2d107f3172830483f0e209c705b10fa23f5c612de8d01f8506d7b629bae21d"},"schema_version":"1.0","source":{"id":"1305.4005","kind":"arxiv","version":1}},"canonical_sha256":"5c0ded305d0eb5c8b675eda32b3e4b6dbe5419bdd3b9458706eec2816bb2e352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c0ded305d0eb5c8b675eda32b3e4b6dbe5419bdd3b9458706eec2816bb2e352","first_computed_at":"2026-05-18T03:25:26.591020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:26.591020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABLmuINT9wWbpZnRVVxyKtP2dhQvvP+1qOYTaV9JKeYXHbMRKpJ811zuEtmhQBeOG3O3Yy7FqsOjPM0TW2zvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:26.591800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18d2f9966ce355a8b5fc80a8c13bec8aebe4575979fc0fd79e519fc006f28795","sha256:882d8e9e9db064a92940b4ce296e372b06f9593cf1d36e30d3b01150c006617e"],"state_sha256":"bb87c61ce084c604a61c33057300d3b33e5977c482a768ccf310272d3cf5f186"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVsNv2nJ3rIPXiB/fWQXx3KlVB4B/Avhl2EZdDMof1lR7vPhuFf5iahyLEE7Fl9P0iccdooosvvVTTf46gU1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:31:52.644496Z","bundle_sha256":"5921ab03d662be6294a02bf17fb1028725268d4dd547f194d6c2fe97c01a31a6"}}