{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4H5Y5T73OUBDQDR6657PKW7XGR","short_pith_number":"pith:4H5Y5T73","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"},"canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","source":{"kind":"arxiv","id":"1111.3996","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3996","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3996v3","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3996","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"4H5Y5T73OUBD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4H5Y5T73OUBDQDR6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4H5Y5T73","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4H5Y5T73OUBDQDR6657PKW7XGR","target":"record","payload":{"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"},"canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","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"},"source_kind":"arxiv","source_id":"1111.3996","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-18T02:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zM/NXxugkG3tSpI/3JAfPMBU+p2CT8hTIo3NKMSSWZuDeLUJk//v4R3zYFT7StkJpGrwCEZZlzijSKnyk4yBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:44:12.738821Z"},"content_sha256":"0b62d2c7a57ee48b179adb91f0bef6a4a51be79a314857fb8d171c0df27651fa","schema_version":"1.0","event_id":"sha256:0b62d2c7a57ee48b179adb91f0bef6a4a51be79a314857fb8d171c0df27651fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4H5Y5T73OUBDQDR6657PKW7XGR","target":"graph","payload":{"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"},"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:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eey/gaN0fzwRdPtlSGCcTOOxpSpzb8TuoFyPJfZuFbKH7O+NE3TRx6fx43+F1/ikKUCd+t37WizyYU5x/yFJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:44:12.739156Z"},"content_sha256":"98974690209c777bc4287d4ec726c0cc6a750910b41585cd77a7bd6ca3a7d8bb","schema_version":"1.0","event_id":"sha256:98974690209c777bc4287d4ec726c0cc6a750910b41585cd77a7bd6ca3a7d8bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/bundle.json","state_url":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H5Y5T73OUBDQDR6657PKW7XGR/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-29T15:44:12Z","links":{"resolver":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR","bundle":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/bundle.json","state":"https://pith.science/pith/4H5Y5T73OUBDQDR6657PKW7XGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H5Y5T73OUBDQDR6657PKW7XGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4H5Y5T73OUBDQDR6657PKW7XGR","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":"82b3c539fd76054d66a939e343e075ffb7ed9fc03d4e248095473b59779b889a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-17T01:04:15Z","title_canon_sha256":"bcb437706666ea7167feb4ec30089dda74636c37a1f5046684528047c7f9e7b5"},"schema_version":"1.0","source":{"id":"1111.3996","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3996","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3996v3","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3996","created_at":"2026-05-18T02:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"4H5Y5T73OUBD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4H5Y5T73OUBDQDR6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4H5Y5T73","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:98974690209c777bc4287d4ec726c0cc6a750910b41585cd77a7bd6ca3a7d8bb","target":"graph","created_at":"2026-05-18T02:21:29Z","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":"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 <","authors_text":"Jakub Kov\\'a\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-17T01:04:15Z","title":"Complexity of the path avoiding forbidden pairs problem revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3996","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:0b62d2c7a57ee48b179adb91f0bef6a4a51be79a314857fb8d171c0df27651fa","target":"record","created_at":"2026-05-18T02:21:29Z","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":"82b3c539fd76054d66a939e343e075ffb7ed9fc03d4e248095473b59779b889a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-17T01:04:15Z","title_canon_sha256":"bcb437706666ea7167feb4ec30089dda74636c37a1f5046684528047c7f9e7b5"},"schema_version":"1.0","source":{"id":"1111.3996","kind":"arxiv","version":3}},"canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1fb8ecffb7502380e3ef77ef55bf7347c90d43e844156be43e356bb5401af37","first_computed_at":"2026-05-18T02:21:29.235826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:29.235826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"44MpXTwEqDpA4b3P7h2OsjTGE2XOLm/31Guj4JnR6rRp0MIC68csIM7xKOADjWLw+JbPP+b2Ix9UjAg4GEzrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:29.236382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3996","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b62d2c7a57ee48b179adb91f0bef6a4a51be79a314857fb8d171c0df27651fa","sha256:98974690209c777bc4287d4ec726c0cc6a750910b41585cd77a7bd6ca3a7d8bb"],"state_sha256":"608479591c78f194268f32b302e0e5c6d330928a87388243dca5190c7d80754b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41AYUuhdR/xhfufMDMM9vzvLw0Zg0/1IBZX9rPPzVVXh81V2h25Yz5f3p4c/GXD9vgFRlBm3OUto4pHVFRwMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:44:12.741066Z","bundle_sha256":"3eec52dbcdc2c1c7cb5ac72d84c496891d07a0f790d6022f30ce13c9f7c1d78f"}}