{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HMPUBXYU5NYMQGRS6XAWEINFDD","short_pith_number":"pith:HMPUBXYU","canonical_record":{"source":{"id":"1502.02135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-07T12:54:48Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"6e4bedfa66fa9074fd617e703f4cbf59d60af54c7f16579248d3b3d12ef868d9","abstract_canon_sha256":"51580ec34007de07f319941eb4589369873c93f28e74399411963286e7a7e4fc"},"schema_version":"1.0"},"canonical_sha256":"3b1f40df14eb70c81a32f5c16221a518e7e98f25416579ad2b8735bfbcc869f1","source":{"kind":"arxiv","id":"1502.02135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02135","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02135v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02135","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"HMPUBXYU5NYM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMPUBXYU5NYMQGRS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMPUBXYU","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HMPUBXYU5NYMQGRS6XAWEINFDD","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-07T12:54:48Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"6e4bedfa66fa9074fd617e703f4cbf59d60af54c7f16579248d3b3d12ef868d9","abstract_canon_sha256":"51580ec34007de07f319941eb4589369873c93f28e74399411963286e7a7e4fc"},"schema_version":"1.0"},"canonical_sha256":"3b1f40df14eb70c81a32f5c16221a518e7e98f25416579ad2b8735bfbcc869f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.578435Z","signature_b64":"9u5eILjz1ayV1UPtiilfpklokTuyeokj+fxXTFxBlD7d24uyiieLm1wxZPZJZ9qIFIt1hpwRvGjH0Nakx9NgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b1f40df14eb70c81a32f5c16221a518e7e98f25416579ad2b8735bfbcc869f1","last_reissued_at":"2026-05-18T02:27:43.577774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.577774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02135","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:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ks1HOJasxJ2w1MXe/naIZUkd/xMvtGSjC0V7XPWl9IG650pXx0OEdEc3crW60s+BQAxC+d4iadU1G1W+YZCWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:17:28.416725Z"},"content_sha256":"2a623108a6c750853de6b7e20e44dd10c9e66a180c5d4c63ddef28ce563fa38e","schema_version":"1.0","event_id":"sha256:2a623108a6c750853de6b7e20e44dd10c9e66a180c5d4c63ddef28ce563fa38e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HMPUBXYU5NYMQGRS6XAWEINFDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.CC","authors_text":"Diptarka Chakraborty, Raghunath Tewari","submitted_at":"2015-02-07T12:54:48Z","abstract_excerpt":"In this paper, we show that given a weighted, directed planar graph $G$, and any $\\epsilon >0$, there exists a polynomial time and $O(n^{\\frac{1}{2}+\\epsilon})$ space algorithm that computes the shortest path between two fixed vertices in $G$.\n  We also consider the {\\RB} problem, which states that given a graph $G$ whose edges are colored either red or blue and two fixed vertices $s$ and $t$ in $G$, is there a path from $s$ to $t$ in $G$ that alternates between red and blue edges. The {\\RB} problem in planar DAGs is {\\NL}-complete. We exhibit a polynomial time and $O(n^{\\frac{1}{2}+\\epsilon})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02135","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:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZNq/YTlaKcOCCWOcZcq22NdrtvYZ85uWbSEQPfbL0eJip0WHNEvCHEgj6kXX1mBu5T0mXmLKd+7F+CujGAFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:17:28.417093Z"},"content_sha256":"b497e0f8dcef47bbe092e7e47f50b1b020236da284a8a91816d63055082403f5","schema_version":"1.0","event_id":"sha256:b497e0f8dcef47bbe092e7e47f50b1b020236da284a8a91816d63055082403f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/bundle.json","state_url":"https://pith.science/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/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-05-30T20:17:28Z","links":{"resolver":"https://pith.science/pith/HMPUBXYU5NYMQGRS6XAWEINFDD","bundle":"https://pith.science/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/bundle.json","state":"https://pith.science/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMPUBXYU5NYMQGRS6XAWEINFDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HMPUBXYU5NYMQGRS6XAWEINFDD","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":"51580ec34007de07f319941eb4589369873c93f28e74399411963286e7a7e4fc","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-07T12:54:48Z","title_canon_sha256":"6e4bedfa66fa9074fd617e703f4cbf59d60af54c7f16579248d3b3d12ef868d9"},"schema_version":"1.0","source":{"id":"1502.02135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02135","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02135v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02135","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"HMPUBXYU5NYM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMPUBXYU5NYMQGRS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMPUBXYU","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:b497e0f8dcef47bbe092e7e47f50b1b020236da284a8a91816d63055082403f5","target":"graph","created_at":"2026-05-18T02:27:43Z","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":"In this paper, we show that given a weighted, directed planar graph $G$, and any $\\epsilon >0$, there exists a polynomial time and $O(n^{\\frac{1}{2}+\\epsilon})$ space algorithm that computes the shortest path between two fixed vertices in $G$.\n  We also consider the {\\RB} problem, which states that given a graph $G$ whose edges are colored either red or blue and two fixed vertices $s$ and $t$ in $G$, is there a path from $s$ to $t$ in $G$ that alternates between red and blue edges. The {\\RB} problem in planar DAGs is {\\NL}-complete. We exhibit a polynomial time and $O(n^{\\frac{1}{2}+\\epsilon})","authors_text":"Diptarka Chakraborty, Raghunath Tewari","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-07T12:54:48Z","title":"Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02135","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:2a623108a6c750853de6b7e20e44dd10c9e66a180c5d4c63ddef28ce563fa38e","target":"record","created_at":"2026-05-18T02:27:43Z","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":"51580ec34007de07f319941eb4589369873c93f28e74399411963286e7a7e4fc","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-07T12:54:48Z","title_canon_sha256":"6e4bedfa66fa9074fd617e703f4cbf59d60af54c7f16579248d3b3d12ef868d9"},"schema_version":"1.0","source":{"id":"1502.02135","kind":"arxiv","version":1}},"canonical_sha256":"3b1f40df14eb70c81a32f5c16221a518e7e98f25416579ad2b8735bfbcc869f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b1f40df14eb70c81a32f5c16221a518e7e98f25416579ad2b8735bfbcc869f1","first_computed_at":"2026-05-18T02:27:43.577774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:43.577774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9u5eILjz1ayV1UPtiilfpklokTuyeokj+fxXTFxBlD7d24uyiieLm1wxZPZJZ9qIFIt1hpwRvGjH0Nakx9NgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:43.578435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a623108a6c750853de6b7e20e44dd10c9e66a180c5d4c63ddef28ce563fa38e","sha256:b497e0f8dcef47bbe092e7e47f50b1b020236da284a8a91816d63055082403f5"],"state_sha256":"549f51e960ce82c2ae0d43fc052a00ccf7d364ffebeb9e05070f4898266424c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9VJAidinVJIl+9OMhsCV/7TIs/4JuIfcZ0gFySOM2gh4sbe+lWmZ/IqeskFypq+UMzcpGxvrBH1fl5SIEtqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:17:28.419437Z","bundle_sha256":"8f16ee234897490843af7d3cf90cc801e8ee305434596ab682067ac309ef6817"}}