{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y6GKOUNCNKJP7ILC2DOSW335OM","short_pith_number":"pith:Y6GKOUNC","canonical_record":{"source":{"id":"1207.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-19T15:39:52Z","cross_cats_sorted":[],"title_canon_sha256":"909314ca57b163b0d14c8f0451c0fb38a6e9103b2215fb556f299a2a4d901c55","abstract_canon_sha256":"2e1b095c5d81e6fdae3e9be4bca9c35607d4daa5cc82d079dfaf8c27253e9e77"},"schema_version":"1.0"},"canonical_sha256":"c78ca751a26a92ffa162d0dd2b6f7d73085d45c4689db4cacd745f44e561d056","source":{"kind":"arxiv","id":"1207.4710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4710","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4710v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4710","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GKOUNCNKJP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GKOUNCNKJP7ILC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GKOUNC","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y6GKOUNCNKJP7ILC2DOSW335OM","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-19T15:39:52Z","cross_cats_sorted":[],"title_canon_sha256":"909314ca57b163b0d14c8f0451c0fb38a6e9103b2215fb556f299a2a4d901c55","abstract_canon_sha256":"2e1b095c5d81e6fdae3e9be4bca9c35607d4daa5cc82d079dfaf8c27253e9e77"},"schema_version":"1.0"},"canonical_sha256":"c78ca751a26a92ffa162d0dd2b6f7d73085d45c4689db4cacd745f44e561d056","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.024835Z","signature_b64":"oGsEmyBpG0SDvk4Xka9a0TnXwNaQ7xrKxVxpWop5vlfxBzDNxEASJP5G+v9yrKSg/JT6Y28NJh5ksx7OBpukDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78ca751a26a92ffa162d0dd2b6f7d73085d45c4689db4cacd745f44e561d056","last_reissued_at":"2026-05-18T03:50:36.024032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.024032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4710","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yx2B9witl/bTZqmpp7hx/IpoZR0iqe3JkpEoP+MiZJxHYd1CNctk1cFoLV6psC1FuTuhhvl/VaWCd85TXom/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:20:34.286830Z"},"content_sha256":"237c00a0ed0ada6803df2d363d3ae68cbbab9837951c0d729bf38218705843ef","schema_version":"1.0","event_id":"sha256:237c00a0ed0ada6803df2d363d3ae68cbbab9837951c0d729bf38218705843ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y6GKOUNCNKJP7ILC2DOSW335OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Canadian Traveler Problem Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amit Benbassat, Cenny Wenner, Dror Fried, Solomon Eyal Shimony","submitted_at":"2012-07-19T15:39:52Z","abstract_excerpt":"The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis (1991), the adversarial version of CTP was shown to be PSPACE-complete, with the stochastic version shown to be #P-hard. We show that stochastic CTP is also PSPACE-complete: initially proving PSPACE-hardness for the dependent version of stochastic CTP,and proceeding with gadgets that allow us to extend the proof to the independent case. Since for disjoint-path g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4710","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fo5cLaOwDBWGWopGJtSQn3vLWiSBUhZY/t3itS3qUL1wb4kZVsySED0wCdcd5cmId9SF6i63JZbtkJEGG2cOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:20:34.287182Z"},"content_sha256":"37213e1c59d3f94f894970d1cab92d87d6a29af1bfe5df5ed0c2b927cdb08a50","schema_version":"1.0","event_id":"sha256:37213e1c59d3f94f894970d1cab92d87d6a29af1bfe5df5ed0c2b927cdb08a50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/bundle.json","state_url":"https://pith.science/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/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-02T04:20:34Z","links":{"resolver":"https://pith.science/pith/Y6GKOUNCNKJP7ILC2DOSW335OM","bundle":"https://pith.science/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/bundle.json","state":"https://pith.science/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6GKOUNCNKJP7ILC2DOSW335OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y6GKOUNCNKJP7ILC2DOSW335OM","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":"2e1b095c5d81e6fdae3e9be4bca9c35607d4daa5cc82d079dfaf8c27253e9e77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-19T15:39:52Z","title_canon_sha256":"909314ca57b163b0d14c8f0451c0fb38a6e9103b2215fb556f299a2a4d901c55"},"schema_version":"1.0","source":{"id":"1207.4710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4710","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4710v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4710","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GKOUNCNKJP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GKOUNCNKJP7ILC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GKOUNC","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:37213e1c59d3f94f894970d1cab92d87d6a29af1bfe5df5ed0c2b927cdb08a50","target":"graph","created_at":"2026-05-18T03:50:36Z","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":"The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis (1991), the adversarial version of CTP was shown to be PSPACE-complete, with the stochastic version shown to be #P-hard. We show that stochastic CTP is also PSPACE-complete: initially proving PSPACE-hardness for the dependent version of stochastic CTP,and proceeding with gadgets that allow us to extend the proof to the independent case. Since for disjoint-path g","authors_text":"Amit Benbassat, Cenny Wenner, Dror Fried, Solomon Eyal Shimony","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-19T15:39:52Z","title":"Complexity of Canadian Traveler Problem Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4710","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:237c00a0ed0ada6803df2d363d3ae68cbbab9837951c0d729bf38218705843ef","target":"record","created_at":"2026-05-18T03:50:36Z","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":"2e1b095c5d81e6fdae3e9be4bca9c35607d4daa5cc82d079dfaf8c27253e9e77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-19T15:39:52Z","title_canon_sha256":"909314ca57b163b0d14c8f0451c0fb38a6e9103b2215fb556f299a2a4d901c55"},"schema_version":"1.0","source":{"id":"1207.4710","kind":"arxiv","version":1}},"canonical_sha256":"c78ca751a26a92ffa162d0dd2b6f7d73085d45c4689db4cacd745f44e561d056","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c78ca751a26a92ffa162d0dd2b6f7d73085d45c4689db4cacd745f44e561d056","first_computed_at":"2026-05-18T03:50:36.024032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.024032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oGsEmyBpG0SDvk4Xka9a0TnXwNaQ7xrKxVxpWop5vlfxBzDNxEASJP5G+v9yrKSg/JT6Y28NJh5ksx7OBpukDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.024835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:237c00a0ed0ada6803df2d363d3ae68cbbab9837951c0d729bf38218705843ef","sha256:37213e1c59d3f94f894970d1cab92d87d6a29af1bfe5df5ed0c2b927cdb08a50"],"state_sha256":"de4885d53f5c4eaeff750ef6c8ceb1ad4aab9f4e441b2beba5218f96567667ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IN4h5Qm1SvwDGjTwrKnFX8RpBv/rxEjYV054veZVn8yZKwBwxdbaYVw24tle4MtVwCzZjgLn+2H8LC7P13tsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:20:34.289102Z","bundle_sha256":"0f848ad6892b323e235e10ae3a95d5984bb65da411e61308a5db126e77cad3b7"}}