{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PK4W3G3DLFELSIFNJW7HYX7IQN","short_pith_number":"pith:PK4W3G3D","schema_version":"1.0","canonical_sha256":"7ab96d9b635948b920ad4dbe7c5fe8834a8d14ebd35229bcf73c99513ff65deb","source":{"kind":"arxiv","id":"1509.04927","version":1},"attestation_state":"computed","paper":{"title":"Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Norbert Blum","submitted_at":"2015-09-16T14:11:38Z","abstract_excerpt":"We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting is equivalent to the traditional terminology of blossoms due to Edmonds, there are some advantages. Mainly, this point of view enables the description of algorithms for the solution of matching problems without explicit analysis of blossoms, nested blossoms, and so on. Exemplary, we describe an efficient realization of the Hopcroft-Karp approach for the comp"},"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":"1509.04927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T14:11:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0ff6171cf027810c4a00d671beac045eebf154117014b88228901e9546db0604","abstract_canon_sha256":"e5cf241398655eae1080b1c42d5c925ae5ed8a4e3d908b1c96e1a1c7ef485fa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:51.324236Z","signature_b64":"bsLDltEm/cFJLHS2Lm7aYqToZrGUVF06WAFfkPd1YdQl9Kjir/rnoLO7C3VrW8WFwmMvDGYjj+epi4qL07eYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ab96d9b635948b920ad4dbe7c5fe8834a8d14ebd35229bcf73c99513ff65deb","last_reissued_at":"2026-05-18T01:32:51.323700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:51.323700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Norbert Blum","submitted_at":"2015-09-16T14:11:38Z","abstract_excerpt":"We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting is equivalent to the traditional terminology of blossoms due to Edmonds, there are some advantages. Mainly, this point of view enables the description of algorithms for the solution of matching problems without explicit analysis of blossoms, nested blossoms, and so on. Exemplary, we describe an efficient realization of the Hopcroft-Karp approach for the comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04927","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.04927","created_at":"2026-05-18T01:32:51.323797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04927v1","created_at":"2026-05-18T01:32:51.323797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04927","created_at":"2026-05-18T01:32:51.323797+00:00"},{"alias_kind":"pith_short_12","alias_value":"PK4W3G3DLFEL","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PK4W3G3DLFELSIFN","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PK4W3G3D","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20351","citing_title":"Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN","json":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN.json","graph_json":"https://pith.science/api/pith-number/PK4W3G3DLFELSIFNJW7HYX7IQN/graph.json","events_json":"https://pith.science/api/pith-number/PK4W3G3DLFELSIFNJW7HYX7IQN/events.json","paper":"https://pith.science/paper/PK4W3G3D"},"agent_actions":{"view_html":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN","download_json":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN.json","view_paper":"https://pith.science/paper/PK4W3G3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04927&json=true","fetch_graph":"https://pith.science/api/pith-number/PK4W3G3DLFELSIFNJW7HYX7IQN/graph.json","fetch_events":"https://pith.science/api/pith-number/PK4W3G3DLFELSIFNJW7HYX7IQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN/action/storage_attestation","attest_author":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN/action/author_attestation","sign_citation":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN/action/citation_signature","submit_replication":"https://pith.science/pith/PK4W3G3DLFELSIFNJW7HYX7IQN/action/replication_record"}},"created_at":"2026-05-18T01:32:51.323797+00:00","updated_at":"2026-05-18T01:32:51.323797+00:00"}