{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:R5ZLXP4K5Z23QQG7LYXZDN37QQ","short_pith_number":"pith:R5ZLXP4K","canonical_record":{"source":{"id":"2011.01119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T16:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"019963585d9fcc191ef73de0e5cbc6f388661349944ed6123122e212e4078b92","abstract_canon_sha256":"9ee6418663d30d612c61755b9dc9c7c360b0a354e923d817280f833756c6e2cd"},"schema_version":"1.0"},"canonical_sha256":"8f72bbbf8aee75b840df5e2f91b77f840c7fe1bc48f91b24a45f03f6140865e8","source":{"kind":"arxiv","id":"2011.01119","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01119","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01119v3","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01119","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"R5ZLXP4K5Z23","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_16","alias_value":"R5ZLXP4K5Z23QQG7","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_8","alias_value":"R5ZLXP4K","created_at":"2026-07-05T03:01:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:R5ZLXP4K5Z23QQG7LYXZDN37QQ","target":"record","payload":{"canonical_record":{"source":{"id":"2011.01119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T16:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"019963585d9fcc191ef73de0e5cbc6f388661349944ed6123122e212e4078b92","abstract_canon_sha256":"9ee6418663d30d612c61755b9dc9c7c360b0a354e923d817280f833756c6e2cd"},"schema_version":"1.0"},"canonical_sha256":"8f72bbbf8aee75b840df5e2f91b77f840c7fe1bc48f91b24a45f03f6140865e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:53.598513Z","signature_b64":"iM2Mib3HbBcWJzijB/XqKOKaD6TWnQLp6opPwk+QeUfq66OZRFVrUsk6RwjlPulq497hmAY29+J6Rh0HLMtFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f72bbbf8aee75b840df5e2f91b77f840c7fe1bc48f91b24a45f03f6140865e8","last_reissued_at":"2026-07-05T03:01:53.598059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:53.598059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.01119","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-05T03:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leeizAtNkM+6pbJvaDLrMTH0GmRu/EkHVhuTDpWt703SBaOZGCTbVjZcZ5LYlhFSWt2d2+KNwjDzaRxbi2S8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:37:55.832545Z"},"content_sha256":"30ccd00dbc8dd10597d66f9bcc33a6b018ca81e1109a372facd8991c8daae74e","schema_version":"1.0","event_id":"sha256:30ccd00dbc8dd10597d66f9bcc33a6b018ca81e1109a372facd8991c8daae74e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:R5ZLXP4K5Z23QQG7LYXZDN37QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Robot Coverage and Exploration using Spatial Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Ribeiro, Ekaterina Tolstaya, James Paulos, Vijay Kumar","submitted_at":"2020-11-02T16:50:13Z","abstract_excerpt":"The multi-robot coverage problem is an essential building block for systems that perform tasks like inspection or search and rescue. We discretize the coverage problem to induce a spatial graph of locations and represent robots as nodes in the graph. Then, we train a Graph Neural Network controller that leverages the spatial equivariance of the task to imitate an expert open-loop routing solution. This approach generalizes well to much larger maps and larger teams that are intractable for the expert. In particular, the model generalizes effectively to a simulation of ten quadrotors and dozens "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01119","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/2011.01119/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-05T03:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MtkTyMWKl21QT8G7O+or1kmd++OkeHLnDRgEz+vQhFYXmJVYG1u67GA8CNLKalAJg59JKDj77/P67XYU9Q9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:37:55.833063Z"},"content_sha256":"6015bc37e830c02f2fce9dfd84d5bf43f3076d42af528e179c289fa68ee377ad","schema_version":"1.0","event_id":"sha256:6015bc37e830c02f2fce9dfd84d5bf43f3076d42af528e179c289fa68ee377ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/bundle.json","state_url":"https://pith.science/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/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-18T01:37:55Z","links":{"resolver":"https://pith.science/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ","bundle":"https://pith.science/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/bundle.json","state":"https://pith.science/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5ZLXP4K5Z23QQG7LYXZDN37QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:R5ZLXP4K5Z23QQG7LYXZDN37QQ","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":"9ee6418663d30d612c61755b9dc9c7c360b0a354e923d817280f833756c6e2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T16:50:13Z","title_canon_sha256":"019963585d9fcc191ef73de0e5cbc6f388661349944ed6123122e212e4078b92"},"schema_version":"1.0","source":{"id":"2011.01119","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01119","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01119v3","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01119","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"R5ZLXP4K5Z23","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_16","alias_value":"R5ZLXP4K5Z23QQG7","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_8","alias_value":"R5ZLXP4K","created_at":"2026-07-05T03:01:53Z"}],"graph_snapshots":[{"event_id":"sha256:6015bc37e830c02f2fce9dfd84d5bf43f3076d42af528e179c289fa68ee377ad","target":"graph","created_at":"2026-07-05T03:01:53Z","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/2011.01119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multi-robot coverage problem is an essential building block for systems that perform tasks like inspection or search and rescue. We discretize the coverage problem to induce a spatial graph of locations and represent robots as nodes in the graph. Then, we train a Graph Neural Network controller that leverages the spatial equivariance of the task to imitate an expert open-loop routing solution. This approach generalizes well to much larger maps and larger teams that are intractable for the expert. In particular, the model generalizes effectively to a simulation of ten quadrotors and dozens ","authors_text":"Alejandro Ribeiro, Ekaterina Tolstaya, James Paulos, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T16:50:13Z","title":"Multi-Robot Coverage and Exploration using Spatial Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01119","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:30ccd00dbc8dd10597d66f9bcc33a6b018ca81e1109a372facd8991c8daae74e","target":"record","created_at":"2026-07-05T03:01:53Z","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":"9ee6418663d30d612c61755b9dc9c7c360b0a354e923d817280f833756c6e2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T16:50:13Z","title_canon_sha256":"019963585d9fcc191ef73de0e5cbc6f388661349944ed6123122e212e4078b92"},"schema_version":"1.0","source":{"id":"2011.01119","kind":"arxiv","version":3}},"canonical_sha256":"8f72bbbf8aee75b840df5e2f91b77f840c7fe1bc48f91b24a45f03f6140865e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f72bbbf8aee75b840df5e2f91b77f840c7fe1bc48f91b24a45f03f6140865e8","first_computed_at":"2026-07-05T03:01:53.598059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:01:53.598059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iM2Mib3HbBcWJzijB/XqKOKaD6TWnQLp6opPwk+QeUfq66OZRFVrUsk6RwjlPulq497hmAY29+J6Rh0HLMtFCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:01:53.598513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.01119","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30ccd00dbc8dd10597d66f9bcc33a6b018ca81e1109a372facd8991c8daae74e","sha256:6015bc37e830c02f2fce9dfd84d5bf43f3076d42af528e179c289fa68ee377ad"],"state_sha256":"4562f631fa3525a25d802c6120fe5e6ae356f2fc48d6e9beb8c2e28916c7de89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plU/YN7Ai/cQhkvcUWLOZU5g9kcIsh+rFzcmxTEyFNhWgRSvmUUcEDFMCs3YSHOhPjWKJjcGFDOeE/V7FmffAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T01:37:55.838393Z","bundle_sha256":"94fc530db0a36fc08d2ee384e4c865939e84c8fff4aa4a79efce6a5a3df209da"}}