{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT","short_pith_number":"pith:2B2QZ432","canonical_record":{"source":{"id":"1501.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1","abstract_canon_sha256":"fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38"},"schema_version":"1.0"},"canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","source":{"kind":"arxiv","id":"1501.05828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05828","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05828v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05828","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"2B2QZ432PPSP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2B2QZ432PPSPJWU5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2B2QZ432","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1","abstract_canon_sha256":"fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38"},"schema_version":"1.0"},"canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.875948Z","signature_b64":"zjrcd15iXCKGHaZ1junyBvUD+Z5LxplqWDyhbP/lyHzWRdDz2e0BRoPPHXViLA9wqr5Duv481I9UQ2vElbPQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","last_reissued_at":"2026-05-18T02:28:48.875610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.875610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05828","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:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eB0aXWAtn8ayZcBhPBG+DGWxGXyRD/eATFN8EHc+B4iByHcrhmsTws+xJi9cVfo1dTB8vK8JjYut5EKNdjNFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:35.118491Z"},"content_sha256":"762b9cd805e778d28a891db1069d8d398b82696c5c0be497442bb56c050616df","schema_version":"1.0","event_id":"sha256:762b9cd805e778d28a891db1069d8d398b82696c5c0be497442bb56c050616df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O(n^{\\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Raghunath Tewari","submitted_at":"2015-01-23T15:23:25Z","abstract_excerpt":"Given a graph $G$ and two vertices $s$ and $t$ in it, {\\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in polynomial time and $O(n^\\epsilon)$ space, for any $\\epsilon > 0$. The previous best known space bound for this problem with polynomial time was approximately $O(\\sqrt{n})$ space \\cite{INPVW13}.\n  Deciding graph reachability in {\\SC} is an important open question in complexity theory and in this paper we make progress towards resolving this question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05828","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:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9RM5X1bPDEXmLM215pm9ba9zuvsSPaWOw6Jt2cD+fHkb47JXYzJNCGlHZ/vavjgpM51okXuMQuYPn2yYpY/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:35.118895Z"},"content_sha256":"e31bbeba77b28d74f75732382f3036f86117b849c4268bd9afcc046c7e1d6cdd","schema_version":"1.0","event_id":"sha256:e31bbeba77b28d74f75732382f3036f86117b849c4268bd9afcc046c7e1d6cdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/bundle.json","state_url":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/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-30T02:17:35Z","links":{"resolver":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT","bundle":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/bundle.json","state":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT","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":"fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","title_canon_sha256":"e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1"},"schema_version":"1.0","source":{"id":"1501.05828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05828","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05828v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05828","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"2B2QZ432PPSP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2B2QZ432PPSPJWU5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2B2QZ432","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:e31bbeba77b28d74f75732382f3036f86117b849c4268bd9afcc046c7e1d6cdd","target":"graph","created_at":"2026-05-18T02:28:48Z","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":"Given a graph $G$ and two vertices $s$ and $t$ in it, {\\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in polynomial time and $O(n^\\epsilon)$ space, for any $\\epsilon > 0$. The previous best known space bound for this problem with polynomial time was approximately $O(\\sqrt{n})$ space \\cite{INPVW13}.\n  Deciding graph reachability in {\\SC} is an important open question in complexity theory and in this paper we make progress towards resolving this question.","authors_text":"Diptarka Chakraborty, Raghunath Tewari","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","title":"An $O(n^{\\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05828","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:762b9cd805e778d28a891db1069d8d398b82696c5c0be497442bb56c050616df","target":"record","created_at":"2026-05-18T02:28:48Z","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":"fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","title_canon_sha256":"e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1"},"schema_version":"1.0","source":{"id":"1501.05828","kind":"arxiv","version":1}},"canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","first_computed_at":"2026-05-18T02:28:48.875610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:48.875610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zjrcd15iXCKGHaZ1junyBvUD+Z5LxplqWDyhbP/lyHzWRdDz2e0BRoPPHXViLA9wqr5Duv481I9UQ2vElbPQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:48.875948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:762b9cd805e778d28a891db1069d8d398b82696c5c0be497442bb56c050616df","sha256:e31bbeba77b28d74f75732382f3036f86117b849c4268bd9afcc046c7e1d6cdd"],"state_sha256":"04be3e0ba0b0663e2a4c3edb0bda1d22590e0b2006884e54cff04e197ea39d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z666at9DK9uVAs7FL8kSNL14YtCj6LhRAmi2ikHxTAb7AZENQ8FQW4pzGDALkHicnDk8Z6wfP5KPQU3o6Ad9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:17:35.122223Z","bundle_sha256":"26ca7baa346d7f54f4a35a2661c321c599e677e7cc0001ddad7b73952ad095ca"}}