{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QCT6NWXVN6ANXBCZQUWXKE6AKS","short_pith_number":"pith:QCT6NWXV","schema_version":"1.0","canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","source":{"kind":"arxiv","id":"1807.06556","version":1},"attestation_state":"computed","paper":{"title":"On maximum $k$-edge-colorable subgraphs of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Liana Karapetyan, Vahan Mkrtchyan","submitted_at":"2018-07-17T17:04:03Z","abstract_excerpt":"If $k\\geq 0$, then a $k$-edge-coloring of a graph $G$ is an assignment of colors to edges of $G$ from the set of $k$ colors, so that adjacent edges receive different colors. A $k$-edge-colorable subgraph of $G$ is maximum if it is the largest among all $k$-edge-colorable subgraphs of $G$. For a graph $G$ and $k\\geq 0$, let $\\nu_{k}(G)$ be the number of edges of a maximum $k$-edge-colorable subgraph of $G$. In 2010 Mkrtchyan et al. proved that if $G$ is a cubic graph, then $\\nu_2(G)\\leq \\frac{|V|+2\\nu_3(G)}{4}$. This result implies that if the cubic graph $G$ contains a perfect matching, in par"},"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":"1807.06556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-17T17:04:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ebe7c365a4635b5c2d30f022d41ba2af40da15a2903390dd174eb0785d54b5eb","abstract_canon_sha256":"28b58336a89449adf93c2112b397cb6f9c99a94fdf4de76432306290f1fafda0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:32.696705Z","signature_b64":"G4Prr5diLpd6jdKR/+XF7GtzwXmFS2vF42iST3ID8EpLyLHEus720lL+6SHU95/1MTtTIdVIwttZ94Yjk0uGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","last_reissued_at":"2026-05-18T00:10:32.696150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:32.696150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximum $k$-edge-colorable subgraphs of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Liana Karapetyan, Vahan Mkrtchyan","submitted_at":"2018-07-17T17:04:03Z","abstract_excerpt":"If $k\\geq 0$, then a $k$-edge-coloring of a graph $G$ is an assignment of colors to edges of $G$ from the set of $k$ colors, so that adjacent edges receive different colors. A $k$-edge-colorable subgraph of $G$ is maximum if it is the largest among all $k$-edge-colorable subgraphs of $G$. For a graph $G$ and $k\\geq 0$, let $\\nu_{k}(G)$ be the number of edges of a maximum $k$-edge-colorable subgraph of $G$. In 2010 Mkrtchyan et al. proved that if $G$ is a cubic graph, then $\\nu_2(G)\\leq \\frac{|V|+2\\nu_3(G)}{4}$. This result implies that if the cubic graph $G$ contains a perfect matching, in par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06556","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":"1807.06556","created_at":"2026-05-18T00:10:32.696234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06556v1","created_at":"2026-05-18T00:10:32.696234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06556","created_at":"2026-05-18T00:10:32.696234+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCT6NWXVN6AN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCT6NWXVN6ANXBCZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCT6NWXV","created_at":"2026-05-18T12:32:46.962924+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/QCT6NWXVN6ANXBCZQUWXKE6AKS","json":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS.json","graph_json":"https://pith.science/api/pith-number/QCT6NWXVN6ANXBCZQUWXKE6AKS/graph.json","events_json":"https://pith.science/api/pith-number/QCT6NWXVN6ANXBCZQUWXKE6AKS/events.json","paper":"https://pith.science/paper/QCT6NWXV"},"agent_actions":{"view_html":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS","download_json":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS.json","view_paper":"https://pith.science/paper/QCT6NWXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06556&json=true","fetch_graph":"https://pith.science/api/pith-number/QCT6NWXVN6ANXBCZQUWXKE6AKS/graph.json","fetch_events":"https://pith.science/api/pith-number/QCT6NWXVN6ANXBCZQUWXKE6AKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/action/storage_attestation","attest_author":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/action/author_attestation","sign_citation":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/action/citation_signature","submit_replication":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/action/replication_record"}},"created_at":"2026-05-18T00:10:32.696234+00:00","updated_at":"2026-05-18T00:10:32.696234+00:00"}