{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AGJ2Y7KCVVVUYR26QT5EU5FRQG","short_pith_number":"pith:AGJ2Y7KC","canonical_record":{"source":{"id":"1908.01499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-05T07:41:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c66ac5e04b52071f0fa746acdf092ff4f673b83f330e6f6f146348a9ac22e7e","abstract_canon_sha256":"19214fcb841fc27a8d6b24893ca85faea12a9abe1744428ffa55c07e629e119e"},"schema_version":"1.0"},"canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","source":{"kind":"arxiv","id":"1908.01499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01499","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01499v1","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01499","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_12","alias_value":"AGJ2Y7KCVVVU","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_16","alias_value":"AGJ2Y7KCVVVUYR26","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_8","alias_value":"AGJ2Y7KC","created_at":"2026-07-04T23:51:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AGJ2Y7KCVVVUYR26QT5EU5FRQG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-05T07:41:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c66ac5e04b52071f0fa746acdf092ff4f673b83f330e6f6f146348a9ac22e7e","abstract_canon_sha256":"19214fcb841fc27a8d6b24893ca85faea12a9abe1744428ffa55c07e629e119e"},"schema_version":"1.0"},"canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:31.031835Z","signature_b64":"SP0Jh1E6IAN3O8gZuYc8BCYj6s9cZoYF4mdshsT3DgynUbtQHp3cEJUdIHb26eV3nZdH8EZ/fLOEvQSqSu+/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","last_reissued_at":"2026-07-04T23:51:31.031497Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:31.031497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01499","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-07-04T23:51:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6R3I+9NsTjOkScm7CopssDqaS4awFHcz2+kbzh6OQuo2HsoZ+DppC+8LrPNXN2gS56lq5jPvYO37RzajPfZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:04:33.551804Z"},"content_sha256":"c7aa084ed887725b8be750b980532b4cd525cf5121e22d5b34050cc4a8e6164f","schema_version":"1.0","event_id":"sha256:c7aa084ed887725b8be750b980532b4cd525cf5121e22d5b34050cc4a8e6164f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AGJ2Y7KCVVVUYR26QT5EU5FRQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GAN Path Finder: Preliminary results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Konstantin Yakovlev, Natalia Soboleva","submitted_at":"2019-08-05T07:41:41Z","abstract_excerpt":"2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as an image generation task and to solve it utilizing the recent advances in deep learning. In this work we make an attempt to apply a generative neural network as a path finder and report preliminary results, convincing enough to claim that this direction of research is worth furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01499","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.01499/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"},"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-07-04T23:51:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3lTDRWsVPgsnOOSIL3SbwofjdIYzeQ1XZXOOa2rOUh4fphnRjuSdw3dQnktWtly8fPIMl/f9WRxEwa+WDisBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:04:33.552744Z"},"content_sha256":"228604610f6ad455782997c9c6020b4d29ab3d367ddbac3fd8644eee139bfbb2","schema_version":"1.0","event_id":"sha256:228604610f6ad455782997c9c6020b4d29ab3d367ddbac3fd8644eee139bfbb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/bundle.json","state_url":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/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-08-16T08:04:33Z","links":{"resolver":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG","bundle":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/bundle.json","state":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AGJ2Y7KCVVVUYR26QT5EU5FRQG","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":"19214fcb841fc27a8d6b24893ca85faea12a9abe1744428ffa55c07e629e119e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-05T07:41:41Z","title_canon_sha256":"6c66ac5e04b52071f0fa746acdf092ff4f673b83f330e6f6f146348a9ac22e7e"},"schema_version":"1.0","source":{"id":"1908.01499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01499","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01499v1","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01499","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_12","alias_value":"AGJ2Y7KCVVVU","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_16","alias_value":"AGJ2Y7KCVVVUYR26","created_at":"2026-07-04T23:51:31Z"},{"alias_kind":"pith_short_8","alias_value":"AGJ2Y7KC","created_at":"2026-07-04T23:51:31Z"}],"graph_snapshots":[{"event_id":"sha256:228604610f6ad455782997c9c6020b4d29ab3d367ddbac3fd8644eee139bfbb2","target":"graph","created_at":"2026-07-04T23:51:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01499/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as an image generation task and to solve it utilizing the recent advances in deep learning. In this work we make an attempt to apply a generative neural network as a path finder and report preliminary results, convincing enough to claim that this direction of research is worth furt","authors_text":"Konstantin Yakovlev, Natalia Soboleva","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-05T07:41:41Z","title":"GAN Path Finder: Preliminary results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01499","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:c7aa084ed887725b8be750b980532b4cd525cf5121e22d5b34050cc4a8e6164f","target":"record","created_at":"2026-07-04T23:51:31Z","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":"19214fcb841fc27a8d6b24893ca85faea12a9abe1744428ffa55c07e629e119e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-05T07:41:41Z","title_canon_sha256":"6c66ac5e04b52071f0fa746acdf092ff4f673b83f330e6f6f146348a9ac22e7e"},"schema_version":"1.0","source":{"id":"1908.01499","kind":"arxiv","version":1}},"canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","first_computed_at":"2026-07-04T23:51:31.031497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:31.031497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SP0Jh1E6IAN3O8gZuYc8BCYj6s9cZoYF4mdshsT3DgynUbtQHp3cEJUdIHb26eV3nZdH8EZ/fLOEvQSqSu+/BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:31.031835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7aa084ed887725b8be750b980532b4cd525cf5121e22d5b34050cc4a8e6164f","sha256:228604610f6ad455782997c9c6020b4d29ab3d367ddbac3fd8644eee139bfbb2"],"state_sha256":"36865c4ba9f547e454abbe81bec2410ff32ccb7aa7f82d3d0232c8f249e3473b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhvOEm5q+VMdE7n1DH2Lq5FjjiGcNnp2D7IlcYjKprmqNasXmCmlf4df2QTD/hO0Xh5NbEcREGiMwVk/HU79AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:04:33.570198Z","bundle_sha256":"9c0a4dddb0e36f29411e364d072eddc42493afcd1bb058a364ca5af06868e881"}}