{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VTV4SPOELN2XIFE6GTY3D4NSXV","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":"2be18514f3b235efdb9d3fc49a2bd272b8ff0091f398d070d3e7a408d0f1523d","cross_cats_sorted":["cs.CG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T08:00:40Z","title_canon_sha256":"ec0e5ffc7d799bd060ab9ecdd6a63809ceb054efae7caa0263e5d5d9c10f25a7"},"schema_version":"1.0","source":{"id":"1607.07009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07009","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07009v2","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07009","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"VTV4SPOELN2X","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTV4SPOELN2XIFE6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTV4SPOE","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:f684dc84d5bc69016311541b5ad0e900cb9118fdfe180905c82ca73534c39bf8","target":"graph","created_at":"2026-05-18T01:09:41Z","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":"We present the `Basic S*' algorithm for computing shortest path through a metric simplicial complex. In particular, given a metric graph, $G$, which is constructed as a discrete representation of an underlying configuration space (a larger \"continuous\" space/manifold typically of dimension greater than one), we consider the Rips complex, $\\mathcal{R}(G)$, associated with it. Such a complex, and hence shortest paths in it, represent the underlying metric space more closely than what the graph does. While discrete graph representations of continuous spaces is convenient for motion planning in co","authors_text":"Subhrajit Bhattacharya","cross_cats":["cs.CG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T08:00:40Z","title":"A Search Algorithm for Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07009","kind":"arxiv","version":2},"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:a4459271450ebb51d60bb327ccb5baaff486feebe48ab93cfa0e734f2fc5b54c","target":"record","created_at":"2026-05-18T01:09:41Z","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":"2be18514f3b235efdb9d3fc49a2bd272b8ff0091f398d070d3e7a408d0f1523d","cross_cats_sorted":["cs.CG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T08:00:40Z","title_canon_sha256":"ec0e5ffc7d799bd060ab9ecdd6a63809ceb054efae7caa0263e5d5d9c10f25a7"},"schema_version":"1.0","source":{"id":"1607.07009","kind":"arxiv","version":2}},"canonical_sha256":"acebc93dc45b7574149e34f1b1f1b2bd6ed26292d9fbdf33ed1cf2c81f5d760e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acebc93dc45b7574149e34f1b1f1b2bd6ed26292d9fbdf33ed1cf2c81f5d760e","first_computed_at":"2026-05-18T01:09:41.292030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.292030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sTYhE688hPEBPle/VsLqZduIjvSKLiy3rgRgtxOkxdRK0vc8fLSbQm5K/p27YNa/f3D1aNcWhMM3sRyCIe2KBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.292492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4459271450ebb51d60bb327ccb5baaff486feebe48ab93cfa0e734f2fc5b54c","sha256:f684dc84d5bc69016311541b5ad0e900cb9118fdfe180905c82ca73534c39bf8"],"state_sha256":"0521456f3912e79d664c8010ba52cb57023ead94840bad3a9ab7ab9308ea8085"}