{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7ASOFPXJDZV2VRE5SCOZ42QFFO","short_pith_number":"pith:7ASOFPXJ","schema_version":"1.0","canonical_sha256":"f824e2bee91e6baac49d909d9e6a052ba2b3c9fe28b2d2fa3762d9a9738baa9b","source":{"kind":"arxiv","id":"1204.2955","version":2},"attestation_state":"computed","paper":{"title":"Label-Guided Graph Exploration with Adjustable Ratio of Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jijun Tang, Meng Zhang, Yi Zhang","submitted_at":"2012-04-13T11:19:06Z","abstract_excerpt":"The graph exploration problem is to visit all the nodes of a connected graph by a mobile entity, e.g., a robot. The robot has no a priori knowledge of the topology of the graph or of its size. Cohen et al. \\cite{Ilcinkas08} introduced label guided graph exploration which allows the system designer to add short labels to the graph nodes in a preprocessing stage; these labels can guide the robot in the exploration of the graph. In this paper, we address the problem of adjustable 1-bit label guided graph exploration. We focus on the labeling schemes that not only enable a robot to explore the gra"},"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":"1204.2955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T11:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"6e4b295210be9ce2be5936e45e8c2af7135afa8f7a27f849042ca5e28cf1d211","abstract_canon_sha256":"17d2ca54af6e16236c0e14689085d3596e1095c78abba209975f38163809bb30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:45.936205Z","signature_b64":"h99L95uSJAxeSdbRsItqrEUgdW626h3NTAvJDQpxEjgXzDF/UcslMj/BWiSYLd0UbUuB0Bch49gLPvNcoij6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f824e2bee91e6baac49d909d9e6a052ba2b3c9fe28b2d2fa3762d9a9738baa9b","last_reissued_at":"2026-05-18T03:56:45.935731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:45.935731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Label-Guided Graph Exploration with Adjustable Ratio of Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jijun Tang, Meng Zhang, Yi Zhang","submitted_at":"2012-04-13T11:19:06Z","abstract_excerpt":"The graph exploration problem is to visit all the nodes of a connected graph by a mobile entity, e.g., a robot. The robot has no a priori knowledge of the topology of the graph or of its size. Cohen et al. \\cite{Ilcinkas08} introduced label guided graph exploration which allows the system designer to add short labels to the graph nodes in a preprocessing stage; these labels can guide the robot in the exploration of the graph. In this paper, we address the problem of adjustable 1-bit label guided graph exploration. We focus on the labeling schemes that not only enable a robot to explore the gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2955","kind":"arxiv","version":2},"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":"1204.2955","created_at":"2026-05-18T03:56:45.935801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2955v2","created_at":"2026-05-18T03:56:45.935801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2955","created_at":"2026-05-18T03:56:45.935801+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ASOFPXJDZV2","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ASOFPXJDZV2VRE5","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ASOFPXJ","created_at":"2026-05-18T12:26:56.085431+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/7ASOFPXJDZV2VRE5SCOZ42QFFO","json":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO.json","graph_json":"https://pith.science/api/pith-number/7ASOFPXJDZV2VRE5SCOZ42QFFO/graph.json","events_json":"https://pith.science/api/pith-number/7ASOFPXJDZV2VRE5SCOZ42QFFO/events.json","paper":"https://pith.science/paper/7ASOFPXJ"},"agent_actions":{"view_html":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO","download_json":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO.json","view_paper":"https://pith.science/paper/7ASOFPXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2955&json=true","fetch_graph":"https://pith.science/api/pith-number/7ASOFPXJDZV2VRE5SCOZ42QFFO/graph.json","fetch_events":"https://pith.science/api/pith-number/7ASOFPXJDZV2VRE5SCOZ42QFFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO/action/storage_attestation","attest_author":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO/action/author_attestation","sign_citation":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO/action/citation_signature","submit_replication":"https://pith.science/pith/7ASOFPXJDZV2VRE5SCOZ42QFFO/action/replication_record"}},"created_at":"2026-05-18T03:56:45.935801+00:00","updated_at":"2026-05-18T03:56:45.935801+00:00"}