{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VTV4SPOELN2XIFE6GTY3D4NSXV","short_pith_number":"pith:VTV4SPOE","canonical_record":{"source":{"id":"1607.07009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T08:00:40Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"ec0e5ffc7d799bd060ab9ecdd6a63809ceb054efae7caa0263e5d5d9c10f25a7","abstract_canon_sha256":"2be18514f3b235efdb9d3fc49a2bd272b8ff0091f398d070d3e7a408d0f1523d"},"schema_version":"1.0"},"canonical_sha256":"acebc93dc45b7574149e34f1b1f1b2bd6ed26292d9fbdf33ed1cf2c81f5d760e","source":{"kind":"arxiv","id":"1607.07009","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VTV4SPOELN2XIFE6GTY3D4NSXV","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-24T08:00:40Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"ec0e5ffc7d799bd060ab9ecdd6a63809ceb054efae7caa0263e5d5d9c10f25a7","abstract_canon_sha256":"2be18514f3b235efdb9d3fc49a2bd272b8ff0091f398d070d3e7a408d0f1523d"},"schema_version":"1.0"},"canonical_sha256":"acebc93dc45b7574149e34f1b1f1b2bd6ed26292d9fbdf33ed1cf2c81f5d760e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.292492Z","signature_b64":"sTYhE688hPEBPle/VsLqZduIjvSKLiy3rgRgtxOkxdRK0vc8fLSbQm5K/p27YNa/f3D1aNcWhMM3sRyCIe2KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acebc93dc45b7574149e34f1b1f1b2bd6ed26292d9fbdf33ed1cf2c81f5d760e","last_reissued_at":"2026-05-18T01:09:41.292030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.292030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07009","source_version":2,"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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdxLEiHLVZfhETit0mV8LcPtxYoyqJw1hQO/tMIXpjvFaBxFZcYCqFIEgWjxETPnl97C/MRGTQv4ct/5rIlQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:33:58.928330Z"},"content_sha256":"a4459271450ebb51d60bb327ccb5baaff486feebe48ab93cfa0e734f2fc5b54c","schema_version":"1.0","event_id":"sha256:a4459271450ebb51d60bb327ccb5baaff486feebe48ab93cfa0e734f2fc5b54c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VTV4SPOELN2XIFE6GTY3D4NSXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Search Algorithm for Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DM","authors_text":"Subhrajit Bhattacharya","submitted_at":"2016-07-24T08:00:40Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07009","kind":"arxiv","version":2},"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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2W21DkQwiLET1IJXtsk+u5uqEoDv2xA3Mq+5JFPFv4+Tskrkj1THrPAfHD/JPJMGVFDYunQd23d9UCvPsQCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:33:58.928721Z"},"content_sha256":"f684dc84d5bc69016311541b5ad0e900cb9118fdfe180905c82ca73534c39bf8","schema_version":"1.0","event_id":"sha256:f684dc84d5bc69016311541b5ad0e900cb9118fdfe180905c82ca73534c39bf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/bundle.json","state_url":"https://pith.science/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/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-26T11:33:58Z","links":{"resolver":"https://pith.science/pith/VTV4SPOELN2XIFE6GTY3D4NSXV","bundle":"https://pith.science/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/bundle.json","state":"https://pith.science/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTV4SPOELN2XIFE6GTY3D4NSXV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAnTknTw8YQfj4g7KmOD9eOLZWWWCDCYPiNFLjwOSCCJ48ybvqq66eswDVNBy5OIm8xgThotyPEhtjIMg8ZpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:33:58.932033Z","bundle_sha256":"2b0d1917711f065510559b7d4c00691d0b67c76ed2b0950cfe197f1659b648c9"}}