{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JXYBQUT6R45IYDMCRPGZX33LVT","short_pith_number":"pith:JXYBQUT6","canonical_record":{"source":{"id":"1802.06636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T14:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"bcd07071ea477eccc9318516c12a370840642ff29df80a2c77318cde36e96ee5","abstract_canon_sha256":"f2dff5258c7ba0bbe179c5c50dbe17b93bbf544537720c6ca609f603b67b7c57"},"schema_version":"1.0"},"canonical_sha256":"4df018527e8f3a8c0d828bcd9bef6bace6bc778d1fb2f11c8db7b841eb3e6778","source":{"kind":"arxiv","id":"1802.06636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06636","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06636v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06636","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"JXYBQUT6R45I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JXYBQUT6R45IYDMC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JXYBQUT6","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JXYBQUT6R45IYDMCRPGZX33LVT","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T14:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"bcd07071ea477eccc9318516c12a370840642ff29df80a2c77318cde36e96ee5","abstract_canon_sha256":"f2dff5258c7ba0bbe179c5c50dbe17b93bbf544537720c6ca609f603b67b7c57"},"schema_version":"1.0"},"canonical_sha256":"4df018527e8f3a8c0d828bcd9bef6bace6bc778d1fb2f11c8db7b841eb3e6778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.708390Z","signature_b64":"1uqMi1Nyhs/rx9acMaf/kLyz9M20ft4y0DFmrJL3/QMvHMUP5laC2E5lsqBM8veixJjNjTkkhDnERW8t2VH8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df018527e8f3a8c0d828bcd9bef6bace6bc778d1fb2f11c8db7b841eb3e6778","last_reissued_at":"2026-05-18T00:23:02.707718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.707718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06636","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-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DduyvkSlHOxwUMox/+n56jywiqYhz1P3nGjNczYK9lfMs93ikUeQohFaijM9dG44ZCadOV1hF+nABXcUci4WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:19:25.192952Z"},"content_sha256":"c2426b9d7aa03519cf20c0fb8da6d98441046761eb6dfea46bca5e4e8dc0c5f7","schema_version":"1.0","event_id":"sha256:c2426b9d7aa03519cf20c0fb8da6d98441046761eb6dfea46bca5e4e8dc0c5f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JXYBQUT6R45IYDMCRPGZX33LVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Exploration of Trees with Energy-Constrained Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christina Karousatou, Evangelos Bampas, Jan Hackfeld, J\\'er\\'emie Chalopin, Shantanu Das","submitted_at":"2018-02-19T14:11:50Z","abstract_excerpt":"We consider the problem of exploring an unknown tree with a team of $k$ initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than $B$ edges. The goal is to maximize the number of nodes collectively visited by all agents during the execution. Initially, the agents have no knowledge about the structure of the tree, but they gradually discover the topology as they traverse new edges. We assume that the agents can communicate with each other at arbitrary distances. Therefore the knowledge obtained by one agent after traversing an edge is instantan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06636","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-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yv1NBUWq7MbfqwOXUatA4Hkuz389W8KKaJEMBkqC1sGolbdG57E0ZC1NJyjzLnK5Q2SJK7lY+3qJ6RjUAj65Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:19:25.193297Z"},"content_sha256":"dd4024c211ca57e5550da58345459623af1d70dd5345e92bf61491fe2e78fdde","schema_version":"1.0","event_id":"sha256:dd4024c211ca57e5550da58345459623af1d70dd5345e92bf61491fe2e78fdde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXYBQUT6R45IYDMCRPGZX33LVT/bundle.json","state_url":"https://pith.science/pith/JXYBQUT6R45IYDMCRPGZX33LVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXYBQUT6R45IYDMCRPGZX33LVT/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-06-03T19:19:25Z","links":{"resolver":"https://pith.science/pith/JXYBQUT6R45IYDMCRPGZX33LVT","bundle":"https://pith.science/pith/JXYBQUT6R45IYDMCRPGZX33LVT/bundle.json","state":"https://pith.science/pith/JXYBQUT6R45IYDMCRPGZX33LVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXYBQUT6R45IYDMCRPGZX33LVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JXYBQUT6R45IYDMCRPGZX33LVT","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":"f2dff5258c7ba0bbe179c5c50dbe17b93bbf544537720c6ca609f603b67b7c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T14:11:50Z","title_canon_sha256":"bcd07071ea477eccc9318516c12a370840642ff29df80a2c77318cde36e96ee5"},"schema_version":"1.0","source":{"id":"1802.06636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06636","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06636v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06636","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"JXYBQUT6R45I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JXYBQUT6R45IYDMC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JXYBQUT6","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:dd4024c211ca57e5550da58345459623af1d70dd5345e92bf61491fe2e78fdde","target":"graph","created_at":"2026-05-18T00:23:02Z","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":"We consider the problem of exploring an unknown tree with a team of $k$ initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than $B$ edges. The goal is to maximize the number of nodes collectively visited by all agents during the execution. Initially, the agents have no knowledge about the structure of the tree, but they gradually discover the topology as they traverse new edges. We assume that the agents can communicate with each other at arbitrary distances. Therefore the knowledge obtained by one agent after traversing an edge is instantan","authors_text":"Christina Karousatou, Evangelos Bampas, Jan Hackfeld, J\\'er\\'emie Chalopin, Shantanu Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T14:11:50Z","title":"Maximal Exploration of Trees with Energy-Constrained Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06636","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:c2426b9d7aa03519cf20c0fb8da6d98441046761eb6dfea46bca5e4e8dc0c5f7","target":"record","created_at":"2026-05-18T00:23:02Z","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":"f2dff5258c7ba0bbe179c5c50dbe17b93bbf544537720c6ca609f603b67b7c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T14:11:50Z","title_canon_sha256":"bcd07071ea477eccc9318516c12a370840642ff29df80a2c77318cde36e96ee5"},"schema_version":"1.0","source":{"id":"1802.06636","kind":"arxiv","version":1}},"canonical_sha256":"4df018527e8f3a8c0d828bcd9bef6bace6bc778d1fb2f11c8db7b841eb3e6778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4df018527e8f3a8c0d828bcd9bef6bace6bc778d1fb2f11c8db7b841eb3e6778","first_computed_at":"2026-05-18T00:23:02.707718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:02.707718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1uqMi1Nyhs/rx9acMaf/kLyz9M20ft4y0DFmrJL3/QMvHMUP5laC2E5lsqBM8veixJjNjTkkhDnERW8t2VH8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:02.708390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2426b9d7aa03519cf20c0fb8da6d98441046761eb6dfea46bca5e4e8dc0c5f7","sha256:dd4024c211ca57e5550da58345459623af1d70dd5345e92bf61491fe2e78fdde"],"state_sha256":"f420db676a6f9242c5ba28749e85bc0bfdb10c672510a6835e0d1a44cdbcaad7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xR/uruvtMd8ZNJjeyqCtIHerpncjAoZ7sNHRwZWKCTM8iiYI5pJZw9M+/QrbGBw6Z939EwZOUdVoNA2+cAbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:19:25.195215Z","bundle_sha256":"f31a0744f7203b82035c020268b9674e671323b619e65c458be0914d0a71092d"}}