{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3TX7OUYYIAJJUHL6H6DO5O372K","short_pith_number":"pith:3TX7OUYY","canonical_record":{"source":{"id":"1907.04396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-09T20:29:48Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"bf887918ec5224a013abd55ba216e63d267683dcfbc66e95a386e6b8d8f549cb","abstract_canon_sha256":"288de1b1ce1c5844be367f6230a3b0b67fe2cd6d86564a118d8c87d8e73b6018"},"schema_version":"1.0"},"canonical_sha256":"dceff7531840129a1d7e3f86eebb7fd29a0f62222d07ee3c7851c916d2a558e8","source":{"kind":"arxiv","id":"1907.04396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04396","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04396v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04396","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"3TX7OUYYIAJJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3TX7OUYYIAJJUHL6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3TX7OUYY","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3TX7OUYYIAJJUHL6H6DO5O372K","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-09T20:29:48Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"bf887918ec5224a013abd55ba216e63d267683dcfbc66e95a386e6b8d8f549cb","abstract_canon_sha256":"288de1b1ce1c5844be367f6230a3b0b67fe2cd6d86564a118d8c87d8e73b6018"},"schema_version":"1.0"},"canonical_sha256":"dceff7531840129a1d7e3f86eebb7fd29a0f62222d07ee3c7851c916d2a558e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.876353Z","signature_b64":"b9BKsNKYbD+jK5vheqZC2DpSOvn6ZbOpArxHfu0lLnDBdXNikMB2gG6iQUfANAx38cIjyzKioqTUTLDIae0sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dceff7531840129a1d7e3f86eebb7fd29a0f62222d07ee3c7851c916d2a558e8","last_reissued_at":"2026-05-17T23:41:01.875581Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.875581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04396","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LDmiDHnzvcEn05vMyHfFl6v0zrLxzPmWJoImuCG3mx2sxCH8OOUztfm5WXOvvneWQMEF0XE9uywd7MwdMuxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:25:07.828554Z"},"content_sha256":"9458c74189bfc5a825d4bc1e17ba15bf95ab1b597ff2cf53cc0c9eec3cba662a","schema_version":"1.0","event_id":"sha256:9458c74189bfc5a825d4bc1e17ba15bf95ab1b597ff2cf53cc0c9eec3cba662a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3TX7OUYYIAJJUHL6H6DO5O372K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Informative Path Planning with Local Penalization for Decentralized and Asynchronous Swarm Robotic Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Payam Ghassemi, Souma Chowdhury","submitted_at":"2019-07-09T20:29:48Z","abstract_excerpt":"Decentralized swarm robotic solutions to searching for targets that emit a spatially varying signal promise task parallelism, time efficiency, and fault tolerance. It is, however, challenging for swarm algorithms to offer scalability and efficiency, while preserving mathematical insights into the exhibited behavior. A new decentralized search method (called Bayes-Swarm), founded on batch Bayesian Optimization (BO) principles, is presented here to address these challenges. Unlike swarm heuristics approaches, Bayes-Swarm decouples the knowledge generation and task planning process, thus preservi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04396","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8oCN0WbTjggEK4/uhgzllNdbk+Fs2xbpL71fCeM3hpnOh9NvQmoJqbOiQue2wNeNUaFT2nwhQLRE22gneptDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:25:07.829225Z"},"content_sha256":"4d05058d982a60643a72fd0fdf35480cba6aa407c24926480494827afec276cc","schema_version":"1.0","event_id":"sha256:4d05058d982a60643a72fd0fdf35480cba6aa407c24926480494827afec276cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TX7OUYYIAJJUHL6H6DO5O372K/bundle.json","state_url":"https://pith.science/pith/3TX7OUYYIAJJUHL6H6DO5O372K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TX7OUYYIAJJUHL6H6DO5O372K/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-25T22:25:07Z","links":{"resolver":"https://pith.science/pith/3TX7OUYYIAJJUHL6H6DO5O372K","bundle":"https://pith.science/pith/3TX7OUYYIAJJUHL6H6DO5O372K/bundle.json","state":"https://pith.science/pith/3TX7OUYYIAJJUHL6H6DO5O372K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TX7OUYYIAJJUHL6H6DO5O372K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3TX7OUYYIAJJUHL6H6DO5O372K","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":"288de1b1ce1c5844be367f6230a3b0b67fe2cd6d86564a118d8c87d8e73b6018","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-09T20:29:48Z","title_canon_sha256":"bf887918ec5224a013abd55ba216e63d267683dcfbc66e95a386e6b8d8f549cb"},"schema_version":"1.0","source":{"id":"1907.04396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04396","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04396v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04396","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"3TX7OUYYIAJJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3TX7OUYYIAJJUHL6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3TX7OUYY","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:4d05058d982a60643a72fd0fdf35480cba6aa407c24926480494827afec276cc","target":"graph","created_at":"2026-05-17T23:41:01Z","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":"Decentralized swarm robotic solutions to searching for targets that emit a spatially varying signal promise task parallelism, time efficiency, and fault tolerance. It is, however, challenging for swarm algorithms to offer scalability and efficiency, while preserving mathematical insights into the exhibited behavior. A new decentralized search method (called Bayes-Swarm), founded on batch Bayesian Optimization (BO) principles, is presented here to address these challenges. Unlike swarm heuristics approaches, Bayes-Swarm decouples the knowledge generation and task planning process, thus preservi","authors_text":"Payam Ghassemi, Souma Chowdhury","cross_cats":["cs.AI","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-09T20:29:48Z","title":"Informative Path Planning with Local Penalization for Decentralized and Asynchronous Swarm Robotic Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04396","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:9458c74189bfc5a825d4bc1e17ba15bf95ab1b597ff2cf53cc0c9eec3cba662a","target":"record","created_at":"2026-05-17T23:41:01Z","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":"288de1b1ce1c5844be367f6230a3b0b67fe2cd6d86564a118d8c87d8e73b6018","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-09T20:29:48Z","title_canon_sha256":"bf887918ec5224a013abd55ba216e63d267683dcfbc66e95a386e6b8d8f549cb"},"schema_version":"1.0","source":{"id":"1907.04396","kind":"arxiv","version":1}},"canonical_sha256":"dceff7531840129a1d7e3f86eebb7fd29a0f62222d07ee3c7851c916d2a558e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dceff7531840129a1d7e3f86eebb7fd29a0f62222d07ee3c7851c916d2a558e8","first_computed_at":"2026-05-17T23:41:01.875581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.875581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b9BKsNKYbD+jK5vheqZC2DpSOvn6ZbOpArxHfu0lLnDBdXNikMB2gG6iQUfANAx38cIjyzKioqTUTLDIae0sDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.876353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9458c74189bfc5a825d4bc1e17ba15bf95ab1b597ff2cf53cc0c9eec3cba662a","sha256:4d05058d982a60643a72fd0fdf35480cba6aa407c24926480494827afec276cc"],"state_sha256":"16e2187288d7e7af5bbe03c3a5b60836877838275bcccbf0cc569442f4616fed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTolJWlYz7IJTvbXUpL2Pi7lPZQZYT50GG/cF81g1kuYAKP4xMMTdi9dXHScyXk0dJe5+UqkbysMiUxMVj+LAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:25:07.832708Z","bundle_sha256":"886a7f90fc90c26c9885e08daf148ee8f7c9d683869ffc1bb6a042002affcc9c"}}