{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7HMXPQLWWVYJOVFJOPAH3OJQ5M","short_pith_number":"pith:7HMXPQLW","schema_version":"1.0","canonical_sha256":"f9d977c176b5709754a973c07db930eb1a6fc4123a882b76f9c2726af3f8ad41","source":{"kind":"arxiv","id":"0909.2767","version":3},"attestation_state":"computed","paper":{"title":"On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Davit Aslanyan, Gagik N. Vardanyan, Samvel S. Petrosyan, Vahan V. Mkrtchyan","submitted_at":"2009-09-15T11:00:49Z","abstract_excerpt":"We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. Finally, for a cubic graph $G$, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let $H$ be the largest matching among such pairs. Let $M$ be a maximum matching of $G$. We show that 9/8 is a tight upper bound for $|M|/|H|$."},"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":"0909.2767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T11:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"f5b224e752210a0de0abca4bc4ec60ae0bd4a1da1a189ff7f5e790ba367a5c86","abstract_canon_sha256":"6b98a077d5420f44d320c67e983bdff45de56e06a028a9d221bfc07492f77fdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:56.462345Z","signature_b64":"n0EOB/M8xb5fzN3zJX35YbmKjsU010CZxGhSM2cUGc2DKBAJBCKOC30/717qY1NzSPM6LzBytZHcAHN0OdOuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9d977c176b5709754a973c07db930eb1a6fc4123a882b76f9c2726af3f8ad41","last_reissued_at":"2026-05-18T02:52:56.461375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:56.461375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Davit Aslanyan, Gagik N. Vardanyan, Samvel S. Petrosyan, Vahan V. Mkrtchyan","submitted_at":"2009-09-15T11:00:49Z","abstract_excerpt":"We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. Finally, for a cubic graph $G$, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let $H$ be the largest matching among such pairs. Let $M$ be a maximum matching of $G$. We show that 9/8 is a tight upper bound for $|M|/|H|$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2767","kind":"arxiv","version":3},"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":"0909.2767","created_at":"2026-05-18T02:52:56.461490+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.2767v3","created_at":"2026-05-18T02:52:56.461490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2767","created_at":"2026-05-18T02:52:56.461490+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HMXPQLWWVYJ","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HMXPQLWWVYJOVFJ","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HMXPQLW","created_at":"2026-05-18T12:25:58.837520+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/7HMXPQLWWVYJOVFJOPAH3OJQ5M","json":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M.json","graph_json":"https://pith.science/api/pith-number/7HMXPQLWWVYJOVFJOPAH3OJQ5M/graph.json","events_json":"https://pith.science/api/pith-number/7HMXPQLWWVYJOVFJOPAH3OJQ5M/events.json","paper":"https://pith.science/paper/7HMXPQLW"},"agent_actions":{"view_html":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M","download_json":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M.json","view_paper":"https://pith.science/paper/7HMXPQLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.2767&json=true","fetch_graph":"https://pith.science/api/pith-number/7HMXPQLWWVYJOVFJOPAH3OJQ5M/graph.json","fetch_events":"https://pith.science/api/pith-number/7HMXPQLWWVYJOVFJOPAH3OJQ5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M/action/storage_attestation","attest_author":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M/action/author_attestation","sign_citation":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M/action/citation_signature","submit_replication":"https://pith.science/pith/7HMXPQLWWVYJOVFJOPAH3OJQ5M/action/replication_record"}},"created_at":"2026-05-18T02:52:56.461490+00:00","updated_at":"2026-05-18T02:52:56.461490+00:00"}