{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DPKYBBBKPTOXX6ABJUZ4EWO5KR","short_pith_number":"pith:DPKYBBBK","schema_version":"1.0","canonical_sha256":"1bd580842a7cdd7bf8014d33c259dd5452306fe3b1e4ba75ce44ab28846dbbf0","source":{"kind":"arxiv","id":"1611.00934","version":1},"attestation_state":"computed","paper":{"title":"Online Exploration of Rectangular Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Hans-Joachim B\\\"ockenhauer, Janosch Fuchs, Ulla Karhum\\\"aki, Walter Unger","submitted_at":"2016-11-03T09:48:13Z","abstract_excerpt":"In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visiting all vertices of the graph at least once. The hardness of this task heavily depends on the knowledge and the capabilities of the agent. In our model, the agent sees the whole graph in advance, but does not know the weights of the edges. As soon as it arrives in a vertex, it can see the weights of all the outgoing edges. We consider the special case of two different edge weights $1$ and $k$ and prove that the probl"},"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":"1611.00934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T09:48:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b19f7fae23353b946036ea3bc2fe95f77b08d67f10f368d97f0cd6f083c55891","abstract_canon_sha256":"0ea1c1917d2fe84775ef36dac852edd476eabe87e03f4255f1dc417344e79fb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:18.190100Z","signature_b64":"e/5lL2HZhc4s6Rso/H5D0j0Z76pdHE0ac/oDAggcfVhR8TEVNgZrSaRPixVJQaXxAdo8TjXchoPenmwdW/iECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd580842a7cdd7bf8014d33c259dd5452306fe3b1e4ba75ce44ab28846dbbf0","last_reissued_at":"2026-05-18T01:00:18.189498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:18.189498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Exploration of Rectangular Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Hans-Joachim B\\\"ockenhauer, Janosch Fuchs, Ulla Karhum\\\"aki, Walter Unger","submitted_at":"2016-11-03T09:48:13Z","abstract_excerpt":"In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visiting all vertices of the graph at least once. The hardness of this task heavily depends on the knowledge and the capabilities of the agent. In our model, the agent sees the whole graph in advance, but does not know the weights of the edges. As soon as it arrives in a vertex, it can see the weights of all the outgoing edges. We consider the special case of two different edge weights $1$ and $k$ and prove that the probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00934","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":"1611.00934","created_at":"2026-05-18T01:00:18.189625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00934v1","created_at":"2026-05-18T01:00:18.189625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00934","created_at":"2026-05-18T01:00:18.189625+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPKYBBBKPTOX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPKYBBBKPTOXX6AB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPKYBBBK","created_at":"2026-05-18T12:30:12.583610+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/DPKYBBBKPTOXX6ABJUZ4EWO5KR","json":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR.json","graph_json":"https://pith.science/api/pith-number/DPKYBBBKPTOXX6ABJUZ4EWO5KR/graph.json","events_json":"https://pith.science/api/pith-number/DPKYBBBKPTOXX6ABJUZ4EWO5KR/events.json","paper":"https://pith.science/paper/DPKYBBBK"},"agent_actions":{"view_html":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR","download_json":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR.json","view_paper":"https://pith.science/paper/DPKYBBBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00934&json=true","fetch_graph":"https://pith.science/api/pith-number/DPKYBBBKPTOXX6ABJUZ4EWO5KR/graph.json","fetch_events":"https://pith.science/api/pith-number/DPKYBBBKPTOXX6ABJUZ4EWO5KR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR/action/storage_attestation","attest_author":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR/action/author_attestation","sign_citation":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR/action/citation_signature","submit_replication":"https://pith.science/pith/DPKYBBBKPTOXX6ABJUZ4EWO5KR/action/replication_record"}},"created_at":"2026-05-18T01:00:18.189625+00:00","updated_at":"2026-05-18T01:00:18.189625+00:00"}