{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6K7S3R736F262QZJELQ5KXC4EL","short_pith_number":"pith:6K7S3R73","canonical_record":{"source":{"id":"2006.00589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T19:15:28Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"3130ddb15f66c23e48a66ce0c2676164932f6500b77b5d1157c48bab9bca710e","abstract_canon_sha256":"11d68c0a12a20a92841717e28671b61eefe6f939c0b26ed9d62c1900f5f58022"},"schema_version":"1.0"},"canonical_sha256":"f2bf2dc7fbf175ed432922e1d55c5c22ceed6c90bdd3f31ea5c717b467ba4545","source":{"kind":"arxiv","id":"2006.00589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00589","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00589v1","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00589","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"6K7S3R736F26","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_16","alias_value":"6K7S3R736F262QZJ","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_8","alias_value":"6K7S3R73","created_at":"2026-07-05T01:07:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6K7S3R736F262QZJELQ5KXC4EL","target":"record","payload":{"canonical_record":{"source":{"id":"2006.00589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T19:15:28Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"3130ddb15f66c23e48a66ce0c2676164932f6500b77b5d1157c48bab9bca710e","abstract_canon_sha256":"11d68c0a12a20a92841717e28671b61eefe6f939c0b26ed9d62c1900f5f58022"},"schema_version":"1.0"},"canonical_sha256":"f2bf2dc7fbf175ed432922e1d55c5c22ceed6c90bdd3f31ea5c717b467ba4545","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:03.397253Z","signature_b64":"06eZ+U733gzBkw4/n51lqXzSaaQ4CBS+Fe4/5QDtHOg06NdePg1iv51Skw7/yEP9DstMqxR9JGIaQXJARpziAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2bf2dc7fbf175ed432922e1d55c5c22ceed6c90bdd3f31ea5c717b467ba4545","last_reissued_at":"2026-07-05T01:07:03.396761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:03.396761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.00589","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-07-05T01:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2E2rBbSJlUNd4Rh8Q02gt84ipPSQYpuKjs3ju54l7SxW3g7K8b6+2WsMC48zBnmajlxrJPDm4sh1u7rFVo/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:42:24.617338Z"},"content_sha256":"c122e45a4a3a2f9b1f1db9ae16bb912cb9707125775fc34f9f6571e631dfd981","schema_version":"1.0","event_id":"sha256:c122e45a4a3a2f9b1f1db9ae16bb912cb9707125775fc34f9f6571e631dfd981"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6K7S3R736F262QZJELQ5KXC4EL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep R-Learning for Continual Area Sweeping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Justin Hart, Peter Stone, Rishi Shah, Yuqian Jiang","submitted_at":"2020-05-31T19:15:28Z","abstract_excerpt":"Coverage path planning is a well-studied problem in robotics in which a robot must plan a path that passes through every point in a given area repeatedly, usually with a uniform frequency. To address the scenario in which some points need to be visited more frequently than others, this problem has been extended to non-uniform coverage planning. This paper considers the variant of non-uniform coverage in which the robot does not know the distribution of relevant events beforehand and must nevertheless learn to maximize the rate of detecting events of interest. This continual area sweeping probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00589","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.00589/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-05T01:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DK5wjUFs9DDwOPlGUyeXh1PhAdJ2giJm0gkYHfJBPW2hDS5NTAdsn+s2+aDbErhGBwbE1ty7y9j62fpbbXqGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:42:24.617720Z"},"content_sha256":"95e65f86aafb31823fd338e9eb071f389b1586489b7641a9021eb494fb8a8cee","schema_version":"1.0","event_id":"sha256:95e65f86aafb31823fd338e9eb071f389b1586489b7641a9021eb494fb8a8cee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6K7S3R736F262QZJELQ5KXC4EL/bundle.json","state_url":"https://pith.science/pith/6K7S3R736F262QZJELQ5KXC4EL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6K7S3R736F262QZJELQ5KXC4EL/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-07T08:42:24Z","links":{"resolver":"https://pith.science/pith/6K7S3R736F262QZJELQ5KXC4EL","bundle":"https://pith.science/pith/6K7S3R736F262QZJELQ5KXC4EL/bundle.json","state":"https://pith.science/pith/6K7S3R736F262QZJELQ5KXC4EL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6K7S3R736F262QZJELQ5KXC4EL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6K7S3R736F262QZJELQ5KXC4EL","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":"11d68c0a12a20a92841717e28671b61eefe6f939c0b26ed9d62c1900f5f58022","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T19:15:28Z","title_canon_sha256":"3130ddb15f66c23e48a66ce0c2676164932f6500b77b5d1157c48bab9bca710e"},"schema_version":"1.0","source":{"id":"2006.00589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00589","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00589v1","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00589","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"6K7S3R736F26","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_16","alias_value":"6K7S3R736F262QZJ","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_8","alias_value":"6K7S3R73","created_at":"2026-07-05T01:07:03Z"}],"graph_snapshots":[{"event_id":"sha256:95e65f86aafb31823fd338e9eb071f389b1586489b7641a9021eb494fb8a8cee","target":"graph","created_at":"2026-07-05T01:07:03Z","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/2006.00589/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coverage path planning is a well-studied problem in robotics in which a robot must plan a path that passes through every point in a given area repeatedly, usually with a uniform frequency. To address the scenario in which some points need to be visited more frequently than others, this problem has been extended to non-uniform coverage planning. This paper considers the variant of non-uniform coverage in which the robot does not know the distribution of relevant events beforehand and must nevertheless learn to maximize the rate of detecting events of interest. This continual area sweeping probl","authors_text":"Justin Hart, Peter Stone, Rishi Shah, Yuqian Jiang","cross_cats":["cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T19:15:28Z","title":"Deep R-Learning for Continual Area Sweeping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00589","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:c122e45a4a3a2f9b1f1db9ae16bb912cb9707125775fc34f9f6571e631dfd981","target":"record","created_at":"2026-07-05T01:07:03Z","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":"11d68c0a12a20a92841717e28671b61eefe6f939c0b26ed9d62c1900f5f58022","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T19:15:28Z","title_canon_sha256":"3130ddb15f66c23e48a66ce0c2676164932f6500b77b5d1157c48bab9bca710e"},"schema_version":"1.0","source":{"id":"2006.00589","kind":"arxiv","version":1}},"canonical_sha256":"f2bf2dc7fbf175ed432922e1d55c5c22ceed6c90bdd3f31ea5c717b467ba4545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2bf2dc7fbf175ed432922e1d55c5c22ceed6c90bdd3f31ea5c717b467ba4545","first_computed_at":"2026-07-05T01:07:03.396761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:03.396761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"06eZ+U733gzBkw4/n51lqXzSaaQ4CBS+Fe4/5QDtHOg06NdePg1iv51Skw7/yEP9DstMqxR9JGIaQXJARpziAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:03.397253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c122e45a4a3a2f9b1f1db9ae16bb912cb9707125775fc34f9f6571e631dfd981","sha256:95e65f86aafb31823fd338e9eb071f389b1586489b7641a9021eb494fb8a8cee"],"state_sha256":"6dbe08777e1e33bb9301eb28a5138f7f2f26da90b65fcb954ce429a91fedc549"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BX7uh4+NLfU8TP9JBCtJFXK3F2hvB4NxW2Jpl9Oct9ufrgDbEtlmRX9x9hbpnmMuOnHVRSAa8w7TOR1RZhFLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:42:24.619904Z","bundle_sha256":"911bd256a5f7ca5fc8437abac06b24c692fa470875b97ddd6335a4fb09f182a1"}}