{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XOKPNCKGAPNJJQUHZAW2YA6LED","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":"2a95d7a28a9f0d890f57da182dbc22647cf68f939155209566696bea9806dcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-18T18:01:16Z","title_canon_sha256":"0b4ebb4396b5496b4acba2071890868763eb79668c6fa26dc9e6c5e3a73f168c"},"schema_version":"1.0","source":{"id":"1603.05944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05944","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05944v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05944","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"XOKPNCKGAPNJ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XOKPNCKGAPNJJQUH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XOKPNCKG","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c6c8d8df0c17f9f70cd3705f7218df3ddc8b94c1f3409b7ac2ba054bee3caa1e","target":"graph","created_at":"2026-05-18T01:18:53Z","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 give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as the abstraction of a geometric exploration of a space by a robot, both of which have been extensively studied. We consider local exploration policies that use time-of-last- visit or alternatively least-frequently-visited local greedy strategies to select the next step in the exploration path. Both of these strategies were previously considered by Cooper et al. (2011) for a scenario in which counters for the last visi","authors_text":"Aditya Kumar Akash, Alejandro Lopez-Ortiz, Daniela Maftuleac, James McLurkin, Sandor P. Fekete, Seoung Kyou Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-18T18:01:16Z","title":"Lower Bounds for Graph Exploration Using Local Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05944","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:3052600140bbbf440c95c9c9a7f2c1887fb4040f773de3af2a822c1a0819e17d","target":"record","created_at":"2026-05-18T01:18:53Z","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":"2a95d7a28a9f0d890f57da182dbc22647cf68f939155209566696bea9806dcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-18T18:01:16Z","title_canon_sha256":"0b4ebb4396b5496b4acba2071890868763eb79668c6fa26dc9e6c5e3a73f168c"},"schema_version":"1.0","source":{"id":"1603.05944","kind":"arxiv","version":1}},"canonical_sha256":"bb94f6894603da94c287c82dac03cb20e5675dc357a4b7efcf6d7797d7bae552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb94f6894603da94c287c82dac03cb20e5675dc357a4b7efcf6d7797d7bae552","first_computed_at":"2026-05-18T01:18:53.232717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.232717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iOuT/1mChw10GFphOp5x7oBvBwfgIHnBlkHePfQFXEOW2Er/jGbxJP65gGiqt6Dmu7EHnsJKaW583gG9QPsJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.233195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3052600140bbbf440c95c9c9a7f2c1887fb4040f773de3af2a822c1a0819e17d","sha256:c6c8d8df0c17f9f70cd3705f7218df3ddc8b94c1f3409b7ac2ba054bee3caa1e"],"state_sha256":"d52720c0508eb4f27537a455d2e57ee61ad52b52db7e694a26901c0675ab5d40"}