{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YTHSCZQGMILHT7YNQCOSI3MQ6W","short_pith_number":"pith:YTHSCZQG","canonical_record":{"source":{"id":"1208.0573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-08-02T18:46:26Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"55409b4ffc43bcf84826b505fb711310161a94852b45307d41858d41fff0d400","abstract_canon_sha256":"ce04469e45603b5240b986bf861120beb5abd57d1a6875ec57c594047257a0c2"},"schema_version":"1.0"},"canonical_sha256":"c4cf216606621679ff0d809d246d90f5bf6d894610d8f828d3b50d045aa58734","source":{"kind":"arxiv","id":"1208.0573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0573","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0573v1","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0573","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"YTHSCZQGMILH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YTHSCZQGMILHT7YN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YTHSCZQG","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YTHSCZQGMILHT7YNQCOSI3MQ6W","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-08-02T18:46:26Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"55409b4ffc43bcf84826b505fb711310161a94852b45307d41858d41fff0d400","abstract_canon_sha256":"ce04469e45603b5240b986bf861120beb5abd57d1a6875ec57c594047257a0c2"},"schema_version":"1.0"},"canonical_sha256":"c4cf216606621679ff0d809d246d90f5bf6d894610d8f828d3b50d045aa58734","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:33.727373Z","signature_b64":"z2lj/EQ/upXDx8HXQKMDOynt5sn6fYfuXhMshcjddV06JianOdfceIvykAkCOiMqR6DEoSHwEKwLyqBZSjhoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cf216606621679ff0d809d246d90f5bf6d894610d8f828d3b50d045aa58734","last_reissued_at":"2026-05-18T03:49:33.726629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:33.726629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0573","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-18T03:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaSpb7Lqv/YmkaCHzunvlfhZuS9zTmaaqJQWymyaZQ5WIQP9+mxmpdvsRp3Jml6eaHMVVlS3LfcsFv1/ZlWwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:58:33.086449Z"},"content_sha256":"bc22e1d1a77910db7feff6010475f65d1765ede8d45ca2999edb4a7f9e9690b1","schema_version":"1.0","event_id":"sha256:bc22e1d1a77910db7feff6010475f65d1765ede8d45ca2999edb4a7f9e9690b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YTHSCZQGMILHT7YNQCOSI3MQ6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invariants for Homology Classes with Application to Optimal Search and Planning Problem in Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.AT","authors_text":"David Lipsky, Robert Ghrist, Subhrajit Bhattacharya, Vijay Kumar","submitted_at":"2012-08-02T18:46:26Z","abstract_excerpt":"We consider planning problems on a punctured Euclidean spaces, $\\mathbb{R}^D - \\widetilde{\\mathcal{O}}$, where $\\widetilde{\\mathcal{O}}$ is a collection of obstacles. Such spaces are of frequent occurrence as configuration spaces of robots, where $\\widetilde{\\mathcal{O}}$ represent either physical obstacles that the robots need to avoid (e.g., walls, other robots, etc.) or illegal states (e.g., all legs off-the-ground). As state-planning is translated to path-planning on a configuration space, we collate equivalent plannings via topologically-equivalent paths. This prompts finding or exploring"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0573","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-18T03:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wf6j697luHzHhYTF25k7RdhtG9jrmPF7Hi+HCTtZPnW3Ohy/JCPkirVHs0T21HD4BQALhdK5hLQjbGBn6fhlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:58:33.087173Z"},"content_sha256":"2e516e48e63a2ff80be4d1c7f3482ec1f9718cc2fc928aa6af4cc9db049da82a","schema_version":"1.0","event_id":"sha256:2e516e48e63a2ff80be4d1c7f3482ec1f9718cc2fc928aa6af4cc9db049da82a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/bundle.json","state_url":"https://pith.science/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/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-25T13:58:33Z","links":{"resolver":"https://pith.science/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W","bundle":"https://pith.science/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/bundle.json","state":"https://pith.science/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTHSCZQGMILHT7YNQCOSI3MQ6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YTHSCZQGMILHT7YNQCOSI3MQ6W","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":"ce04469e45603b5240b986bf861120beb5abd57d1a6875ec57c594047257a0c2","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-08-02T18:46:26Z","title_canon_sha256":"55409b4ffc43bcf84826b505fb711310161a94852b45307d41858d41fff0d400"},"schema_version":"1.0","source":{"id":"1208.0573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0573","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0573v1","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0573","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"YTHSCZQGMILH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YTHSCZQGMILHT7YN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YTHSCZQG","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:2e516e48e63a2ff80be4d1c7f3482ec1f9718cc2fc928aa6af4cc9db049da82a","target":"graph","created_at":"2026-05-18T03:49:33Z","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 consider planning problems on a punctured Euclidean spaces, $\\mathbb{R}^D - \\widetilde{\\mathcal{O}}$, where $\\widetilde{\\mathcal{O}}$ is a collection of obstacles. Such spaces are of frequent occurrence as configuration spaces of robots, where $\\widetilde{\\mathcal{O}}$ represent either physical obstacles that the robots need to avoid (e.g., walls, other robots, etc.) or illegal states (e.g., all legs off-the-ground). As state-planning is translated to path-planning on a configuration space, we collate equivalent plannings via topologically-equivalent paths. This prompts finding or exploring","authors_text":"David Lipsky, Robert Ghrist, Subhrajit Bhattacharya, Vijay Kumar","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-08-02T18:46:26Z","title":"Invariants for Homology Classes with Application to Optimal Search and Planning Problem in Robotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0573","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:bc22e1d1a77910db7feff6010475f65d1765ede8d45ca2999edb4a7f9e9690b1","target":"record","created_at":"2026-05-18T03:49:33Z","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":"ce04469e45603b5240b986bf861120beb5abd57d1a6875ec57c594047257a0c2","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-08-02T18:46:26Z","title_canon_sha256":"55409b4ffc43bcf84826b505fb711310161a94852b45307d41858d41fff0d400"},"schema_version":"1.0","source":{"id":"1208.0573","kind":"arxiv","version":1}},"canonical_sha256":"c4cf216606621679ff0d809d246d90f5bf6d894610d8f828d3b50d045aa58734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4cf216606621679ff0d809d246d90f5bf6d894610d8f828d3b50d045aa58734","first_computed_at":"2026-05-18T03:49:33.726629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:33.726629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2lj/EQ/upXDx8HXQKMDOynt5sn6fYfuXhMshcjddV06JianOdfceIvykAkCOiMqR6DEoSHwEKwLyqBZSjhoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:33.727373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc22e1d1a77910db7feff6010475f65d1765ede8d45ca2999edb4a7f9e9690b1","sha256:2e516e48e63a2ff80be4d1c7f3482ec1f9718cc2fc928aa6af4cc9db049da82a"],"state_sha256":"cce1a8e0a0843cc5bc68eb374bb945b8ccee46ee9ff694319369da1733b84188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4Q9xGAvgJZuXsEup0TO2dy2W9F9akngxW3nxrTuAAchVnXWLu5l5JDzXCIDYG5GkkkPOFm56UYxFV61lwB4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:58:33.090793Z","bundle_sha256":"e8216c7204a78103655bfc5bfaf4def03f1cf1273b033cc23eb5c02aafb08e4b"}}