{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HSWBH5JE4XQBDP22NICNLMFASS","short_pith_number":"pith:HSWBH5JE","canonical_record":{"source":{"id":"1610.01753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-06T07:07:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8cafbf65d709d70ce574dd7985c4096c54c4f4f716af9a97dc38a36edfb1d6bb","abstract_canon_sha256":"7a9a44a96e668e4b8ae7c629fa426e933b23630e2c9c36e1c7db7f795f1b863c"},"schema_version":"1.0"},"canonical_sha256":"3cac13f524e5e011bf5a6a04d5b0a0949cd0e2c0f51a3c8d4493b96d5b53eab1","source":{"kind":"arxiv","id":"1610.01753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01753","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01753v1","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01753","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"pith_short_12","alias_value":"HSWBH5JE4XQB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HSWBH5JE4XQBDP22","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HSWBH5JE","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HSWBH5JE4XQBDP22NICNLMFASS","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-06T07:07:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8cafbf65d709d70ce574dd7985c4096c54c4f4f716af9a97dc38a36edfb1d6bb","abstract_canon_sha256":"7a9a44a96e668e4b8ae7c629fa426e933b23630e2c9c36e1c7db7f795f1b863c"},"schema_version":"1.0"},"canonical_sha256":"3cac13f524e5e011bf5a6a04d5b0a0949cd0e2c0f51a3c8d4493b96d5b53eab1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:04.999289Z","signature_b64":"NQ1YpySNgmpbzVeHpnSk5HdZ1RiiPDvZSMry3dIZ9SU94SpQDoJ+/r8uOa1avmrOcvO0GNgZRUfC0SGLs+W1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cac13f524e5e011bf5a6a04d5b0a0949cd0e2c0f51a3c8d4493b96d5b53eab1","last_reissued_at":"2026-05-18T01:03:04.998649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:04.998649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01753","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-18T01:03:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlFQg1QFoVnHjfiKdjiouZBJaLgKJXzFHv4XVci0Z9FXc6B9Qu6I6O773nwdr1/wvOOfeg4tIxhzgJCP1OwXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:45.840219Z"},"content_sha256":"92ca497e78ef90e40ec7ffd02d4ad0a730cff7bf6e3971a29986bfb9df9612be","schema_version":"1.0","event_id":"sha256:92ca497e78ef90e40ec7ffd02d4ad0a730cff7bf6e3971a29986bfb9df9612be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HSWBH5JE4XQBDP22NICNLMFASS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general lower bound for collaborative tree exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Andreas Noever, Angelika Steger, Frank Mousset, Nemanja \\v{S}kori\\'c, Yann Disser","submitted_at":"2016-10-06T07:07:59Z","abstract_excerpt":"We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small ($k \\leq \\sqrt n$) and large ($k \\geq n$) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains.\n  First, we significantly extend a lower bound o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01753","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-18T01:03:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAnowxePuJYs/k/Wxzzn2EwjiGYeHNtezyt4CoEGiD61qtmKKN3nOjR1VJFJqT7GNth5i6YNezwHh1NcTlXfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:45.841191Z"},"content_sha256":"357fb96a717e59c2c51f1e55e409568de3f4396281f176d5c896a5acf662869b","schema_version":"1.0","event_id":"sha256:357fb96a717e59c2c51f1e55e409568de3f4396281f176d5c896a5acf662869b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSWBH5JE4XQBDP22NICNLMFASS/bundle.json","state_url":"https://pith.science/pith/HSWBH5JE4XQBDP22NICNLMFASS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSWBH5JE4XQBDP22NICNLMFASS/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-05-25T18:59:45Z","links":{"resolver":"https://pith.science/pith/HSWBH5JE4XQBDP22NICNLMFASS","bundle":"https://pith.science/pith/HSWBH5JE4XQBDP22NICNLMFASS/bundle.json","state":"https://pith.science/pith/HSWBH5JE4XQBDP22NICNLMFASS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSWBH5JE4XQBDP22NICNLMFASS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HSWBH5JE4XQBDP22NICNLMFASS","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":"7a9a44a96e668e4b8ae7c629fa426e933b23630e2c9c36e1c7db7f795f1b863c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-06T07:07:59Z","title_canon_sha256":"8cafbf65d709d70ce574dd7985c4096c54c4f4f716af9a97dc38a36edfb1d6bb"},"schema_version":"1.0","source":{"id":"1610.01753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01753","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01753v1","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01753","created_at":"2026-05-18T01:03:04Z"},{"alias_kind":"pith_short_12","alias_value":"HSWBH5JE4XQB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HSWBH5JE4XQBDP22","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HSWBH5JE","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:357fb96a717e59c2c51f1e55e409568de3f4396281f176d5c896a5acf662869b","target":"graph","created_at":"2026-05-18T01:03:04Z","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 collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small ($k \\leq \\sqrt n$) and large ($k \\geq n$) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains.\n  First, we significantly extend a lower bound o","authors_text":"Andreas Noever, Angelika Steger, Frank Mousset, Nemanja \\v{S}kori\\'c, Yann Disser","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-06T07:07:59Z","title":"A general lower bound for collaborative tree exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01753","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:92ca497e78ef90e40ec7ffd02d4ad0a730cff7bf6e3971a29986bfb9df9612be","target":"record","created_at":"2026-05-18T01:03:04Z","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":"7a9a44a96e668e4b8ae7c629fa426e933b23630e2c9c36e1c7db7f795f1b863c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-06T07:07:59Z","title_canon_sha256":"8cafbf65d709d70ce574dd7985c4096c54c4f4f716af9a97dc38a36edfb1d6bb"},"schema_version":"1.0","source":{"id":"1610.01753","kind":"arxiv","version":1}},"canonical_sha256":"3cac13f524e5e011bf5a6a04d5b0a0949cd0e2c0f51a3c8d4493b96d5b53eab1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cac13f524e5e011bf5a6a04d5b0a0949cd0e2c0f51a3c8d4493b96d5b53eab1","first_computed_at":"2026-05-18T01:03:04.998649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:04.998649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NQ1YpySNgmpbzVeHpnSk5HdZ1RiiPDvZSMry3dIZ9SU94SpQDoJ+/r8uOa1avmrOcvO0GNgZRUfC0SGLs+W1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:04.999289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92ca497e78ef90e40ec7ffd02d4ad0a730cff7bf6e3971a29986bfb9df9612be","sha256:357fb96a717e59c2c51f1e55e409568de3f4396281f176d5c896a5acf662869b"],"state_sha256":"d7a6bfad1f1baed098f97f89048d094e3342b2a1cd3a989f55195c63e42e0bfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24rk53dHvf6JxDEdTtfEIzxLJLYlQc3SNXv/WwGeS/QZzeoMT9T8uwiiuIxHgCCtNksIKcmXpA8FvJD8a/tBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:45.844997Z","bundle_sha256":"585be158dd52a6e37fb059d5faf6c283f04292d2c8e3fb81cde1782ef294f640"}}