{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OQ5SQPY7QAVCVKOWZG3L4JMHGJ","short_pith_number":"pith:OQ5SQPY7","canonical_record":{"source":{"id":"1902.00488","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cef6294a3b30f0759a98a1adf9277df6098b5fd99694c3a32493d31ccbfc57ed","abstract_canon_sha256":"eae512d665cf78d88c2db9f9f5a1077c91fdd2de6cc7fdca7e8293378b2574de"},"schema_version":"1.0"},"canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","source":{"kind":"arxiv","id":"1902.00488","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00488","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00488v3","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00488","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"OQ5SQPY7QAVC","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_16","alias_value":"OQ5SQPY7QAVCVKOW","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_8","alias_value":"OQ5SQPY7","created_at":"2026-07-05T09:55:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OQ5SQPY7QAVCVKOWZG3L4JMHGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00488","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cef6294a3b30f0759a98a1adf9277df6098b5fd99694c3a32493d31ccbfc57ed","abstract_canon_sha256":"eae512d665cf78d88c2db9f9f5a1077c91fdd2de6cc7fdca7e8293378b2574de"},"schema_version":"1.0"},"canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:49.683880Z","signature_b64":"O+d6JaSLDzXWTuKVjcw99ghKmjicI8IBgPi0LWEOAd4sp0/3m7VA7S6p7HGvyZGQFd906avoPBMfHHMrUs8gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","last_reissued_at":"2026-07-05T09:55:49.683376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:49.683376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00488","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-07-05T09:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWfxH2/XffioL8nJQ/EfCu7VGne5tKU/EamfwXVMA7RM5SObYPgvYpHsN6QBXYx4rjnhe8Lvs19glSS77+/ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:03:01.552397Z"},"content_sha256":"06ba86d0ba84094f1285dca175ec12b1f4d0d95c3e1f7ea1be574849afa408ce","schema_version":"1.0","event_id":"sha256:06ba86d0ba84094f1285dca175ec12b1f4d0d95c3e1f7ea1be574849afa408ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OQ5SQPY7QAVCVKOWZG3L4JMHGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving Reachability in Grid Digraphs using a Psuedoseparator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Raghunath Tewari, Rahul Jain","submitted_at":"2019-02-01T18:22:11Z","abstract_excerpt":"The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its immediate horizontal and vertical neighbors only.\n  Asano and Doerr (CCCG'11) presented the first simultaneous time-space bound for reachability in grid digraphs by solving the problem in polynomial time and $O(n^{1/2 + \\epsilon})$ space. In 2018, the space complexity was improved to $\\tilde{O}(n^{1/3})$ by Ashida and Nakagawa (SoCG'18).\n  In this paper, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00488","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.00488/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUMr0rTFUaBGwntAVs5l2mYmu71vNj1CxiNsjUncootuLKbfadPqdvStAJizc4BybHeog0XxvjDOiEc2XQLmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:03:01.553370Z"},"content_sha256":"d8acf002cc3771be09b4b4ed4948dc218181b06844ba5e376fd5dbedc9594ff7","schema_version":"1.0","event_id":"sha256:d8acf002cc3771be09b4b4ed4948dc218181b06844ba5e376fd5dbedc9594ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/bundle.json","state_url":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/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-08-13T01:03:01Z","links":{"resolver":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ","bundle":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/bundle.json","state":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OQ5SQPY7QAVCVKOWZG3L4JMHGJ","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":"eae512d665cf78d88c2db9f9f5a1077c91fdd2de6cc7fdca7e8293378b2574de","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","title_canon_sha256":"cef6294a3b30f0759a98a1adf9277df6098b5fd99694c3a32493d31ccbfc57ed"},"schema_version":"1.0","source":{"id":"1902.00488","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00488","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00488v3","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00488","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"OQ5SQPY7QAVC","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_16","alias_value":"OQ5SQPY7QAVCVKOW","created_at":"2026-07-05T09:55:49Z"},{"alias_kind":"pith_short_8","alias_value":"OQ5SQPY7","created_at":"2026-07-05T09:55:49Z"}],"graph_snapshots":[{"event_id":"sha256:d8acf002cc3771be09b4b4ed4948dc218181b06844ba5e376fd5dbedc9594ff7","target":"graph","created_at":"2026-07-05T09:55:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.00488/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its immediate horizontal and vertical neighbors only.\n  Asano and Doerr (CCCG'11) presented the first simultaneous time-space bound for reachability in grid digraphs by solving the problem in polynomial time and $O(n^{1/2 + \\epsilon})$ space. In 2018, the space complexity was improved to $\\tilde{O}(n^{1/3})$ by Ashida and Nakagawa (SoCG'18).\n  In this paper, we show tha","authors_text":"Raghunath Tewari, Rahul Jain","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","title":"On Solving Reachability in Grid Digraphs using a Psuedoseparator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00488","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:06ba86d0ba84094f1285dca175ec12b1f4d0d95c3e1f7ea1be574849afa408ce","target":"record","created_at":"2026-07-05T09:55:49Z","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":"eae512d665cf78d88c2db9f9f5a1077c91fdd2de6cc7fdca7e8293378b2574de","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","title_canon_sha256":"cef6294a3b30f0759a98a1adf9277df6098b5fd99694c3a32493d31ccbfc57ed"},"schema_version":"1.0","source":{"id":"1902.00488","kind":"arxiv","version":3}},"canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","first_computed_at":"2026-07-05T09:55:49.683376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:49.683376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O+d6JaSLDzXWTuKVjcw99ghKmjicI8IBgPi0LWEOAd4sp0/3m7VA7S6p7HGvyZGQFd906avoPBMfHHMrUs8gDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:49.683880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00488","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06ba86d0ba84094f1285dca175ec12b1f4d0d95c3e1f7ea1be574849afa408ce","sha256:d8acf002cc3771be09b4b4ed4948dc218181b06844ba5e376fd5dbedc9594ff7"],"state_sha256":"62600504d106be85b75622ecc1d89708c08e10a114cb73bcde371edd89ef62f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZlWK6VgbKtOm2Vdt8n0iYZlKDObl1YuDZQEoKP56HY0spMCK9R1VjQVDzfwVZ6Yfv8vaSraiHNQFUyK3G+2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:03:01.561338Z","bundle_sha256":"d432f3d56c1cb22d3e9113f1e9972020c78228af029ce31cf9900c883684837d"}}