{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G3OWPDDPVVOLQDIPUU6BNUQ7TN","short_pith_number":"pith:G3OWPDDP","canonical_record":{"source":{"id":"1501.04679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T00:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"bf13b23892350d428d8acb007fe8aa91d72682c4369b04666470ab21f0766958","abstract_canon_sha256":"d72ea916537050f860dc17e43405c464921338aee629804d10a9ced91afb5a3d"},"schema_version":"1.0"},"canonical_sha256":"36dd678c6fad5cb80d0fa53c16d21f9b7aed0a90c97f3a6a8f14a1e4d9f4d341","source":{"kind":"arxiv","id":"1501.04679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04679","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04679v1","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04679","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"G3OWPDDPVVOL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G3OWPDDPVVOLQDIP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G3OWPDDP","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G3OWPDDPVVOLQDIPUU6BNUQ7TN","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T00:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"bf13b23892350d428d8acb007fe8aa91d72682c4369b04666470ab21f0766958","abstract_canon_sha256":"d72ea916537050f860dc17e43405c464921338aee629804d10a9ced91afb5a3d"},"schema_version":"1.0"},"canonical_sha256":"36dd678c6fad5cb80d0fa53c16d21f9b7aed0a90c97f3a6a8f14a1e4d9f4d341","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:03.104848Z","signature_b64":"tMo9phUtLgwwwmh2G+UII9WOytajMPRCZl68CwclzZqGdLa8KBWGHR1cUI8pFzPbg75U+AQdmFs4WyYHrCIGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36dd678c6fad5cb80d0fa53c16d21f9b7aed0a90c97f3a6a8f14a1e4d9f4d341","last_reissued_at":"2026-05-18T02:29:03.104293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:03.104293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04679","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-18T02:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrZIPOVeYUmjzhNH5qCxdMbxhSTinb6M2wJ1cegI7yPij5EbUQgKr4rKgG/Gp1UyzlZUJK/UjRZmK3kAf1TqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:20:56.995943Z"},"content_sha256":"d7d820f473330b4fcfa1fc289712eb0f79ec8fafd401e15b64c0344924a844fa","schema_version":"1.0","event_id":"sha256:d7d820f473330b4fcfa1fc289712eb0f79ec8fafd401e15b64c0344924a844fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G3OWPDDPVVOLQDIPUU6BNUQ7TN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matchings and Path Covers with applications to Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kirsti Wash, Michael A. Henning","submitted_at":"2015-01-20T00:05:49Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertex. A matching in $G$ is a set of edges that are pairwise not adjacent in $G$, while the matching number, $\\alpha'(G)$, of $G$ is the maximum size of a matching in $G$. The path covering number, $\\rm{pc}(G)$, of $G$ is the minimum number of vertex disjoint paths such that every vertex belongs to a path in the cover. We show that if $G$ has order $n$, then $\\alpha'(G) + \\frac{1}{2}\\rm{pc}(G) \\ge \\frac{n}{2}$ and we provide a constructive characterization of the graphs achieving equality in this bound. It is known that $\\gamma(G) \\le \\alpha'(G)$ and $\\gamm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04679","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-18T02:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ly8ipwBhCRvMS9CzT0qA9M6kUaBhaOS2dHMUBgEE9e9u5Qfq/KNTIajIh2xnutzayd9ITy8nv4aznKIrMocRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:20:56.996657Z"},"content_sha256":"f6e54df2602241694f421ac15ee4ffb0575c304f404c52910ffd3b937858dadd","schema_version":"1.0","event_id":"sha256:f6e54df2602241694f421ac15ee4ffb0575c304f404c52910ffd3b937858dadd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/bundle.json","state_url":"https://pith.science/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/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-09T22:20:56Z","links":{"resolver":"https://pith.science/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN","bundle":"https://pith.science/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/bundle.json","state":"https://pith.science/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3OWPDDPVVOLQDIPUU6BNUQ7TN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G3OWPDDPVVOLQDIPUU6BNUQ7TN","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":"d72ea916537050f860dc17e43405c464921338aee629804d10a9ced91afb5a3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T00:05:49Z","title_canon_sha256":"bf13b23892350d428d8acb007fe8aa91d72682c4369b04666470ab21f0766958"},"schema_version":"1.0","source":{"id":"1501.04679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04679","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04679v1","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04679","created_at":"2026-05-18T02:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"G3OWPDDPVVOL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G3OWPDDPVVOLQDIP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G3OWPDDP","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:f6e54df2602241694f421ac15ee4ffb0575c304f404c52910ffd3b937858dadd","target":"graph","created_at":"2026-05-18T02:29:03Z","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":"Let $G$ be a graph with no isolated vertex. A matching in $G$ is a set of edges that are pairwise not adjacent in $G$, while the matching number, $\\alpha'(G)$, of $G$ is the maximum size of a matching in $G$. The path covering number, $\\rm{pc}(G)$, of $G$ is the minimum number of vertex disjoint paths such that every vertex belongs to a path in the cover. We show that if $G$ has order $n$, then $\\alpha'(G) + \\frac{1}{2}\\rm{pc}(G) \\ge \\frac{n}{2}$ and we provide a constructive characterization of the graphs achieving equality in this bound. It is known that $\\gamma(G) \\le \\alpha'(G)$ and $\\gamm","authors_text":"Kirsti Wash, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T00:05:49Z","title":"Matchings and Path Covers with applications to Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04679","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:d7d820f473330b4fcfa1fc289712eb0f79ec8fafd401e15b64c0344924a844fa","target":"record","created_at":"2026-05-18T02:29:03Z","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":"d72ea916537050f860dc17e43405c464921338aee629804d10a9ced91afb5a3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T00:05:49Z","title_canon_sha256":"bf13b23892350d428d8acb007fe8aa91d72682c4369b04666470ab21f0766958"},"schema_version":"1.0","source":{"id":"1501.04679","kind":"arxiv","version":1}},"canonical_sha256":"36dd678c6fad5cb80d0fa53c16d21f9b7aed0a90c97f3a6a8f14a1e4d9f4d341","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36dd678c6fad5cb80d0fa53c16d21f9b7aed0a90c97f3a6a8f14a1e4d9f4d341","first_computed_at":"2026-05-18T02:29:03.104293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:03.104293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMo9phUtLgwwwmh2G+UII9WOytajMPRCZl68CwclzZqGdLa8KBWGHR1cUI8pFzPbg75U+AQdmFs4WyYHrCIGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:03.104848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7d820f473330b4fcfa1fc289712eb0f79ec8fafd401e15b64c0344924a844fa","sha256:f6e54df2602241694f421ac15ee4ffb0575c304f404c52910ffd3b937858dadd"],"state_sha256":"ed28fa51095d1904c7bf0a15c15ead0936b6b13ff7085a3cde4d4f51cc2cae02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KeqHcIztnos8TKUCMQ19dbPodOeiinAnTvnNhkMMMZEIJViqgBqCBLqVZMZtE7CE0xqpvcZD+QDwlkh0UNOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:20:57.000527Z","bundle_sha256":"ea6c4345715948f9fc975463655163729dea01577b40c44fdde5b3156e4bf515"}}