{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RVX56KURQTZF2MXAVLT3SISAIV","short_pith_number":"pith:RVX56KUR","schema_version":"1.0","canonical_sha256":"8d6fdf2a9184f25d32e0aae7b92240455ddea5ca869017c42d8a0e9de71e9646","source":{"kind":"arxiv","id":"1908.08691","version":1},"attestation_state":"computed","paper":{"title":"On VR Spatial Query for Dual Entangled Worlds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"De-Nian Yang, Hsu-Chao Lai, Shao-Heng Ko, Wang-Chien Lee, Ying-Chun Lin","submitted_at":"2019-08-23T06:53:07Z","abstract_excerpt":"With the rapid advent of Virtual Reality (VR) technology and virtual tour applications, there is a research need on spatial queries tailored for simultaneous movements in both the physical and virtual worlds. Traditional spatial queries, designed mainly for one world, do not consider the entangled dual worlds in VR. In this paper, we first investigate the fundamental shortest-path query in VR as the building block for spatial queries, aiming to avoid hitting boundaries and obstacles in the physical environment by leveraging Redirected Walking (RW) in Computer Graphics. Specifically, we first f"},"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":"1908.08691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T06:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"135259ecb0f888fb490091468bbce5dc18e4b86e06bbb0f86c587e9086775749","abstract_canon_sha256":"a2ebc26765fc38993ed6bfd0f1f9a3766bdcb3722670a94bd169e6526fd34a56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:16.875019Z","signature_b64":"dvbyjKncheyw5Jmz/u7wyxW2rg23u7xledcU/qKVrJ8z83Z9Pi1T7Oxq/V2TazMnuwJ/rAp2gXghho/paoWFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6fdf2a9184f25d32e0aae7b92240455ddea5ca869017c42d8a0e9de71e9646","last_reissued_at":"2026-07-04T23:59:16.874624Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:16.874624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On VR Spatial Query for Dual Entangled Worlds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"De-Nian Yang, Hsu-Chao Lai, Shao-Heng Ko, Wang-Chien Lee, Ying-Chun Lin","submitted_at":"2019-08-23T06:53:07Z","abstract_excerpt":"With the rapid advent of Virtual Reality (VR) technology and virtual tour applications, there is a research need on spatial queries tailored for simultaneous movements in both the physical and virtual worlds. Traditional spatial queries, designed mainly for one world, do not consider the entangled dual worlds in VR. In this paper, we first investigate the fundamental shortest-path query in VR as the building block for spatial queries, aiming to avoid hitting boundaries and obstacles in the physical environment by leveraging Redirected Walking (RW) in Computer Graphics. Specifically, we first f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08691/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.08691","created_at":"2026-07-04T23:59:16.874681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08691v1","created_at":"2026-07-04T23:59:16.874681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08691","created_at":"2026-07-04T23:59:16.874681+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVX56KURQTZF","created_at":"2026-07-04T23:59:16.874681+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVX56KURQTZF2MXA","created_at":"2026-07-04T23:59:16.874681+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVX56KUR","created_at":"2026-07-04T23:59:16.874681+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/RVX56KURQTZF2MXAVLT3SISAIV","json":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV.json","graph_json":"https://pith.science/api/pith-number/RVX56KURQTZF2MXAVLT3SISAIV/graph.json","events_json":"https://pith.science/api/pith-number/RVX56KURQTZF2MXAVLT3SISAIV/events.json","paper":"https://pith.science/paper/RVX56KUR"},"agent_actions":{"view_html":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV","download_json":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV.json","view_paper":"https://pith.science/paper/RVX56KUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08691&json=true","fetch_graph":"https://pith.science/api/pith-number/RVX56KURQTZF2MXAVLT3SISAIV/graph.json","fetch_events":"https://pith.science/api/pith-number/RVX56KURQTZF2MXAVLT3SISAIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV/action/storage_attestation","attest_author":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV/action/author_attestation","sign_citation":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV/action/citation_signature","submit_replication":"https://pith.science/pith/RVX56KURQTZF2MXAVLT3SISAIV/action/replication_record"}},"created_at":"2026-07-04T23:59:16.874681+00:00","updated_at":"2026-07-04T23:59:16.874681+00:00"}