{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5IZLURB2K4MJSWX262HRP3DZ36","short_pith_number":"pith:5IZLURB2","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"},"canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","source":{"kind":"arxiv","id":"1404.5996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5996","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5996v1","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5996","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"5IZLURB2K4MJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IZLURB2K4MJSWX2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IZLURB2","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5IZLURB2K4MJSWX262HRP3DZ36","target":"record","payload":{"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"},"canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","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"},"source_kind":"arxiv","source_id":"1404.5996","source_version":1,"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-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIWNJQ0NgYy6eJjXjlNBBjSixGSar1UyyJX0j5JDLsaPdGt0cUdEfGyjz685p6wPLqVCLuueQX7SwHQzobICAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:58:56.357426Z"},"content_sha256":"88edcf454083e7eec42cc8b4309f18cb12ac62d6699f90cc4bb029d3380d04c4","schema_version":"1.0","event_id":"sha256:88edcf454083e7eec42cc8b4309f18cb12ac62d6699f90cc4bb029d3380d04c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5IZLURB2K4MJSWX262HRP3DZ36","target":"graph","payload":{"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"},"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-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnafrhvAuoIPLv1OmsxYVnKFO7ggABmpqocy1avLOm1h/mbRHVu0ka0CeKCe+2d+nnGXQYdSC0SIXBmMGI/0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:58:56.357776Z"},"content_sha256":"3ec307b696de590d5a1555c1fb5768ada0f22f910b46b5ef6db4e437c86770a3","schema_version":"1.0","event_id":"sha256:3ec307b696de590d5a1555c1fb5768ada0f22f910b46b5ef6db4e437c86770a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/bundle.json","state_url":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IZLURB2K4MJSWX262HRP3DZ36/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-06-04T21:58:56Z","links":{"resolver":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36","bundle":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/bundle.json","state":"https://pith.science/pith/5IZLURB2K4MJSWX262HRP3DZ36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IZLURB2K4MJSWX262HRP3DZ36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5IZLURB2K4MJSWX262HRP3DZ36","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":"305d65e5f35fe8a8597b4f3d6617e4cfc717bbf96d62b04fc89b50f9b0e09b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-23T22:32:11Z","title_canon_sha256":"f6fd085419f45f6fce2295d87b13ff57d3b8fdc4759582ac470a899f9300afc1"},"schema_version":"1.0","source":{"id":"1404.5996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5996","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5996v1","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5996","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"5IZLURB2K4MJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IZLURB2K4MJSWX2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IZLURB2","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:3ec307b696de590d5a1555c1fb5768ada0f22f910b46b5ef6db4e437c86770a3","target":"graph","created_at":"2026-05-18T02:53:18Z","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":"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","authors_text":"Ekkehard K\\\"ohler, Lalla Mouatadid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-23T22:32:11Z","title":"Linear Time LexDFS on Cocomparability Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5996","kind":"arxiv","version":1},"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:88edcf454083e7eec42cc8b4309f18cb12ac62d6699f90cc4bb029d3380d04c4","target":"record","created_at":"2026-05-18T02:53:18Z","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":"305d65e5f35fe8a8597b4f3d6617e4cfc717bbf96d62b04fc89b50f9b0e09b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-23T22:32:11Z","title_canon_sha256":"f6fd085419f45f6fce2295d87b13ff57d3b8fdc4759582ac470a899f9300afc1"},"schema_version":"1.0","source":{"id":"1404.5996","kind":"arxiv","version":1}},"canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea32ba443a5718995afaf68f17ec79df9f123ce3a0abfd755a28a8cc7e22ca50","first_computed_at":"2026-05-18T02:53:18.700776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:18.700776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jNI6Ubja/wYYXyeP+8EoWtHsIm2hr4klQi99ZKbGKDnkfneI7I7HJkNJt4PeB1qgxftb7PZbbtcC/9/57lRADA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:18.701370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88edcf454083e7eec42cc8b4309f18cb12ac62d6699f90cc4bb029d3380d04c4","sha256:3ec307b696de590d5a1555c1fb5768ada0f22f910b46b5ef6db4e437c86770a3"],"state_sha256":"91f62a528b2213d1bb703f118452bc16b732df1c9075e539794afc2773518054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xpu0wQoOm5bSzrlfGTI7mwsLhWkYHS1mt+EgjfOFJk84e8RuF3R/ogTOomXFHZgvCpkvzpFswsQ0srSt64VCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:58:56.359781Z","bundle_sha256":"acc9915543a37d274030aa9c1d596f7023c671a3a0fa0ee3656f7f25e18e5a0e"}}