{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GSK2772Z4GEEFGP6JR4UYXNK7A","short_pith_number":"pith:GSK2772Z","canonical_record":{"source":{"id":"1710.07748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-21T03:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"860f1236c2a71ec0960f904a9594a206449818e7f5691dce66eb3cbe7c04482b","abstract_canon_sha256":"4402fd140b45bf47e871e0fc2276f4a1dc6dbab2cbe356f8622535d50c0162bf"},"schema_version":"1.0"},"canonical_sha256":"3495afff59e1884299fe4c794c5daaf82f27875da4b0db8425ef10f02051b29d","source":{"kind":"arxiv","id":"1710.07748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07748","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07748v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07748","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"GSK2772Z4GEE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSK2772Z4GEEFGP6","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSK2772Z","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GSK2772Z4GEEFGP6JR4UYXNK7A","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-21T03:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"860f1236c2a71ec0960f904a9594a206449818e7f5691dce66eb3cbe7c04482b","abstract_canon_sha256":"4402fd140b45bf47e871e0fc2276f4a1dc6dbab2cbe356f8622535d50c0162bf"},"schema_version":"1.0"},"canonical_sha256":"3495afff59e1884299fe4c794c5daaf82f27875da4b0db8425ef10f02051b29d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:19.767917Z","signature_b64":"Zkf4F+WSnBQmnbBpC5D+z6AuZUMZ6fykDBGa+M+Cwrh50a9Wiq0sBSUKeMk80L+1WCpSlcdCq+/S6uXRYR/mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3495afff59e1884299fe4c794c5daaf82f27875da4b0db8425ef10f02051b29d","last_reissued_at":"2026-05-18T00:32:19.767566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:19.767566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07748","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6gOjSVfAZG+u8JY9wMZ5Qh7XrWZ7yy9Z47cRet3qUFT4vcqvn3ZojMuahzbYkmKPBEm52g0toRpPyZ22b8dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:31:47.764605Z"},"content_sha256":"d849cff160b3ec73a6043e738190083c6a4e4b0d6886a808fc0c10a9197a6d7a","schema_version":"1.0","event_id":"sha256:d849cff160b3ec73a6043e738190083c6a4e4b0d6886a808fc0c10a9197a6d7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GSK2772Z4GEEFGP6JR4UYXNK7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the K\\H{o}nig-Egerv\\'ary Theorem for $k$-Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Pascal Ochem, St\\'ephane Bessy","submitted_at":"2017-10-21T03:31:33Z","abstract_excerpt":"The famous K\\H{o}nig-Egerv\\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we consider the set ${\\cal G}_k$ of all graphs such that, for every induced subgraph, the maximum number of disjoint paths of order $k$ equals the minimum order of a set of vertices intersecting all paths of order $k$. For $k\\in \\{ 3,4\\}$, we give complete structural descriptions of the graphs in ${\\cal G}_k$. Furthermore, for odd $k$, we give a complete structural"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07748","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFBs+khCxfU64DKxjkCv8FrMHUc1mkBk9AL9tkb9neoT/RzVn7dhuUFFeCYQ0R8tV4ZobIqWev5TPpPMau4YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:31:47.765249Z"},"content_sha256":"23dbf52113090b454568035e40521e214e171a76d381d24f9e833e8e1f54d342","schema_version":"1.0","event_id":"sha256:23dbf52113090b454568035e40521e214e171a76d381d24f9e833e8e1f54d342"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/bundle.json","state_url":"https://pith.science/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/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-27T18:31:47Z","links":{"resolver":"https://pith.science/pith/GSK2772Z4GEEFGP6JR4UYXNK7A","bundle":"https://pith.science/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/bundle.json","state":"https://pith.science/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSK2772Z4GEEFGP6JR4UYXNK7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GSK2772Z4GEEFGP6JR4UYXNK7A","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":"4402fd140b45bf47e871e0fc2276f4a1dc6dbab2cbe356f8622535d50c0162bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-21T03:31:33Z","title_canon_sha256":"860f1236c2a71ec0960f904a9594a206449818e7f5691dce66eb3cbe7c04482b"},"schema_version":"1.0","source":{"id":"1710.07748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07748","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07748v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07748","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"GSK2772Z4GEE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSK2772Z4GEEFGP6","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSK2772Z","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:23dbf52113090b454568035e40521e214e171a76d381d24f9e833e8e1f54d342","target":"graph","created_at":"2026-05-18T00:32:19Z","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":"The famous K\\H{o}nig-Egerv\\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we consider the set ${\\cal G}_k$ of all graphs such that, for every induced subgraph, the maximum number of disjoint paths of order $k$ equals the minimum order of a set of vertices intersecting all paths of order $k$. For $k\\in \\{ 3,4\\}$, we give complete structural descriptions of the graphs in ${\\cal G}_k$. Furthermore, for odd $k$, we give a complete structural","authors_text":"Dieter Rautenbach, Pascal Ochem, St\\'ephane Bessy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-21T03:31:33Z","title":"On the K\\H{o}nig-Egerv\\'ary Theorem for $k$-Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07748","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:d849cff160b3ec73a6043e738190083c6a4e4b0d6886a808fc0c10a9197a6d7a","target":"record","created_at":"2026-05-18T00:32:19Z","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":"4402fd140b45bf47e871e0fc2276f4a1dc6dbab2cbe356f8622535d50c0162bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-21T03:31:33Z","title_canon_sha256":"860f1236c2a71ec0960f904a9594a206449818e7f5691dce66eb3cbe7c04482b"},"schema_version":"1.0","source":{"id":"1710.07748","kind":"arxiv","version":1}},"canonical_sha256":"3495afff59e1884299fe4c794c5daaf82f27875da4b0db8425ef10f02051b29d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3495afff59e1884299fe4c794c5daaf82f27875da4b0db8425ef10f02051b29d","first_computed_at":"2026-05-18T00:32:19.767566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:19.767566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zkf4F+WSnBQmnbBpC5D+z6AuZUMZ6fykDBGa+M+Cwrh50a9Wiq0sBSUKeMk80L+1WCpSlcdCq+/S6uXRYR/mDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:19.767917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d849cff160b3ec73a6043e738190083c6a4e4b0d6886a808fc0c10a9197a6d7a","sha256:23dbf52113090b454568035e40521e214e171a76d381d24f9e833e8e1f54d342"],"state_sha256":"4985a8694b9c0689a3ac1e32215c86615e41c9457707b01f0ac206b2e84fcdb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wl+4LuELGIGOI9cKyQ6AqKlPTeeSGnwDCAIR/1FxJzREqYwTxaE/3vxYFi0w3UE+frbEa7LHU4Hw8UPG70bMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:31:47.768924Z","bundle_sha256":"3567d34338e312036322030fac1c59ad51c21eec8a19c609600ce12b545abb1c"}}