{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7ZRHRCJRVSO7RHCO7NEWDBPNST","short_pith_number":"pith:7ZRHRCJR","canonical_record":{"source":{"id":"2009.03780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-09-05T17:16:05Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"40f18c364d6b37699e3124f0937229a35a0cda77138db52ec6ab40c4eff25584","abstract_canon_sha256":"40abf934126fd720985b4d65ea460770df66df3f75c3153a4d533f86779b8790"},"schema_version":"1.0"},"canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","source":{"kind":"arxiv","id":"2009.03780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.03780","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"2009.03780v1","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03780","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"7ZRHRCJRVSO7","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_16","alias_value":"7ZRHRCJRVSO7RHCO","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_8","alias_value":"7ZRHRCJR","created_at":"2026-07-05T01:34:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7ZRHRCJRVSO7RHCO7NEWDBPNST","target":"record","payload":{"canonical_record":{"source":{"id":"2009.03780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-09-05T17:16:05Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"40f18c364d6b37699e3124f0937229a35a0cda77138db52ec6ab40c4eff25584","abstract_canon_sha256":"40abf934126fd720985b4d65ea460770df66df3f75c3153a4d533f86779b8790"},"schema_version":"1.0"},"canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:58.728755Z","signature_b64":"TN9f8/Fk5ea29T93K72pU0g5rZYyiWYO5QDa88EsEUMMEVv+fhRTob/yZTjWqNFn5gdanlSjVtVd6lChP/X+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","last_reissued_at":"2026-07-05T01:34:58.728348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:58.728348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.03780","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-07-05T01:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDVLSbBh9OTeqg10rYH+LKK/m8gnE9bcTL3tbWpoSPDU9rTkkxa7tKZ6Fe+1jnZrRKTBG9uMLZFsXeozG7AMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:44:05.311548Z"},"content_sha256":"44eae2486d208d021711ec90e09e94e48c66b80d289d471c092cf02ab2464f6d","schema_version":"1.0","event_id":"sha256:44eae2486d208d021711ec90e09e94e48c66b80d289d471c092cf02ab2464f6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7ZRHRCJRVSO7RHCO7NEWDBPNST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs and matrices: A translation of \"Graphok \\'{e}s matrixok\" by D\\'{e}nes K\\H{o}nig (1931)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.HO","authors_text":"G\\'abor Sz\\'arnyas","submitted_at":"2020-09-05T17:16:05Z","abstract_excerpt":"This paper, originally written in Hungarian by D\\'{e}nes K\\H{o}nig in 1931, proves that in a bipartite graph, the minimum vertex cover and the maximum matching have the same size. This statement is now known as K\\H{o}nig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03780","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.03780/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MoO+vmTHHF+9/HvH4UPagMLz9VTFvvGy7jplLLbx3lpc9XVZFPdv+P4bFAxzIIpKqk2nifU6nhEzapuJL6vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:44:05.311929Z"},"content_sha256":"e823114e419406a260389ae7d0570513787a82d33c9db1fe1107fcdb7be1aa6a","schema_version":"1.0","event_id":"sha256:e823114e419406a260389ae7d0570513787a82d33c9db1fe1107fcdb7be1aa6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/bundle.json","state_url":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/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-07-14T12:44:05Z","links":{"resolver":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST","bundle":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/bundle.json","state":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7ZRHRCJRVSO7RHCO7NEWDBPNST","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":"40abf934126fd720985b4d65ea460770df66df3f75c3153a4d533f86779b8790","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-09-05T17:16:05Z","title_canon_sha256":"40f18c364d6b37699e3124f0937229a35a0cda77138db52ec6ab40c4eff25584"},"schema_version":"1.0","source":{"id":"2009.03780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.03780","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"2009.03780v1","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03780","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"7ZRHRCJRVSO7","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_16","alias_value":"7ZRHRCJRVSO7RHCO","created_at":"2026-07-05T01:34:58Z"},{"alias_kind":"pith_short_8","alias_value":"7ZRHRCJR","created_at":"2026-07-05T01:34:58Z"}],"graph_snapshots":[{"event_id":"sha256:e823114e419406a260389ae7d0570513787a82d33c9db1fe1107fcdb7be1aa6a","target":"graph","created_at":"2026-07-05T01:34:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.03780/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper, originally written in Hungarian by D\\'{e}nes K\\H{o}nig in 1931, proves that in a bipartite graph, the minimum vertex cover and the maximum matching have the same size. This statement is now known as K\\H{o}nig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter.","authors_text":"G\\'abor Sz\\'arnyas","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-09-05T17:16:05Z","title":"Graphs and matrices: A translation of \"Graphok \\'{e}s matrixok\" by D\\'{e}nes K\\H{o}nig (1931)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03780","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:44eae2486d208d021711ec90e09e94e48c66b80d289d471c092cf02ab2464f6d","target":"record","created_at":"2026-07-05T01:34:58Z","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":"40abf934126fd720985b4d65ea460770df66df3f75c3153a4d533f86779b8790","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-09-05T17:16:05Z","title_canon_sha256":"40f18c364d6b37699e3124f0937229a35a0cda77138db52ec6ab40c4eff25584"},"schema_version":"1.0","source":{"id":"2009.03780","kind":"arxiv","version":1}},"canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","first_computed_at":"2026-07-05T01:34:58.728348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:34:58.728348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TN9f8/Fk5ea29T93K72pU0g5rZYyiWYO5QDa88EsEUMMEVv+fhRTob/yZTjWqNFn5gdanlSjVtVd6lChP/X+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:34:58.728755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.03780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44eae2486d208d021711ec90e09e94e48c66b80d289d471c092cf02ab2464f6d","sha256:e823114e419406a260389ae7d0570513787a82d33c9db1fe1107fcdb7be1aa6a"],"state_sha256":"7ed3e04c3837f2b201b1bcef7fe49d0e79f2e97ce4e9a328b4ddc489282748f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VE6MMbepxdMUa6dPtMBUG9Ny9k4jSjnWLOVkfG3IxtYWEo1OEd+gh2hrhhML4Dm2OztO7NXSFdKdpG7lQOh3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T12:44:05.314421Z","bundle_sha256":"7d0873d94fe17ec7007a7b239926a472c25c545b93d54a4fbe132bd6713c8b08"}}