{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4H5Y5T73OUBDQDR6657PKW7XGR","short_pith_number":"pith:4H5Y5T73","schema_version":"1.0","canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","source":{"kind":"arxiv","id":"1111.3996","version":3},"attestation_state":"computed","paper":{"title":"Complexity of the path avoiding forbidden pairs problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jakub Kov\\'a\\v{c}","submitted_at":"2011-11-17T01:04:15Z","abstract_excerpt":"Let G = (V, E) be a directed acyclic graph with two distinguished vertices s, t and let F be a set of forbidden pairs of vertices. We say that a path in G is safe, if it contains at most one vertex from each pair {u, v} in F. Given G and F, the path avoiding forbidden pairs (PAFP) problem is to find a safe s-t path in G. We systematically study the complexity of different special cases of the PAFP problem defined according to the mutual positions of forbidden pairs. Fix one topological ordering of vertices; we say that pairs {u, v} and {x, y} are disjoint, if u, v < x, y, nested, if u < x, y <"},"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":"1111.3996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-17T01:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"bcb437706666ea7167feb4ec30089dda74636c37a1f5046684528047c7f9e7b5","abstract_canon_sha256":"82b3c539fd76054d66a939e343e075ffb7ed9fc03d4e248095473b59779b889a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:29.236382Z","signature_b64":"44MpXTwEqDpA4b3P7h2OsjTGE2XOLm/31Guj4JnR6rRp0MIC68csIM7xKOADjWLw+JbPP+b2Ix9UjAg4GEzrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","last_reissued_at":"2026-05-18T02:21:29.235826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:29.235826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the path avoiding forbidden pairs problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jakub Kov\\'a\\v{c}","submitted_at":"2011-11-17T01:04:15Z","abstract_excerpt":"Let G = (V, E) be a directed acyclic graph with two distinguished vertices s, t and let F be a set of forbidden pairs of vertices. We say that a path in G is safe, if it contains at most one vertex from each pair {u, v} in F. Given G and F, the path avoiding forbidden pairs (PAFP) problem is to find a safe s-t path in G. We systematically study the complexity of different special cases of the PAFP problem defined according to the mutual positions of forbidden pairs. Fix one topological ordering of vertices; we say that pairs {u, v} and {x, y} are disjoint, if u, v < x, y, nested, if u < x, y <"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3996","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":"1111.3996","created_at":"2026-05-18T02:21:29.235908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3996v3","created_at":"2026-05-18T02:21:29.235908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3996","created_at":"2026-05-18T02:21:29.235908+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H5Y5T73OUBD","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H5Y5T73OUBDQDR6","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H5Y5T73","created_at":"2026-05-18T12:26:20.644004+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/4H5Y5T73OUBDQDR6657PKW7XGR","json":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR.json","graph_json":"https://pith.science/api/pith-number/4H5Y5T73OUBDQDR6657PKW7XGR/graph.json","events_json":"https://pith.science/api/pith-number/4H5Y5T73OUBDQDR6657PKW7XGR/events.json","paper":"https://pith.science/paper/4H5Y5T73"},"agent_actions":{"view_html":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR","download_json":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR.json","view_paper":"https://pith.science/paper/4H5Y5T73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3996&json=true","fetch_graph":"https://pith.science/api/pith-number/4H5Y5T73OUBDQDR6657PKW7XGR/graph.json","fetch_events":"https://pith.science/api/pith-number/4H5Y5T73OUBDQDR6657PKW7XGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/action/storage_attestation","attest_author":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/action/author_attestation","sign_citation":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/action/citation_signature","submit_replication":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/action/replication_record"}},"created_at":"2026-05-18T02:21:29.235908+00:00","updated_at":"2026-05-18T02:21:29.235908+00:00"}