{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FQPFUUS3AQPI5ABUGZXVDJBLCI","short_pith_number":"pith:FQPFUUS3","canonical_record":{"source":{"id":"1705.03639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-10T07:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"1722c63ace225dd541c8573609dda3b57a5d1a3ed6fc2f7d59eac00a2984bf13","abstract_canon_sha256":"b8abb3be24ccb8c2e6e31a22597139927b7c8f20661a9b44289c720cd51cf8a6"},"schema_version":"1.0"},"canonical_sha256":"2c1e5a525b041e8e8034366f51a42b1223c29f0b3b865d2f5d885d3022200829","source":{"kind":"arxiv","id":"1705.03639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03639","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03639v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03639","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"FQPFUUS3AQPI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQPFUUS3AQPI5ABU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQPFUUS3","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FQPFUUS3AQPI5ABUGZXVDJBLCI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-10T07:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"1722c63ace225dd541c8573609dda3b57a5d1a3ed6fc2f7d59eac00a2984bf13","abstract_canon_sha256":"b8abb3be24ccb8c2e6e31a22597139927b7c8f20661a9b44289c720cd51cf8a6"},"schema_version":"1.0"},"canonical_sha256":"2c1e5a525b041e8e8034366f51a42b1223c29f0b3b865d2f5d885d3022200829","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.365866Z","signature_b64":"rpxGl0UHiSKCgltIPseH28XfMXleiyEdIWjVNpxYtRXX3IHpUcmCcSyVGU075C7uLohKx/QRd8C22RvTkpdZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c1e5a525b041e8e8034366f51a42b1223c29f0b3b865d2f5d885d3022200829","last_reissued_at":"2026-05-18T00:44:43.365321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.365321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03639","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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4xBJdc0N83hMQwBqrA3+NXG/QS9YmMmxU589aGT4aiIGtA3Fzs4QdoI4T3M8u3ahA3c3Ntu2BlKeanAuIVrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:36:36.252625Z"},"content_sha256":"e927f2442352d9a78cd830b173fa0317978b6474db0048e8b7b46f762e9e2b33","schema_version":"1.0","event_id":"sha256:e927f2442352d9a78cd830b173fa0317978b6474db0048e8b7b46f762e9e2b33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FQPFUUS3AQPI5ABUGZXVDJBLCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Interacting Gaussian Processes: Efficiency and Optimality Theorems of Autonomous Crowd Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Pete Trautman","submitted_at":"2017-05-10T07:39:58Z","abstract_excerpt":"We study the sparsity and optimality properties of crowd navigation and find that existing techniques do not satisfy both criteria simultaneously: either they achieve optimality with a prohibitive number of samples or tractability assumptions make them fragile to catastrophe. For example, if the human and robot are modeled independently, then tractability is attained but the planner is prone to overcautious or overaggressive behavior. For sampling based motion planning of joint human-robot cost functions, for $n_t$ agents and $T$ step lookahead, $\\mathcal O(2^{2n_t T})$ samples are needed for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03639","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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lB7zJ6LgY41+Ec8yHeGhR+WcvueWLDNBQcDt7V2Wygk6L4EaCREC9TeOk29V7mPgnyhHMmkUMdx5AoYDAzbKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:36:36.252971Z"},"content_sha256":"bbbb4a488c15c43a29b51620f3cc26566991e80d454bce0711bab0e857a3c41d","schema_version":"1.0","event_id":"sha256:bbbb4a488c15c43a29b51620f3cc26566991e80d454bce0711bab0e857a3c41d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/bundle.json","state_url":"https://pith.science/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/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-07-01T23:36:36Z","links":{"resolver":"https://pith.science/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI","bundle":"https://pith.science/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/bundle.json","state":"https://pith.science/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQPFUUS3AQPI5ABUGZXVDJBLCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FQPFUUS3AQPI5ABUGZXVDJBLCI","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":"b8abb3be24ccb8c2e6e31a22597139927b7c8f20661a9b44289c720cd51cf8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-10T07:39:58Z","title_canon_sha256":"1722c63ace225dd541c8573609dda3b57a5d1a3ed6fc2f7d59eac00a2984bf13"},"schema_version":"1.0","source":{"id":"1705.03639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03639","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03639v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03639","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"FQPFUUS3AQPI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQPFUUS3AQPI5ABU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQPFUUS3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:bbbb4a488c15c43a29b51620f3cc26566991e80d454bce0711bab0e857a3c41d","target":"graph","created_at":"2026-05-18T00:44:43Z","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 study the sparsity and optimality properties of crowd navigation and find that existing techniques do not satisfy both criteria simultaneously: either they achieve optimality with a prohibitive number of samples or tractability assumptions make them fragile to catastrophe. For example, if the human and robot are modeled independently, then tractability is attained but the planner is prone to overcautious or overaggressive behavior. For sampling based motion planning of joint human-robot cost functions, for $n_t$ agents and $T$ step lookahead, $\\mathcal O(2^{2n_t T})$ samples are needed for ","authors_text":"Pete Trautman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-10T07:39:58Z","title":"Sparse Interacting Gaussian Processes: Efficiency and Optimality Theorems of Autonomous Crowd Navigation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03639","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:e927f2442352d9a78cd830b173fa0317978b6474db0048e8b7b46f762e9e2b33","target":"record","created_at":"2026-05-18T00:44:43Z","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":"b8abb3be24ccb8c2e6e31a22597139927b7c8f20661a9b44289c720cd51cf8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-10T07:39:58Z","title_canon_sha256":"1722c63ace225dd541c8573609dda3b57a5d1a3ed6fc2f7d59eac00a2984bf13"},"schema_version":"1.0","source":{"id":"1705.03639","kind":"arxiv","version":1}},"canonical_sha256":"2c1e5a525b041e8e8034366f51a42b1223c29f0b3b865d2f5d885d3022200829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c1e5a525b041e8e8034366f51a42b1223c29f0b3b865d2f5d885d3022200829","first_computed_at":"2026-05-18T00:44:43.365321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.365321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpxGl0UHiSKCgltIPseH28XfMXleiyEdIWjVNpxYtRXX3IHpUcmCcSyVGU075C7uLohKx/QRd8C22RvTkpdZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.365866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e927f2442352d9a78cd830b173fa0317978b6474db0048e8b7b46f762e9e2b33","sha256:bbbb4a488c15c43a29b51620f3cc26566991e80d454bce0711bab0e857a3c41d"],"state_sha256":"c2bc12ecc71132f39607f00f6142f3da643f55fddc8167a0cdf8dd1aa4693d37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qx55n4Yavi/TgtciM6mQF0KMKw2MPQHY5og1FzqDdovT9oiIG3ujhJUlYrgpex6GIDuMBaIbk/j5d0xzNvtDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:36:36.255162Z","bundle_sha256":"c41c6712dee86324f4c21fca7cd7781d8af4508198cd30231f9d840a712743f9"}}