{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AGJ2Y7KCVVVUYR26QT5EU5FRQG","short_pith_number":"pith:AGJ2Y7KC","schema_version":"1.0","canonical_sha256":"0193ac7d42ad6b4c475e84fa4a74b181a897ea2aea400a8e36bf207df6370b8b","source":{"kind":"arxiv","id":"1908.01499","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.01499","created_at":"2026-07-04T23:51:31.031553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01499v1","created_at":"2026-07-04T23:51:31.031553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01499","created_at":"2026-07-04T23:51:31.031553+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGJ2Y7KCVVVU","created_at":"2026-07-04T23:51:31.031553+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGJ2Y7KCVVVUYR26","created_at":"2026-07-04T23:51:31.031553+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGJ2Y7KC","created_at":"2026-07-04T23:51:31.031553+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/AGJ2Y7KCVVVUYR26QT5EU5FRQG","json":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG.json","graph_json":"https://pith.science/api/pith-number/AGJ2Y7KCVVVUYR26QT5EU5FRQG/graph.json","events_json":"https://pith.science/api/pith-number/AGJ2Y7KCVVVUYR26QT5EU5FRQG/events.json","paper":"https://pith.science/paper/AGJ2Y7KC"},"agent_actions":{"view_html":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG","download_json":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG.json","view_paper":"https://pith.science/paper/AGJ2Y7KC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01499&json=true","fetch_graph":"https://pith.science/api/pith-number/AGJ2Y7KCVVVUYR26QT5EU5FRQG/graph.json","fetch_events":"https://pith.science/api/pith-number/AGJ2Y7KCVVVUYR26QT5EU5FRQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/action/storage_attestation","attest_author":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/action/author_attestation","sign_citation":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/action/citation_signature","submit_replication":"https://pith.science/pith/AGJ2Y7KCVVVUYR26QT5EU5FRQG/action/replication_record"}},"created_at":"2026-07-04T23:51:31.031553+00:00","updated_at":"2026-07-04T23:51:31.031553+00:00"}