{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7ZRHRCJRVSO7RHCO7NEWDBPNST","short_pith_number":"pith:7ZRHRCJR","schema_version":"1.0","canonical_sha256":"fe62788931ac9df89c4efb496185ed94ff473510bc332da74a5bed5cec23fe54","source":{"kind":"arxiv","id":"2009.03780","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.03780","created_at":"2026-07-05T01:34:58.728405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.03780v1","created_at":"2026-07-05T01:34:58.728405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03780","created_at":"2026-07-05T01:34:58.728405+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZRHRCJRVSO7","created_at":"2026-07-05T01:34:58.728405+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZRHRCJRVSO7RHCO","created_at":"2026-07-05T01:34:58.728405+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZRHRCJR","created_at":"2026-07-05T01:34:58.728405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.06387","citing_title":"Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST","json":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST.json","graph_json":"https://pith.science/api/pith-number/7ZRHRCJRVSO7RHCO7NEWDBPNST/graph.json","events_json":"https://pith.science/api/pith-number/7ZRHRCJRVSO7RHCO7NEWDBPNST/events.json","paper":"https://pith.science/paper/7ZRHRCJR"},"agent_actions":{"view_html":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST","download_json":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST.json","view_paper":"https://pith.science/paper/7ZRHRCJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.03780&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZRHRCJRVSO7RHCO7NEWDBPNST/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZRHRCJRVSO7RHCO7NEWDBPNST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/action/storage_attestation","attest_author":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/action/author_attestation","sign_citation":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/action/citation_signature","submit_replication":"https://pith.science/pith/7ZRHRCJRVSO7RHCO7NEWDBPNST/action/replication_record"}},"created_at":"2026-07-05T01:34:58.728405+00:00","updated_at":"2026-07-05T01:34:58.728405+00:00"}