{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NEOTBPZAQCFGZQNA5XY23IKK7L","short_pith_number":"pith:NEOTBPZA","canonical_record":{"source":{"id":"1811.00797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-02T09:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"564a7ddb54013b1ae379b062d2b80f08fa214dcfbd4192a2738a1ead07cf6310","abstract_canon_sha256":"3f1fbff408614d1240b211847aa8306d21acce34203b930ea6d3a7f2fe65a469"},"schema_version":"1.0"},"canonical_sha256":"691d30bf20808a6cc1a0edf1ada14afac0155306e1aacab17a3af198c89c3e8a","source":{"kind":"arxiv","id":"1811.00797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00797","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00797v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00797","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"NEOTBPZAQCFG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NEOTBPZAQCFGZQNA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NEOTBPZA","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NEOTBPZAQCFGZQNA5XY23IKK7L","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-02T09:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"564a7ddb54013b1ae379b062d2b80f08fa214dcfbd4192a2738a1ead07cf6310","abstract_canon_sha256":"3f1fbff408614d1240b211847aa8306d21acce34203b930ea6d3a7f2fe65a469"},"schema_version":"1.0"},"canonical_sha256":"691d30bf20808a6cc1a0edf1ada14afac0155306e1aacab17a3af198c89c3e8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.097330Z","signature_b64":"R2l/ZhyU8TnwCni30FDBeJuEM/Xt/I5KowbljNbrA7BGhqS8NCpvP/dfRGEShCbjJzDEMXU/hruCEvvDMcu2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691d30bf20808a6cc1a0edf1ada14afac0155306e1aacab17a3af198c89c3e8a","last_reissued_at":"2026-05-18T00:01:42.096765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.096765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00797","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0rbESeS3FKAIgAMhBDY0CNsg+yexkk1UMN8TC9wX0V/6r137mMibVTwiXzZR1Yjg8Qkoq3DYzKiGAYfinrjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:35:20.826205Z"},"content_sha256":"d23d80c5b3bbae98028ac1806dd326b7dcce1a74d35635276ad45a2b66e9a631","schema_version":"1.0","event_id":"sha256:d23d80c5b3bbae98028ac1806dd326b7dcce1a74d35635276ad45a2b66e9a631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NEOTBPZAQCFGZQNA5XY23IKK7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"eLIAN: Enhanced Algorithm for Angle-constrained Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"(2) National Research University Higher School of Economics, 3, (3) Federal Research Center ''Computer Science, 4) ((1) Peoples' Friendship University of Russia, (4) Moscow Institute of Physics, Anton Andreychuk (1), Control'' of Russian Academy of Sciences, Konstantin Yakovlev (2, Natalia Soboleva (2), Technology )","submitted_at":"2018-11-02T09:54:35Z","abstract_excerpt":"Problem of finding 2D paths of special shape, e.g. paths comprised of line segments having the property that the angle between any two consecutive segments does not exceed the predefined threshold, is considered in the paper. This problem is harder to solve than the one when shortest paths of any shape are sought, since the planer's search space is substantially bigger as multiple search nodes corresponding to the same location need to be considered. One way to reduce the search effort is to fix the length of the path's segment and to prune the nodes that violate the imposed constraint. This l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00797","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nsEnKLJqn0PPCB2neoLuUtlNvi5ZBC4xmJ9R/LD8/1gW9+5AsteZCcioyVGNuRCoNl/qsdr2sKZbr3azCJCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:35:20.826960Z"},"content_sha256":"e608805a07391552a835341ec959dbeb52fa9dbcc7c9ff9a97b82bca286c1284","schema_version":"1.0","event_id":"sha256:e608805a07391552a835341ec959dbeb52fa9dbcc7c9ff9a97b82bca286c1284"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/bundle.json","state_url":"https://pith.science/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/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-08T19:35:20Z","links":{"resolver":"https://pith.science/pith/NEOTBPZAQCFGZQNA5XY23IKK7L","bundle":"https://pith.science/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/bundle.json","state":"https://pith.science/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEOTBPZAQCFGZQNA5XY23IKK7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NEOTBPZAQCFGZQNA5XY23IKK7L","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":"3f1fbff408614d1240b211847aa8306d21acce34203b930ea6d3a7f2fe65a469","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-02T09:54:35Z","title_canon_sha256":"564a7ddb54013b1ae379b062d2b80f08fa214dcfbd4192a2738a1ead07cf6310"},"schema_version":"1.0","source":{"id":"1811.00797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00797","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00797v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00797","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"NEOTBPZAQCFG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NEOTBPZAQCFGZQNA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NEOTBPZA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:e608805a07391552a835341ec959dbeb52fa9dbcc7c9ff9a97b82bca286c1284","target":"graph","created_at":"2026-05-18T00:01:42Z","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":"Problem of finding 2D paths of special shape, e.g. paths comprised of line segments having the property that the angle between any two consecutive segments does not exceed the predefined threshold, is considered in the paper. This problem is harder to solve than the one when shortest paths of any shape are sought, since the planer's search space is substantially bigger as multiple search nodes corresponding to the same location need to be considered. One way to reduce the search effort is to fix the length of the path's segment and to prune the nodes that violate the imposed constraint. This l","authors_text":"(2) National Research University Higher School of Economics, 3, (3) Federal Research Center ''Computer Science, 4) ((1) Peoples' Friendship University of Russia, (4) Moscow Institute of Physics, Anton Andreychuk (1), Control'' of Russian Academy of Sciences, Konstantin Yakovlev (2, Natalia Soboleva (2), Technology )","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-02T09:54:35Z","title":"eLIAN: Enhanced Algorithm for Angle-constrained Path Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00797","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:d23d80c5b3bbae98028ac1806dd326b7dcce1a74d35635276ad45a2b66e9a631","target":"record","created_at":"2026-05-18T00:01:42Z","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":"3f1fbff408614d1240b211847aa8306d21acce34203b930ea6d3a7f2fe65a469","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-02T09:54:35Z","title_canon_sha256":"564a7ddb54013b1ae379b062d2b80f08fa214dcfbd4192a2738a1ead07cf6310"},"schema_version":"1.0","source":{"id":"1811.00797","kind":"arxiv","version":1}},"canonical_sha256":"691d30bf20808a6cc1a0edf1ada14afac0155306e1aacab17a3af198c89c3e8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691d30bf20808a6cc1a0edf1ada14afac0155306e1aacab17a3af198c89c3e8a","first_computed_at":"2026-05-18T00:01:42.096765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.096765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2l/ZhyU8TnwCni30FDBeJuEM/Xt/I5KowbljNbrA7BGhqS8NCpvP/dfRGEShCbjJzDEMXU/hruCEvvDMcu2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.097330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d23d80c5b3bbae98028ac1806dd326b7dcce1a74d35635276ad45a2b66e9a631","sha256:e608805a07391552a835341ec959dbeb52fa9dbcc7c9ff9a97b82bca286c1284"],"state_sha256":"7f24b8279ced6363d6add0726a06bab53993bf4060dd9b603d1d50b7ade09c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yz/BCjghk651to0oXRnV/Uive247uLpYxxWUU4rPgO6XkcNOnnwaXxtnUYHxVHewrnVxPX321dupM6qSYpNoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:35:20.831719Z","bundle_sha256":"26c9dbf020f03580cdde89ceec694bfa1e28b393f6c77f7371a009ddfc7e2841"}}