{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HTOSP3UWMQAYIDKF2KGPN3MS5N","short_pith_number":"pith:HTOSP3UW","canonical_record":{"source":{"id":"2508.10689","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-14T14:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"7eeeef33eb526207deeeae2828f54f22e7496092b82bf6daad46360d80e44da7","abstract_canon_sha256":"9aefbee4a5ba81bf5f3ae788eb43a3a9a7bbf588e8485f27b715d4829d27b968"},"schema_version":"1.0"},"canonical_sha256":"3cdd27ee966401840d45d28cf6ed92eb51fc1788ebbfe28ca292c9469a73b00c","source":{"kind":"arxiv","id":"2508.10689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.10689","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2508.10689v1","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10689","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"HTOSP3UWMQAY","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"HTOSP3UWMQAYIDKF","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"HTOSP3UW","created_at":"2026-07-05T11:54:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HTOSP3UWMQAYIDKF2KGPN3MS5N","target":"record","payload":{"canonical_record":{"source":{"id":"2508.10689","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-14T14:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"7eeeef33eb526207deeeae2828f54f22e7496092b82bf6daad46360d80e44da7","abstract_canon_sha256":"9aefbee4a5ba81bf5f3ae788eb43a3a9a7bbf588e8485f27b715d4829d27b968"},"schema_version":"1.0"},"canonical_sha256":"3cdd27ee966401840d45d28cf6ed92eb51fc1788ebbfe28ca292c9469a73b00c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:00.890839Z","signature_b64":"fUpeU+w1QSTUUTBibl9wMNvHt+9WMhjnj3wlHdAx2e6csfG0gXOlXfYSlM0WL8XEsbe3/qrTrwQLegivODjrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cdd27ee966401840d45d28cf6ed92eb51fc1788ebbfe28ca292c9469a73b00c","last_reissued_at":"2026-07-05T11:54:00.890398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:00.890398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.10689","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-05T11:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhZHZn3TclUH2LY6apdZQjbDm+ROfn8HYEmgKk+tUeUzw2oqeREc66KNSNP4PjxfrjX2s7VbcLrMevnusDtKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:52:02.809743Z"},"content_sha256":"df55d8826612975c983ced87f893412b4b788ed5c65237d98b026c7a4f85e847","schema_version":"1.0","event_id":"sha256:df55d8826612975c983ced87f893412b4b788ed5c65237d98b026c7a4f85e847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HTOSP3UWMQAYIDKF2KGPN3MS5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biasing Frontier-Based Exploration with Saliency Areas","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Francesco Amigoni, Giacomo Boracchi, Matteo Luperto, Nicola Basilico, Valerii Stakanov","submitted_at":"2025-08-14T14:33:24Z","abstract_excerpt":"Autonomous exploration is a widely studied problem where a robot incrementally builds a map of a previously unknown environment. The robot selects the next locations to reach using an exploration strategy. To do so, the robot has to balance between competing objectives, like exploring the entirety of the environment, while being as fast as possible. Most exploration strategies try to maximise the explored area to speed up exploration; however, they do not consider that parts of the environment are more important than others, as they lead to the discovery of large unknown areas. We propose a me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10689","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/2508.10689/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-05T11:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8O/EPap6O6pRKkCwwoRvcU4QbQvGc6zgSxyy9iviOAXvAE7Fby6nutr0DdBdnAgTUCHb2LmHKB1kSMkusErCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:52:02.810286Z"},"content_sha256":"0355469698e0722a89fd6d5cd4a75ae10afd16edeea226f8b6dee350cdcf09c8","schema_version":"1.0","event_id":"sha256:0355469698e0722a89fd6d5cd4a75ae10afd16edeea226f8b6dee350cdcf09c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/bundle.json","state_url":"https://pith.science/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/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-06T18:52:02Z","links":{"resolver":"https://pith.science/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N","bundle":"https://pith.science/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/bundle.json","state":"https://pith.science/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTOSP3UWMQAYIDKF2KGPN3MS5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HTOSP3UWMQAYIDKF2KGPN3MS5N","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":"9aefbee4a5ba81bf5f3ae788eb43a3a9a7bbf588e8485f27b715d4829d27b968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-14T14:33:24Z","title_canon_sha256":"7eeeef33eb526207deeeae2828f54f22e7496092b82bf6daad46360d80e44da7"},"schema_version":"1.0","source":{"id":"2508.10689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.10689","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2508.10689v1","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10689","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"HTOSP3UWMQAY","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"HTOSP3UWMQAYIDKF","created_at":"2026-07-05T11:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"HTOSP3UW","created_at":"2026-07-05T11:54:00Z"}],"graph_snapshots":[{"event_id":"sha256:0355469698e0722a89fd6d5cd4a75ae10afd16edeea226f8b6dee350cdcf09c8","target":"graph","created_at":"2026-07-05T11:54:00Z","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/2508.10689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Autonomous exploration is a widely studied problem where a robot incrementally builds a map of a previously unknown environment. The robot selects the next locations to reach using an exploration strategy. To do so, the robot has to balance between competing objectives, like exploring the entirety of the environment, while being as fast as possible. Most exploration strategies try to maximise the explored area to speed up exploration; however, they do not consider that parts of the environment are more important than others, as they lead to the discovery of large unknown areas. We propose a me","authors_text":"Francesco Amigoni, Giacomo Boracchi, Matteo Luperto, Nicola Basilico, Valerii Stakanov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-14T14:33:24Z","title":"Biasing Frontier-Based Exploration with Saliency Areas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10689","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:df55d8826612975c983ced87f893412b4b788ed5c65237d98b026c7a4f85e847","target":"record","created_at":"2026-07-05T11:54:00Z","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":"9aefbee4a5ba81bf5f3ae788eb43a3a9a7bbf588e8485f27b715d4829d27b968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-14T14:33:24Z","title_canon_sha256":"7eeeef33eb526207deeeae2828f54f22e7496092b82bf6daad46360d80e44da7"},"schema_version":"1.0","source":{"id":"2508.10689","kind":"arxiv","version":1}},"canonical_sha256":"3cdd27ee966401840d45d28cf6ed92eb51fc1788ebbfe28ca292c9469a73b00c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cdd27ee966401840d45d28cf6ed92eb51fc1788ebbfe28ca292c9469a73b00c","first_computed_at":"2026-07-05T11:54:00.890398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:00.890398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUpeU+w1QSTUUTBibl9wMNvHt+9WMhjnj3wlHdAx2e6csfG0gXOlXfYSlM0WL8XEsbe3/qrTrwQLegivODjrAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:00.890839Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.10689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df55d8826612975c983ced87f893412b4b788ed5c65237d98b026c7a4f85e847","sha256:0355469698e0722a89fd6d5cd4a75ae10afd16edeea226f8b6dee350cdcf09c8"],"state_sha256":"dc33ada8d768d3d719ca56334cbefdebadff70d90cbf82711651694017367303"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYeJV4KvSL98P+i5fW7Oxf/IecolnpU37bH0SHnrx8SCFTvVT9CmhuZ+/rX3tj/dKSOpVBHoZVV5H5FIM2YdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:52:02.814420Z","bundle_sha256":"1f70a9e111389c3b32f74abc4f26a0bb954a8792918da72eaa24a73de12caa79"}}