{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SOMJQHRTYEISFSW5ULB4Q3GUYQ","short_pith_number":"pith:SOMJQHRT","canonical_record":{"source":{"id":"1702.01524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-06T08:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"d0154d6ff01a940e9c1c9ea2fec2382267b08ea22e3a1767dfae62c154c6c59a","abstract_canon_sha256":"262cd8af68d8c45c11d6e76571f00738f5b11e9f8358fb89491698c4ffdd9f25"},"schema_version":"1.0"},"canonical_sha256":"9398981e33c11122cadda2c3c86cd4c42f5f6db5341c0d2bc1cddec0f67a19cc","source":{"kind":"arxiv","id":"1702.01524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01524","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01524v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01524","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"SOMJQHRTYEIS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOMJQHRTYEISFSW5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOMJQHRT","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SOMJQHRTYEISFSW5ULB4Q3GUYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-06T08:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"d0154d6ff01a940e9c1c9ea2fec2382267b08ea22e3a1767dfae62c154c6c59a","abstract_canon_sha256":"262cd8af68d8c45c11d6e76571f00738f5b11e9f8358fb89491698c4ffdd9f25"},"schema_version":"1.0"},"canonical_sha256":"9398981e33c11122cadda2c3c86cd4c42f5f6db5341c0d2bc1cddec0f67a19cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.143397Z","signature_b64":"deQ1qOHJukgvtkDAHEttu1eEtIcghPsgVpBBki2nuAZMPnQ4jYHIf6fJXbC+iZk2ulETXcBSm3bLRptRu4xIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9398981e33c11122cadda2c3c86cd4c42f5f6db5341c0d2bc1cddec0f67a19cc","last_reissued_at":"2026-05-18T00:51:23.142677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.142677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01524","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk4ncTZbDPInKNHpNmOZm0pQlrqG1JIGFArMXzmFICIddNhnkEsFIk7LM0WfYSj1DFt6ooi/h/0AUPhfWS7wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:10:39.119667Z"},"content_sha256":"b8f5d24ae2fbbade2301feed75520888e283c1062742c36a42c14d40b7d92fcb","schema_version":"1.0","event_id":"sha256:b8f5d24ae2fbbade2301feed75520888e283c1062742c36a42c14d40b7d92fcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SOMJQHRTYEISFSW5ULB4Q3GUYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hon Wai Leong, Shunhao Oh","submitted_at":"2017-02-06T08:01:16Z","abstract_excerpt":"In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of pre-processing. However, Visibility Graphs are known to perform poorly in terms of running time, especially on large, complex maps. In this paper, we introduce two improvements over the Visibility Graph Algorithm to compute optimal paths. Sparse Visibility Graphs (SVGs) are constructed by pruning unn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01524","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cy8Nddjm+QPCYUffIfpM3rhvHXhDuTRzW71T9B94YEcaFZK480kaP37lCtdTTzdgANP9T+BsWxs1IwggJiGxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:10:39.120392Z"},"content_sha256":"9ffade7fb6015e819e0ab45c43037fdc7726c9c54180cc18ce649a656b047ca0","schema_version":"1.0","event_id":"sha256:9ffade7fb6015e819e0ab45c43037fdc7726c9c54180cc18ce649a656b047ca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/bundle.json","state_url":"https://pith.science/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T17:10:39Z","links":{"resolver":"https://pith.science/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ","bundle":"https://pith.science/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/bundle.json","state":"https://pith.science/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOMJQHRTYEISFSW5ULB4Q3GUYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SOMJQHRTYEISFSW5ULB4Q3GUYQ","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":"262cd8af68d8c45c11d6e76571f00738f5b11e9f8358fb89491698c4ffdd9f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-06T08:01:16Z","title_canon_sha256":"d0154d6ff01a940e9c1c9ea2fec2382267b08ea22e3a1767dfae62c154c6c59a"},"schema_version":"1.0","source":{"id":"1702.01524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01524","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01524v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01524","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"SOMJQHRTYEIS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOMJQHRTYEISFSW5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOMJQHRT","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:9ffade7fb6015e819e0ab45c43037fdc7726c9c54180cc18ce649a656b047ca0","target":"graph","created_at":"2026-05-18T00:51:23Z","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":"In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of pre-processing. However, Visibility Graphs are known to perform poorly in terms of running time, especially on large, complex maps. In this paper, we introduce two improvements over the Visibility Graph Algorithm to compute optimal paths. Sparse Visibility Graphs (SVGs) are constructed by pruning unn","authors_text":"Hon Wai Leong, Shunhao Oh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-06T08:01:16Z","title":"Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01524","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:b8f5d24ae2fbbade2301feed75520888e283c1062742c36a42c14d40b7d92fcb","target":"record","created_at":"2026-05-18T00:51:23Z","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":"262cd8af68d8c45c11d6e76571f00738f5b11e9f8358fb89491698c4ffdd9f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-06T08:01:16Z","title_canon_sha256":"d0154d6ff01a940e9c1c9ea2fec2382267b08ea22e3a1767dfae62c154c6c59a"},"schema_version":"1.0","source":{"id":"1702.01524","kind":"arxiv","version":1}},"canonical_sha256":"9398981e33c11122cadda2c3c86cd4c42f5f6db5341c0d2bc1cddec0f67a19cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9398981e33c11122cadda2c3c86cd4c42f5f6db5341c0d2bc1cddec0f67a19cc","first_computed_at":"2026-05-18T00:51:23.142677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:23.142677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"deQ1qOHJukgvtkDAHEttu1eEtIcghPsgVpBBki2nuAZMPnQ4jYHIf6fJXbC+iZk2ulETXcBSm3bLRptRu4xIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:23.143397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8f5d24ae2fbbade2301feed75520888e283c1062742c36a42c14d40b7d92fcb","sha256:9ffade7fb6015e819e0ab45c43037fdc7726c9c54180cc18ce649a656b047ca0"],"state_sha256":"53dd8defbd28619ef60df32323d796c73766d1fddfdeef74cd4fb147a23f98b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCvMLyyPKASmF12wR0aiPetjUuYo8pVnXfU+13EIvsCpkWEbhTRZONQJ3HaQNbVqtxOInxjOmH3BCUkEggSeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:10:39.124151Z","bundle_sha256":"0f29f129767694f35854cf3b5dfb476cb1a4bf8750b46d8c69a368cdf62ccb4b"}}