{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BSQUW3CJ4TCOCBVRO5Y5357ZBN","short_pith_number":"pith:BSQUW3CJ","schema_version":"1.0","canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","source":{"kind":"arxiv","id":"1703.05598","version":3},"attestation_state":"computed","paper":{"title":"A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Rolf Niedermeier","submitted_at":"2017-03-16T13:10:29Z","abstract_excerpt":"Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in $O(m \\sqrt{n})$ time. We develop a linear-time algorithm to find maximum-cardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutation graphs. Our algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS)."},"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":"1703.05598","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-16T13:10:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c885332c241c5e2cb9bdf1e5a0d4c5398bc2992796e3528e1dbc3ae050dab91","abstract_canon_sha256":"56f684d0f7249407e8863046e740b8d51b1bd92fbd2468d26ab318906c08d150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.824869Z","signature_b64":"nQxs3ZBh20LHHyihnoTtnV3273zu1kdN20XlTvEa67A6s5GQkvfSZZMSdFCEJkblbx8NHnqxzWrNO2Q672f6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","last_reissued_at":"2026-05-18T00:02:45.824438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.824438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Rolf Niedermeier","submitted_at":"2017-03-16T13:10:29Z","abstract_excerpt":"Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in $O(m \\sqrt{n})$ time. We develop a linear-time algorithm to find maximum-cardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutation graphs. Our algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05598","kind":"arxiv","version":3},"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":"1703.05598","created_at":"2026-05-18T00:02:45.824499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05598v3","created_at":"2026-05-18T00:02:45.824499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05598","created_at":"2026-05-18T00:02:45.824499+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSQUW3CJ4TCO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSQUW3CJ4TCOCBVR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSQUW3CJ","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN","json":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN.json","graph_json":"https://pith.science/api/pith-number/BSQUW3CJ4TCOCBVRO5Y5357ZBN/graph.json","events_json":"https://pith.science/api/pith-number/BSQUW3CJ4TCOCBVRO5Y5357ZBN/events.json","paper":"https://pith.science/paper/BSQUW3CJ"},"agent_actions":{"view_html":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN","download_json":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN.json","view_paper":"https://pith.science/paper/BSQUW3CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05598&json=true","fetch_graph":"https://pith.science/api/pith-number/BSQUW3CJ4TCOCBVRO5Y5357ZBN/graph.json","fetch_events":"https://pith.science/api/pith-number/BSQUW3CJ4TCOCBVRO5Y5357ZBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/action/storage_attestation","attest_author":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/action/author_attestation","sign_citation":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/action/citation_signature","submit_replication":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/action/replication_record"}},"created_at":"2026-05-18T00:02:45.824499+00:00","updated_at":"2026-05-18T00:02:45.824499+00:00"}