{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W7E72MUDM4GLZLE72V77YRZ7BO","short_pith_number":"pith:W7E72MUD","canonical_record":{"source":{"id":"1802.10147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-27T20:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"3ae0311b8ad62dd4f5a61c0d76807dc3c422a2896b5fb4cd7ecafd91e9361c25","abstract_canon_sha256":"235ea022fa41ca9566d99a4eef6f590d6f1b3cfb53d45c12f19ec7ed345991e9"},"schema_version":"1.0"},"canonical_sha256":"b7c9fd3283670cbcac9fd57ffc473f0b9e42867e80dfae6e3e541047661c7704","source":{"kind":"arxiv","id":"1802.10147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10147","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10147v2","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10147","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"W7E72MUDM4GL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W7E72MUDM4GLZLE7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W7E72MUD","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W7E72MUDM4GLZLE72V77YRZ7BO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-27T20:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"3ae0311b8ad62dd4f5a61c0d76807dc3c422a2896b5fb4cd7ecafd91e9361c25","abstract_canon_sha256":"235ea022fa41ca9566d99a4eef6f590d6f1b3cfb53d45c12f19ec7ed345991e9"},"schema_version":"1.0"},"canonical_sha256":"b7c9fd3283670cbcac9fd57ffc473f0b9e42867e80dfae6e3e541047661c7704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.443149Z","signature_b64":"P8zjpUlxU9HKZJozH2aQWDA5GmOVV5im4cgOQmGD8JzxASjBClfZKXXfadYhJe5iJVXielgRJgqWZj0FtKO3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c9fd3283670cbcac9fd57ffc473f0b9e42867e80dfae6e3e541047661c7704","last_reissued_at":"2026-05-18T00:21:19.442551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.442551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10147","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-18T00:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O70Xb/mwRjllloZhYAt/YpXcqWpHDb1qNQKRUWcGEWLHLfHhHVUt1166H0ouyNMPDhN0JqGvjrzXvczsUTj+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:03:58.716188Z"},"content_sha256":"2786e4a4076d4de8606d35951e4b261ca89d3ffece36b651b7285942110b63f5","schema_version":"1.0","event_id":"sha256:2786e4a4076d4de8606d35951e4b261ca89d3ffece36b651b7285942110b63f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W7E72MUDM4GLZLE72V77YRZ7BO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-agent Time-based Decision-making for the Search and Action Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abel Gawel, Gregory Hitz, Marija Popovic, Roland Siegwart, Takahiro Miki","submitted_at":"2018-02-27T20:18:38Z","abstract_excerpt":"Many robotic applications, such as search-and-rescue, require multiple agents to search for and perform actions on targets. However, such missions present several challenges, including cooperative exploration, task selection and allocation, time limitations, and computational complexity. To address this, we propose a decentralized multi-agent decision-making framework for the search and action problem with time constraints. The main idea is to treat time as an allocated budget in a setting where each agent action incurs a time cost and yields a certain reward. Our approach leverages probabilis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10147","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-18T00:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DACgr0Q9R0ovQYYKF0B3FI1sBJqM/YtQKY+C+YMI/vfqM8iQZehrUIZyRY053ukpvGR29V9+jy6/aN3IL5laAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:03:58.716901Z"},"content_sha256":"e7ff6abc63ee2d65afa83d0cdfe1ffa4fb3e221f54e56e89be6b753b312d5b60","schema_version":"1.0","event_id":"sha256:e7ff6abc63ee2d65afa83d0cdfe1ffa4fb3e221f54e56e89be6b753b312d5b60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7E72MUDM4GLZLE72V77YRZ7BO/bundle.json","state_url":"https://pith.science/pith/W7E72MUDM4GLZLE72V77YRZ7BO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7E72MUDM4GLZLE72V77YRZ7BO/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-31T05:03:58Z","links":{"resolver":"https://pith.science/pith/W7E72MUDM4GLZLE72V77YRZ7BO","bundle":"https://pith.science/pith/W7E72MUDM4GLZLE72V77YRZ7BO/bundle.json","state":"https://pith.science/pith/W7E72MUDM4GLZLE72V77YRZ7BO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7E72MUDM4GLZLE72V77YRZ7BO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W7E72MUDM4GLZLE72V77YRZ7BO","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":"235ea022fa41ca9566d99a4eef6f590d6f1b3cfb53d45c12f19ec7ed345991e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-27T20:18:38Z","title_canon_sha256":"3ae0311b8ad62dd4f5a61c0d76807dc3c422a2896b5fb4cd7ecafd91e9361c25"},"schema_version":"1.0","source":{"id":"1802.10147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10147","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10147v2","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10147","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"W7E72MUDM4GL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W7E72MUDM4GLZLE7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W7E72MUD","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:e7ff6abc63ee2d65afa83d0cdfe1ffa4fb3e221f54e56e89be6b753b312d5b60","target":"graph","created_at":"2026-05-18T00:21:19Z","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":"Many robotic applications, such as search-and-rescue, require multiple agents to search for and perform actions on targets. However, such missions present several challenges, including cooperative exploration, task selection and allocation, time limitations, and computational complexity. To address this, we propose a decentralized multi-agent decision-making framework for the search and action problem with time constraints. The main idea is to treat time as an allocated budget in a setting where each agent action incurs a time cost and yields a certain reward. Our approach leverages probabilis","authors_text":"Abel Gawel, Gregory Hitz, Marija Popovic, Roland Siegwart, Takahiro Miki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-27T20:18:38Z","title":"Multi-agent Time-based Decision-making for the Search and Action Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10147","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:2786e4a4076d4de8606d35951e4b261ca89d3ffece36b651b7285942110b63f5","target":"record","created_at":"2026-05-18T00:21:19Z","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":"235ea022fa41ca9566d99a4eef6f590d6f1b3cfb53d45c12f19ec7ed345991e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-27T20:18:38Z","title_canon_sha256":"3ae0311b8ad62dd4f5a61c0d76807dc3c422a2896b5fb4cd7ecafd91e9361c25"},"schema_version":"1.0","source":{"id":"1802.10147","kind":"arxiv","version":2}},"canonical_sha256":"b7c9fd3283670cbcac9fd57ffc473f0b9e42867e80dfae6e3e541047661c7704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7c9fd3283670cbcac9fd57ffc473f0b9e42867e80dfae6e3e541047661c7704","first_computed_at":"2026-05-18T00:21:19.442551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:19.442551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P8zjpUlxU9HKZJozH2aQWDA5GmOVV5im4cgOQmGD8JzxASjBClfZKXXfadYhJe5iJVXielgRJgqWZj0FtKO3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:19.443149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2786e4a4076d4de8606d35951e4b261ca89d3ffece36b651b7285942110b63f5","sha256:e7ff6abc63ee2d65afa83d0cdfe1ffa4fb3e221f54e56e89be6b753b312d5b60"],"state_sha256":"ca514db48624a7bcf8fb55c2a35dec078ec7dac3767420ff0f7a6a752a8a4ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5zTYTs2wh6SYtS5TZz5v4e2yc0BIc1YlmFiFlGmge69TyLchTjwbr7PTTzOiSQM1maFYpxdieSVW8CWnvsJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:03:58.720620Z","bundle_sha256":"b527be733ca8c0f82e8a9054c67ee53d941a08f068e94b542d80ef3ff8efecb9"}}