{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T7OIQFFKF3KKGF4X3LI2GOCJE5","short_pith_number":"pith:T7OIQFFK","canonical_record":{"source":{"id":"1606.00285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-06-01T13:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"174392d983c87adf702f3bd89029fc185eb4727e347840a3ee05545adbbac818","abstract_canon_sha256":"3b14249f49b81b11c864d0f5c8aed58027387ce4d73a298462b6eda14120bd49"},"schema_version":"1.0"},"canonical_sha256":"9fdc8814aa2ed4a31797dad1a33849274d2667715d7bfd6c5c77f83e372f1f37","source":{"kind":"arxiv","id":"1606.00285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00285","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00285v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00285","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"T7OIQFFKF3KK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T7OIQFFKF3KKGF4X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T7OIQFFK","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T7OIQFFKF3KKGF4X3LI2GOCJE5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-06-01T13:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"174392d983c87adf702f3bd89029fc185eb4727e347840a3ee05545adbbac818","abstract_canon_sha256":"3b14249f49b81b11c864d0f5c8aed58027387ce4d73a298462b6eda14120bd49"},"schema_version":"1.0"},"canonical_sha256":"9fdc8814aa2ed4a31797dad1a33849274d2667715d7bfd6c5c77f83e372f1f37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.596886Z","signature_b64":"l/uY8+u/VpNIOCio2M8oM2NnzifDt5WcxiDnXj5npsZgV20ibU70HncpjGGt6OuxhClomVICVdDgz/gY8qAKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fdc8814aa2ed4a31797dad1a33849274d2667715d7bfd6c5c77f83e372f1f37","last_reissued_at":"2026-05-18T01:13:05.596533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.596533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00285","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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"188T8rqEbqLgu53UGuzs3HR4NOGflPe/vyNAMRjwk842fWPsau7aJODezapZg3Yy3pWcbM6e9xCjjwEdbdoxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:24.799427Z"},"content_sha256":"42364b01152a91483ecf6c292bd25df01706f4ac464630a3b2b6ca30ce7fb7ea","schema_version":"1.0","event_id":"sha256:42364b01152a91483ecf6c292bd25df01706f4ac464630a3b2b6ca30ce7fb7ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T7OIQFFKF3KKGF4X3LI2GOCJE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Monte Carlo Search With Data Aggregation to Improve Robot Soccer Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniele Nardi, Francesco Riccio, Roberto Capobianco","submitted_at":"2016-06-01T13:41:18Z","abstract_excerpt":"RoboCup soccer competitions are considered among the most challenging multi-robot adversarial environments, due to their high dynamism and the partial observability of the environment. In this paper we introduce a method based on a combination of Monte Carlo search and data aggregation (MCSDA) to adapt discrete-action soccer policies for a defender robot to the strategy of the opponent team. By exploiting a simple representation of the domain, a supervised learning algorithm is trained over an initial collection of data consisting of several simulations of human expert policies. Monte Carlo po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00285","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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iKYio//s0HpLcoOBTxtNWbpcd57rGpjuKUn6SW6OyZueWWq/VSEWo0H61pjq5gO4UH2nH5JyNXjCR/jLHdwrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:24.800146Z"},"content_sha256":"292d2b5af6724d10dd56260dba84bfabceb285d13e619aae409cd9e072493295","schema_version":"1.0","event_id":"sha256:292d2b5af6724d10dd56260dba84bfabceb285d13e619aae409cd9e072493295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/bundle.json","state_url":"https://pith.science/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/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-31T23:05:24Z","links":{"resolver":"https://pith.science/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5","bundle":"https://pith.science/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/bundle.json","state":"https://pith.science/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7OIQFFKF3KKGF4X3LI2GOCJE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T7OIQFFKF3KKGF4X3LI2GOCJE5","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":"3b14249f49b81b11c864d0f5c8aed58027387ce4d73a298462b6eda14120bd49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-06-01T13:41:18Z","title_canon_sha256":"174392d983c87adf702f3bd89029fc185eb4727e347840a3ee05545adbbac818"},"schema_version":"1.0","source":{"id":"1606.00285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00285","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00285v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00285","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"T7OIQFFKF3KK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T7OIQFFKF3KKGF4X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T7OIQFFK","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:292d2b5af6724d10dd56260dba84bfabceb285d13e619aae409cd9e072493295","target":"graph","created_at":"2026-05-18T01:13:05Z","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":"RoboCup soccer competitions are considered among the most challenging multi-robot adversarial environments, due to their high dynamism and the partial observability of the environment. In this paper we introduce a method based on a combination of Monte Carlo search and data aggregation (MCSDA) to adapt discrete-action soccer policies for a defender robot to the strategy of the opponent team. By exploiting a simple representation of the domain, a supervised learning algorithm is trained over an initial collection of data consisting of several simulations of human expert policies. Monte Carlo po","authors_text":"Daniele Nardi, Francesco Riccio, Roberto Capobianco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-06-01T13:41:18Z","title":"Using Monte Carlo Search With Data Aggregation to Improve Robot Soccer Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00285","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:42364b01152a91483ecf6c292bd25df01706f4ac464630a3b2b6ca30ce7fb7ea","target":"record","created_at":"2026-05-18T01:13:05Z","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":"3b14249f49b81b11c864d0f5c8aed58027387ce4d73a298462b6eda14120bd49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-06-01T13:41:18Z","title_canon_sha256":"174392d983c87adf702f3bd89029fc185eb4727e347840a3ee05545adbbac818"},"schema_version":"1.0","source":{"id":"1606.00285","kind":"arxiv","version":1}},"canonical_sha256":"9fdc8814aa2ed4a31797dad1a33849274d2667715d7bfd6c5c77f83e372f1f37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fdc8814aa2ed4a31797dad1a33849274d2667715d7bfd6c5c77f83e372f1f37","first_computed_at":"2026-05-18T01:13:05.596533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.596533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/uY8+u/VpNIOCio2M8oM2NnzifDt5WcxiDnXj5npsZgV20ibU70HncpjGGt6OuxhClomVICVdDgz/gY8qAKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.596886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42364b01152a91483ecf6c292bd25df01706f4ac464630a3b2b6ca30ce7fb7ea","sha256:292d2b5af6724d10dd56260dba84bfabceb285d13e619aae409cd9e072493295"],"state_sha256":"b9a05062d36f1490561acf6ed858730d879d2349cdaa2dd31f51769279de7c99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9c1xpAJ9kAZ7K+bXU9Sl9+obhUqC8KlLft+8stYwyK4qw/1Ql/wO+0wjhxTFMugV4asLSpKW6rxau1uDpdsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:05:24.804241Z","bundle_sha256":"d7d41d441b78cda12d33a26efb7abe6157cb07b8e855519da9ff4c5b2c82e4e1"}}