{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XOKPNCKGAPNJJQUHZAW2YA6LED","short_pith_number":"pith:XOKPNCKG","schema_version":"1.0","canonical_sha256":"bb94f6894603da94c287c82dac03cb20e5675dc357a4b7efcf6d7797d7bae552","source":{"kind":"arxiv","id":"1603.05944","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Graph Exploration Using Local Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Aditya Kumar Akash, Alejandro Lopez-Ortiz, Daniela Maftuleac, James McLurkin, Sandor P. Fekete, Seoung Kyou Lee","submitted_at":"2016-03-18T18:01:16Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.05944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-18T18:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"0b4ebb4396b5496b4acba2071890868763eb79668c6fa26dc9e6c5e3a73f168c","abstract_canon_sha256":"2a95d7a28a9f0d890f57da182dbc22647cf68f939155209566696bea9806dcd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.233195Z","signature_b64":"iOuT/1mChw10GFphOp5x7oBvBwfgIHnBlkHePfQFXEOW2Er/jGbxJP65gGiqt6Dmu7EHnsJKaW583gG9QPsJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb94f6894603da94c287c82dac03cb20e5675dc357a4b7efcf6d7797d7bae552","last_reissued_at":"2026-05-18T01:18:53.232717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.232717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Graph Exploration Using Local Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Aditya Kumar Akash, Alejandro Lopez-Ortiz, Daniela Maftuleac, James McLurkin, Sandor P. Fekete, Seoung Kyou Lee","submitted_at":"2016-03-18T18:01:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05944","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.05944","created_at":"2026-05-18T01:18:53.232789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05944v1","created_at":"2026-05-18T01:18:53.232789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05944","created_at":"2026-05-18T01:18:53.232789+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOKPNCKGAPNJ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOKPNCKGAPNJJQUH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOKPNCKG","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED","json":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED.json","graph_json":"https://pith.science/api/pith-number/XOKPNCKGAPNJJQUHZAW2YA6LED/graph.json","events_json":"https://pith.science/api/pith-number/XOKPNCKGAPNJJQUHZAW2YA6LED/events.json","paper":"https://pith.science/paper/XOKPNCKG"},"agent_actions":{"view_html":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED","download_json":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED.json","view_paper":"https://pith.science/paper/XOKPNCKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05944&json=true","fetch_graph":"https://pith.science/api/pith-number/XOKPNCKGAPNJJQUHZAW2YA6LED/graph.json","fetch_events":"https://pith.science/api/pith-number/XOKPNCKGAPNJJQUHZAW2YA6LED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED/action/storage_attestation","attest_author":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED/action/author_attestation","sign_citation":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED/action/citation_signature","submit_replication":"https://pith.science/pith/XOKPNCKGAPNJJQUHZAW2YA6LED/action/replication_record"}},"created_at":"2026-05-18T01:18:53.232789+00:00","updated_at":"2026-05-18T01:18:53.232789+00:00"}