{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:O4SY7JBU3XXZILME64IV5Y43MA","short_pith_number":"pith:O4SY7JBU","canonical_record":{"source":{"id":"2209.04800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"6bbc54e799f192add4d9914795baf112be130d72fb5923410d3b4e38efdc5a97","abstract_canon_sha256":"1e524cfe1e11e5b43da915dad28690d257ed04cd320f0b2476c7e2557bda8acf"},"schema_version":"1.0"},"canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","source":{"kind":"arxiv","id":"2209.04800","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.04800","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"2209.04800v3","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04800","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"O4SY7JBU3XXZ","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_16","alias_value":"O4SY7JBU3XXZILME","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_8","alias_value":"O4SY7JBU","created_at":"2026-07-05T10:11:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:O4SY7JBU3XXZILME64IV5Y43MA","target":"record","payload":{"canonical_record":{"source":{"id":"2209.04800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"6bbc54e799f192add4d9914795baf112be130d72fb5923410d3b4e38efdc5a97","abstract_canon_sha256":"1e524cfe1e11e5b43da915dad28690d257ed04cd320f0b2476c7e2557bda8acf"},"schema_version":"1.0"},"canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:11.897979Z","signature_b64":"2NU1Gu8lj92TYBRmZEpnlYkx57PrIn23PIjADC6it8YSbXz1Jj2xIP3YF7n8ryhuy4i+TZetGNYzrYGsLOZmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","last_reissued_at":"2026-07-05T10:11:11.897576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:11.897576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.04800","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-05T10:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vK7shjqaKln1tosKIUPC8bHd2K+/1rcgUV+mW3F6doWNI0h1EjTqZ2iq7GTguZmDptBo0e+IOvZTbkSSeUe2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:12:27.444935Z"},"content_sha256":"278f0e9b0098cf815d5bf746ff88d681ddeb47700a9f96cdf3adefb55020dfd7","schema_version":"1.0","event_id":"sha256:278f0e9b0098cf815d5bf746ff88d681ddeb47700a9f96cdf3adefb55020dfd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:O4SY7JBU3XXZILME64IV5Y43MA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-query Robotic Manipulator Task Sequencing with Gromov-Hausdorff Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fouad Sukkar, Jennifer Wakulicz, Ki Myung Brian Lee, Robert Fitch, Weiming Zhi","submitted_at":"2022-09-11T06:31:55Z","abstract_excerpt":"Robotic manipulator applications often require efficient online motion planning. When completing multiple tasks, sequence order and choice of goal configuration can have a drastic impact on planning performance. This is well known as the robot task sequencing problem (RTSP). Existing general-purpose RTSP algorithms are susceptible to producing poor-quality solutions or failing entirely when available computation time is restricted. We propose a new multi-query task sequencing method designed to operate in semi-structured environments with a combination of static and non-static obstacles. Our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04800","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/2209.04800/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-05T10:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+9z5KbiUvekXx7oDAxc7TPN40pphikaj4vGlQgj5ud9xVMnnP5C04hos+Aq9Ggw+uXw9MSMvcAVAaMYJVH1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:12:27.445426Z"},"content_sha256":"91dba9e7bd1617eafdcb99bb5f85d52416bc9fc5440e96bc9c06e0593c599981","schema_version":"1.0","event_id":"sha256:91dba9e7bd1617eafdcb99bb5f85d52416bc9fc5440e96bc9c06e0593c599981"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/bundle.json","state_url":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4SY7JBU3XXZILME64IV5Y43MA/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-08T11:12:27Z","links":{"resolver":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA","bundle":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/bundle.json","state":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4SY7JBU3XXZILME64IV5Y43MA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:O4SY7JBU3XXZILME64IV5Y43MA","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":"1e524cfe1e11e5b43da915dad28690d257ed04cd320f0b2476c7e2557bda8acf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","title_canon_sha256":"6bbc54e799f192add4d9914795baf112be130d72fb5923410d3b4e38efdc5a97"},"schema_version":"1.0","source":{"id":"2209.04800","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.04800","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"2209.04800v3","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04800","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"O4SY7JBU3XXZ","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_16","alias_value":"O4SY7JBU3XXZILME","created_at":"2026-07-05T10:11:11Z"},{"alias_kind":"pith_short_8","alias_value":"O4SY7JBU","created_at":"2026-07-05T10:11:11Z"}],"graph_snapshots":[{"event_id":"sha256:91dba9e7bd1617eafdcb99bb5f85d52416bc9fc5440e96bc9c06e0593c599981","target":"graph","created_at":"2026-07-05T10:11:11Z","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/2209.04800/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robotic manipulator applications often require efficient online motion planning. When completing multiple tasks, sequence order and choice of goal configuration can have a drastic impact on planning performance. This is well known as the robot task sequencing problem (RTSP). Existing general-purpose RTSP algorithms are susceptible to producing poor-quality solutions or failing entirely when available computation time is restricted. We propose a new multi-query task sequencing method designed to operate in semi-structured environments with a combination of static and non-static obstacles. Our m","authors_text":"Fouad Sukkar, Jennifer Wakulicz, Ki Myung Brian Lee, Robert Fitch, Weiming Zhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","title":"Multi-query Robotic Manipulator Task Sequencing with Gromov-Hausdorff Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04800","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:278f0e9b0098cf815d5bf746ff88d681ddeb47700a9f96cdf3adefb55020dfd7","target":"record","created_at":"2026-07-05T10:11:11Z","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":"1e524cfe1e11e5b43da915dad28690d257ed04cd320f0b2476c7e2557bda8acf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","title_canon_sha256":"6bbc54e799f192add4d9914795baf112be130d72fb5923410d3b4e38efdc5a97"},"schema_version":"1.0","source":{"id":"2209.04800","kind":"arxiv","version":3}},"canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","first_computed_at":"2026-07-05T10:11:11.897576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:11.897576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2NU1Gu8lj92TYBRmZEpnlYkx57PrIn23PIjADC6it8YSbXz1Jj2xIP3YF7n8ryhuy4i+TZetGNYzrYGsLOZmBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:11.897979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.04800","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:278f0e9b0098cf815d5bf746ff88d681ddeb47700a9f96cdf3adefb55020dfd7","sha256:91dba9e7bd1617eafdcb99bb5f85d52416bc9fc5440e96bc9c06e0593c599981"],"state_sha256":"82189192c6b2baba222a73ae76f0fb183d80a2fcddf32b9a94a56c27ae3bbc39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtfooxgalmYtJET8VZjlMLYfd3JtOrTlC9jMivMdisrYYgvSbkBc7nYiEr/FDwYugIEbDZNWeUq6L6VLr4KaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:12:27.449925Z","bundle_sha256":"05847fda98fc62fd8549d5f25557f84309b4cea2c37c7d8707410d77d046ec52"}}