{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QCT6NWXVN6ANXBCZQUWXKE6AKS","short_pith_number":"pith:QCT6NWXV","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"},"canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","source":{"kind":"arxiv","id":"1807.06556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06556","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06556v1","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06556","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"pith_short_12","alias_value":"QCT6NWXVN6AN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QCT6NWXVN6ANXBCZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QCT6NWXV","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QCT6NWXVN6ANXBCZQUWXKE6AKS","target":"record","payload":{"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"},"canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","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"},"source_kind":"arxiv","source_id":"1807.06556","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-18T00:10:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpJIN6XuQdIFVZD7j51w2t9LpVy3LuqKHQ0xHCnK1t8KJT9ycWygjS2Cn/m1S9SVPwgLfYF0Lv6RMyJetNqIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:05:35.185998Z"},"content_sha256":"88f6b293e36c4adbdef3c6619932c93f0bdb9def7cdba386860f346e0ce7bb3b","schema_version":"1.0","event_id":"sha256:88f6b293e36c4adbdef3c6619932c93f0bdb9def7cdba386860f346e0ce7bb3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QCT6NWXVN6ANXBCZQUWXKE6AKS","target":"graph","payload":{"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"},"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-18T00:10:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf5lTH5fCTwGBRBvvsQK8B3ZKH6C6D4A1RhLNv+ScemIYmv050N4+EjhqwdDemP4DDI32sF+SR1lIV+kWsLvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:05:35.186355Z"},"content_sha256":"e2a72ea14d0a79bae405c69fc189b0ceaded5cf5b8d5b10f98909a8487c32260","schema_version":"1.0","event_id":"sha256:e2a72ea14d0a79bae405c69fc189b0ceaded5cf5b8d5b10f98909a8487c32260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/bundle.json","state_url":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/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-06-25T07:05:35Z","links":{"resolver":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS","bundle":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/bundle.json","state":"https://pith.science/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCT6NWXVN6ANXBCZQUWXKE6AKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QCT6NWXVN6ANXBCZQUWXKE6AKS","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":"28b58336a89449adf93c2112b397cb6f9c99a94fdf4de76432306290f1fafda0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-17T17:04:03Z","title_canon_sha256":"ebe7c365a4635b5c2d30f022d41ba2af40da15a2903390dd174eb0785d54b5eb"},"schema_version":"1.0","source":{"id":"1807.06556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06556","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06556v1","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06556","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"pith_short_12","alias_value":"QCT6NWXVN6AN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QCT6NWXVN6ANXBCZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QCT6NWXV","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:e2a72ea14d0a79bae405c69fc189b0ceaded5cf5b8d5b10f98909a8487c32260","target":"graph","created_at":"2026-05-18T00:10:32Z","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":"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","authors_text":"Liana Karapetyan, Vahan Mkrtchyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-17T17:04:03Z","title":"On maximum $k$-edge-colorable subgraphs of bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06556","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:88f6b293e36c4adbdef3c6619932c93f0bdb9def7cdba386860f346e0ce7bb3b","target":"record","created_at":"2026-05-18T00:10:32Z","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":"28b58336a89449adf93c2112b397cb6f9c99a94fdf4de76432306290f1fafda0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-17T17:04:03Z","title_canon_sha256":"ebe7c365a4635b5c2d30f022d41ba2af40da15a2903390dd174eb0785d54b5eb"},"schema_version":"1.0","source":{"id":"1807.06556","kind":"arxiv","version":1}},"canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80a7e6daf56f80db8459852d7513c054b9adcb574004af11293c2e58e7ac5f96","first_computed_at":"2026-05-18T00:10:32.696150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:32.696150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4Prr5diLpd6jdKR/+XF7GtzwXmFS2vF42iST3ID8EpLyLHEus720lL+6SHU95/1MTtTIdVIwttZ94Yjk0uGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:32.696705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88f6b293e36c4adbdef3c6619932c93f0bdb9def7cdba386860f346e0ce7bb3b","sha256:e2a72ea14d0a79bae405c69fc189b0ceaded5cf5b8d5b10f98909a8487c32260"],"state_sha256":"7f71298b57742f818fbaa0157290e648f248c445c9ea79f16097ec57cf26e868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlRmFlNIhdqwBRLtZ9/WAd18JbEo60EzuYhUFslllgIdQF+1i7S784LeKWLQgLmhsJiViSc6WG09TkfhhoClDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:05:35.188270Z","bundle_sha256":"9abeb34625a26765c5389d1b1ab7a0aeaacea3b2887ec1296622d7694ae07e4c"}}