{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5IZLURB2K4MJSWX262HRP3DZ36","short_pith_number":"pith:5IZLURB2","schema_version":"1.0","canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","source":{"kind":"arxiv","id":"1404.5996","version":1},"attestation_state":"computed","paper":{"title":"Linear Time LexDFS on Cocomparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ekkehard K\\\"ohler, Lalla Mouatadid","submitted_at":"2014-04-23T22:32:11Z","abstract_excerpt":"Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs. Cocomparability graphs have been well studied by investigating their complements (comparability graphs) and their corresponding posets. Recently however LexDFS has led to a number of elegant polynomial and near linear time algorithms on cocomparability graphs when used as a preprocessing step [2, 3, 11]. The nonlinear runtime of some of these results is a consequence of complexity of this preprocessing step. We present the first linear time algorithm to"},"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":"1404.5996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-23T22:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"f6fd085419f45f6fce2295d87b13ff57d3b8fdc4759582ac470a899f9300afc1","abstract_canon_sha256":"305d65e5f35fe8a8597b4f3d6617e4cfc717bbf96d62b04fc89b50f9b0e09b2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:18.701370Z","signature_b64":"jNI6Ubja/wYYXyeP+8EoWtHsIm2hr4klQi99ZKbGKDnkfneI7I7HJkNJt4PeB1qgxftb7PZbbtcC/9/57lRADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","last_reissued_at":"2026-05-18T02:53:18.700776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:18.700776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time LexDFS on Cocomparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ekkehard K\\\"ohler, Lalla Mouatadid","submitted_at":"2014-04-23T22:32:11Z","abstract_excerpt":"Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs. Cocomparability graphs have been well studied by investigating their complements (comparability graphs) and their corresponding posets. Recently however LexDFS has led to a number of elegant polynomial and near linear time algorithms on cocomparability graphs when used as a preprocessing step [2, 3, 11]. The nonlinear runtime of some of these results is a consequence of complexity of this preprocessing step. We present the first linear time algorithm to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5996","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":"1404.5996","created_at":"2026-05-18T02:53:18.700862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5996v1","created_at":"2026-05-18T02:53:18.700862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5996","created_at":"2026-05-18T02:53:18.700862+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IZLURB2K4MJ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IZLURB2K4MJSWX2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IZLURB2","created_at":"2026-05-18T12:28:14.216126+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/5IZLURB2K4MJSWX262HRP3DZ36","json":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36.json","graph_json":"https://pith.science/api/pith-number/5IZLURB2K4MJSWX262HRP3DZ36/graph.json","events_json":"https://pith.science/api/pith-number/5IZLURB2K4MJSWX262HRP3DZ36/events.json","paper":"https://pith.science/paper/5IZLURB2"},"agent_actions":{"view_html":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36","download_json":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36.json","view_paper":"https://pith.science/paper/5IZLURB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5996&json=true","fetch_graph":"https://pith.science/api/pith-number/5IZLURB2K4MJSWX262HRP3DZ36/graph.json","fetch_events":"https://pith.science/api/pith-number/5IZLURB2K4MJSWX262HRP3DZ36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/action/storage_attestation","attest_author":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/action/author_attestation","sign_citation":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/action/citation_signature","submit_replication":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/action/replication_record"}},"created_at":"2026-05-18T02:53:18.700862+00:00","updated_at":"2026-05-18T02:53:18.700862+00:00"}