{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YDLMUKA6KILWVEIZECAU45TSG3","short_pith_number":"pith:YDLMUKA6","canonical_record":{"source":{"id":"2507.15658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T14:21:13Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"cc193c74b289fed390fd22f960a6e89ea160fbd8668189347a9241440a17ae55","abstract_canon_sha256":"bd8da27732ec3381380c9e20c2cb7de2a906d187b1c9b7eb5760717b5c4b564e"},"schema_version":"1.0"},"canonical_sha256":"c0d6ca281e52176a911920814e767236f8a45fd023493ee75aa643f80b4db948","source":{"kind":"arxiv","id":"2507.15658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15658","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15658v1","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15658","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"YDLMUKA6KILW","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_16","alias_value":"YDLMUKA6KILWVEIZ","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_8","alias_value":"YDLMUKA6","created_at":"2026-07-05T11:40:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YDLMUKA6KILWVEIZECAU45TSG3","target":"record","payload":{"canonical_record":{"source":{"id":"2507.15658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T14:21:13Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"cc193c74b289fed390fd22f960a6e89ea160fbd8668189347a9241440a17ae55","abstract_canon_sha256":"bd8da27732ec3381380c9e20c2cb7de2a906d187b1c9b7eb5760717b5c4b564e"},"schema_version":"1.0"},"canonical_sha256":"c0d6ca281e52176a911920814e767236f8a45fd023493ee75aa643f80b4db948","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:41.576573Z","signature_b64":"ya1vlogrbpp3LV5LmiVNmds3N88Qez4zdXHCSc873Qy3xkRXy/IIirbzuwi9LQdgyznNl0QP+YM298Kh+bPnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d6ca281e52176a911920814e767236f8a45fd023493ee75aa643f80b4db948","last_reissued_at":"2026-07-05T11:40:41.575965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:41.575965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.15658","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:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wm9RS0LfUVf13n53oF1/c5nDyrLfvbPIdt3bYIzd7rTVmURmPUH8uEejwjZG2Hm/KMZXLLXlQv+Ry/hQiAoABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:07:42.980050Z"},"content_sha256":"ba31b53eafb1c56cc7743a51fb8e5ef271b15aafa28163f07678cf01588d20e6","schema_version":"1.0","event_id":"sha256:ba31b53eafb1c56cc7743a51fb8e5ef271b15aafa28163f07678cf01588d20e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YDLMUKA6KILWVEIZECAU45TSG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"cs.DS","authors_text":"Laurent Massouli\\'e, Romain Cosson","submitted_at":"2025-07-21T14:21:13Z","abstract_excerpt":"We study the problem of collective tree exploration in which a team of $k$ mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agents all start from the root and discover adjacent edges as they progress in the tree. Communication is distributed in the sense that agents share information by reading and writing on whiteboards located at all nodes. Movements are asynchronous, in the sense that the speeds of all agents are controlled by an adversary at all times. All previous competitive guarantees for collective tree exploration are either distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15658","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/2507.15658/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:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWp1Hl1esBaB/bs3I42OXPff2UT0GNsJnBeaB0iaBW/e7b3QEuYBibOsUFzGtRWTo6FX/MWEC6KT9IerSDcoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:07:42.980925Z"},"content_sha256":"26f1e7af5c1d0b2beb57696cd957c661be2f83e4f0e77c6b7ffd3acaad6442b4","schema_version":"1.0","event_id":"sha256:26f1e7af5c1d0b2beb57696cd957c661be2f83e4f0e77c6b7ffd3acaad6442b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDLMUKA6KILWVEIZECAU45TSG3/bundle.json","state_url":"https://pith.science/pith/YDLMUKA6KILWVEIZECAU45TSG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDLMUKA6KILWVEIZECAU45TSG3/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-09T19:07:42Z","links":{"resolver":"https://pith.science/pith/YDLMUKA6KILWVEIZECAU45TSG3","bundle":"https://pith.science/pith/YDLMUKA6KILWVEIZECAU45TSG3/bundle.json","state":"https://pith.science/pith/YDLMUKA6KILWVEIZECAU45TSG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDLMUKA6KILWVEIZECAU45TSG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YDLMUKA6KILWVEIZECAU45TSG3","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":"bd8da27732ec3381380c9e20c2cb7de2a906d187b1c9b7eb5760717b5c4b564e","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T14:21:13Z","title_canon_sha256":"cc193c74b289fed390fd22f960a6e89ea160fbd8668189347a9241440a17ae55"},"schema_version":"1.0","source":{"id":"2507.15658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15658","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15658v1","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15658","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"YDLMUKA6KILW","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_16","alias_value":"YDLMUKA6KILWVEIZ","created_at":"2026-07-05T11:40:41Z"},{"alias_kind":"pith_short_8","alias_value":"YDLMUKA6","created_at":"2026-07-05T11:40:41Z"}],"graph_snapshots":[{"event_id":"sha256:26f1e7af5c1d0b2beb57696cd957c661be2f83e4f0e77c6b7ffd3acaad6442b4","target":"graph","created_at":"2026-07-05T11:40:41Z","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/2507.15658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of collective tree exploration in which a team of $k$ mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agents all start from the root and discover adjacent edges as they progress in the tree. Communication is distributed in the sense that agents share information by reading and writing on whiteboards located at all nodes. Movements are asynchronous, in the sense that the speeds of all agents are controlled by an adversary at all times. All previous competitive guarantees for collective tree exploration are either distribut","authors_text":"Laurent Massouli\\'e, Romain Cosson","cross_cats":["cs.DC","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15658","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:ba31b53eafb1c56cc7743a51fb8e5ef271b15aafa28163f07678cf01588d20e6","target":"record","created_at":"2026-07-05T11:40:41Z","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":"bd8da27732ec3381380c9e20c2cb7de2a906d187b1c9b7eb5760717b5c4b564e","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T14:21:13Z","title_canon_sha256":"cc193c74b289fed390fd22f960a6e89ea160fbd8668189347a9241440a17ae55"},"schema_version":"1.0","source":{"id":"2507.15658","kind":"arxiv","version":1}},"canonical_sha256":"c0d6ca281e52176a911920814e767236f8a45fd023493ee75aa643f80b4db948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d6ca281e52176a911920814e767236f8a45fd023493ee75aa643f80b4db948","first_computed_at":"2026-07-05T11:40:41.575965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:41.575965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ya1vlogrbpp3LV5LmiVNmds3N88Qez4zdXHCSc873Qy3xkRXy/IIirbzuwi9LQdgyznNl0QP+YM298Kh+bPnAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:41.576573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.15658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba31b53eafb1c56cc7743a51fb8e5ef271b15aafa28163f07678cf01588d20e6","sha256:26f1e7af5c1d0b2beb57696cd957c661be2f83e4f0e77c6b7ffd3acaad6442b4"],"state_sha256":"0ec7232f74d3b41a2706683bb31f53911b8a781208e034213f3f67023852cf81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYDdOl4x6bceUFz1KAUu1362twWv3Lf75EirbZpg5pXxRJoTySKj5xY7tZ/XPLVH1GFPPgCGX5p6Oe+pJBNWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:07:42.989393Z","bundle_sha256":"101f942a1816b62133835fb5818b274b5b4cf3069a42b883e59209ecaddb4487"}}