{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BSQUW3CJ4TCOCBVRO5Y5357ZBN","short_pith_number":"pith:BSQUW3CJ","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"},"canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","source":{"kind":"arxiv","id":"1703.05598","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05598","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05598v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05598","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"BSQUW3CJ4TCO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BSQUW3CJ4TCOCBVR","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BSQUW3CJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BSQUW3CJ4TCOCBVRO5Y5357ZBN","target":"record","payload":{"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"},"canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","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"},"source_kind":"arxiv","source_id":"1703.05598","source_version":3,"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"saBOWJvcZmQwyhAqcX3l0JmCrFTt8QRNmgVlOfzb2qXe4T27C9Y2uRsSPm9z7LOjW7hG25llmujz3gijoB0cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:51:52.905434Z"},"content_sha256":"052391b35a6ef451c6f4e85afdc85f74cd10f5023173005ed8282a127a8dcf4d","schema_version":"1.0","event_id":"sha256:052391b35a6ef451c6f4e85afdc85f74cd10f5023173005ed8282a127a8dcf4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BSQUW3CJ4TCOCBVRO5Y5357ZBN","target":"graph","payload":{"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"},"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us7iPi3szXEgffJW85S0PUXqB6+65JWnmTRDl3Fy0kaQPMRFEbqNjoVzSzTZp6gQ5SbHy61PGg+N1UX0jrc2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:51:52.906115Z"},"content_sha256":"df486b967ca8cadd5f8b29d1a88e14d65abceb938fa194fa26172cfe21606f02","schema_version":"1.0","event_id":"sha256:df486b967ca8cadd5f8b29d1a88e14d65abceb938fa194fa26172cfe21606f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/bundle.json","state_url":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/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-31T14:51:52Z","links":{"resolver":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN","bundle":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/bundle.json","state":"https://pith.science/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSQUW3CJ4TCOCBVRO5Y5357ZBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BSQUW3CJ4TCOCBVRO5Y5357ZBN","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":"56f684d0f7249407e8863046e740b8d51b1bd92fbd2468d26ab318906c08d150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-16T13:10:29Z","title_canon_sha256":"4c885332c241c5e2cb9bdf1e5a0d4c5398bc2992796e3528e1dbc3ae050dab91"},"schema_version":"1.0","source":{"id":"1703.05598","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05598","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05598v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05598","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"BSQUW3CJ4TCO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BSQUW3CJ4TCOCBVR","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BSQUW3CJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:df486b967ca8cadd5f8b29d1a88e14d65abceb938fa194fa26172cfe21606f02","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"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).","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-16T13:10:29Z","title":"A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05598","kind":"arxiv","version":3},"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:052391b35a6ef451c6f4e85afdc85f74cd10f5023173005ed8282a127a8dcf4d","target":"record","created_at":"2026-05-18T00:02:45Z","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":"56f684d0f7249407e8863046e740b8d51b1bd92fbd2468d26ab318906c08d150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-16T13:10:29Z","title_canon_sha256":"4c885332c241c5e2cb9bdf1e5a0d4c5398bc2992796e3528e1dbc3ae050dab91"},"schema_version":"1.0","source":{"id":"1703.05598","kind":"arxiv","version":3}},"canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ca14b6c49e4c4e106b17771ddf7f90b577d2fc2d8fe2513bd05b86ed17a0c83","first_computed_at":"2026-05-18T00:02:45.824438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.824438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQxs3ZBh20LHHyihnoTtnV3273zu1kdN20XlTvEa67A6s5GQkvfSZZMSdFCEJkblbx8NHnqxzWrNO2Q672f6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.824869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05598","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:052391b35a6ef451c6f4e85afdc85f74cd10f5023173005ed8282a127a8dcf4d","sha256:df486b967ca8cadd5f8b29d1a88e14d65abceb938fa194fa26172cfe21606f02"],"state_sha256":"52b720ac0ea4f862b2eb4af39baf073930e3132d225f4ad5ce51c19a92ec6b43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GASv5Cn78rgzAum2AbvldfoVm+30QEOVUDGpLP4ecbCVOA4d07MRDA5zrRdxJ3P3hjbCwRlsj8z4sU82kZ8IAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:51:52.909902Z","bundle_sha256":"2d6b12117645c550d0fcf8b4a7d1e804b10c75ab2ba233eca3875b5ffdf8c717"}}