{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VRERNDIMXUC3OWUP7PFDZLHRKJ","short_pith_number":"pith:VRERNDIM","canonical_record":{"source":{"id":"2011.14787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-30T13:45:55Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"1338b3374ab5f5e3fbc12c659ef2d087f4d6756357e33280a1b781464ed82dec","abstract_canon_sha256":"c3d216a0fdc3ebb55c8b531c3c13ed65b42677793eafc300147b56ebe84be563"},"schema_version":"1.0"},"canonical_sha256":"ac49168d0cbd05b75a8ffbca3cacf1526b73346926d783d07b1eaf8cf4b319c9","source":{"kind":"arxiv","id":"2011.14787","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14787","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14787v2","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14787","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"VRERNDIMXUC3","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"VRERNDIMXUC3OWUP","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"VRERNDIM","created_at":"2026-07-05T02:21:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VRERNDIMXUC3OWUP7PFDZLHRKJ","target":"record","payload":{"canonical_record":{"source":{"id":"2011.14787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-30T13:45:55Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"1338b3374ab5f5e3fbc12c659ef2d087f4d6756357e33280a1b781464ed82dec","abstract_canon_sha256":"c3d216a0fdc3ebb55c8b531c3c13ed65b42677793eafc300147b56ebe84be563"},"schema_version":"1.0"},"canonical_sha256":"ac49168d0cbd05b75a8ffbca3cacf1526b73346926d783d07b1eaf8cf4b319c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:19.140088Z","signature_b64":"fkABFgFmSYqiaFcAfuajnSrPL/OloFHqqYgjZPWEky+rd5PaySbvWH+TPv9gK+OHhuHlRz3X1u34yirnVqZKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac49168d0cbd05b75a8ffbca3cacf1526b73346926d783d07b1eaf8cf4b319c9","last_reissued_at":"2026-07-05T02:21:19.139628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:19.139628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.14787","source_version":2,"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-05T02:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kenBWyVQvmoGqNR9vEC+PID/vqA8Z88YxpDi3gI3UfH/65Kr4r1qsp7zLbQN2m7OekRzL7jAapT9WPTEHkg6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:57.071324Z"},"content_sha256":"0185a74be6304d9e4b610583b71e592aaf28d460261b303ffcebdfc1f7d992f4","schema_version":"1.0","event_id":"sha256:0185a74be6304d9e4b610583b71e592aaf28d460261b303ffcebdfc1f7d992f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VRERNDIMXUC3OWUP7PFDZLHRKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Path Regression Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.RO","authors_text":"Daniel Lenton, Michal P\\'andy, Ronald Clark","submitted_at":"2020-11-30T13:45:55Z","abstract_excerpt":"We demonstrate that challenging shortest path problems can be solved via direct spline regression from a neural network, trained in an unsupervised manner (i.e. without requiring ground truth optimal paths for training). To achieve this, we derive a geometry-dependent optimal cost function whose minima guarantees collision-free solutions. Our method beats state-of-the-art supervised learning baselines for shortest path planning, with a much more scalable training pipeline, and a significant speedup in inference time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14787","kind":"arxiv","version":2},"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/2011.14787/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-05T02:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5XYRYfGy1TQCS/2ZIgsY+fwiYitvkl06rkaWFpwy4Oasmvsw3EOUSdrWwPg4DvWEqp+GrwykrdyrDO1cMYTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:57.071999Z"},"content_sha256":"13a4c7f3bb1ef2c72e068bc1ac17ebf18e18ecb2474d95fd25c5015f8e428f54","schema_version":"1.0","event_id":"sha256:13a4c7f3bb1ef2c72e068bc1ac17ebf18e18ecb2474d95fd25c5015f8e428f54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/bundle.json","state_url":"https://pith.science/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/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-07-06T11:44:57Z","links":{"resolver":"https://pith.science/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ","bundle":"https://pith.science/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/bundle.json","state":"https://pith.science/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRERNDIMXUC3OWUP7PFDZLHRKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VRERNDIMXUC3OWUP7PFDZLHRKJ","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":"c3d216a0fdc3ebb55c8b531c3c13ed65b42677793eafc300147b56ebe84be563","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-30T13:45:55Z","title_canon_sha256":"1338b3374ab5f5e3fbc12c659ef2d087f4d6756357e33280a1b781464ed82dec"},"schema_version":"1.0","source":{"id":"2011.14787","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14787","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14787v2","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14787","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"VRERNDIMXUC3","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"VRERNDIMXUC3OWUP","created_at":"2026-07-05T02:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"VRERNDIM","created_at":"2026-07-05T02:21:19Z"}],"graph_snapshots":[{"event_id":"sha256:13a4c7f3bb1ef2c72e068bc1ac17ebf18e18ecb2474d95fd25c5015f8e428f54","target":"graph","created_at":"2026-07-05T02:21:19Z","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/2011.14787/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We demonstrate that challenging shortest path problems can be solved via direct spline regression from a neural network, trained in an unsupervised manner (i.e. without requiring ground truth optimal paths for training). To achieve this, we derive a geometry-dependent optimal cost function whose minima guarantees collision-free solutions. Our method beats state-of-the-art supervised learning baselines for shortest path planning, with a much more scalable training pipeline, and a significant speedup in inference time.","authors_text":"Daniel Lenton, Michal P\\'andy, Ronald Clark","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-30T13:45:55Z","title":"Unsupervised Path Regression Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14787","kind":"arxiv","version":2},"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:0185a74be6304d9e4b610583b71e592aaf28d460261b303ffcebdfc1f7d992f4","target":"record","created_at":"2026-07-05T02:21:19Z","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":"c3d216a0fdc3ebb55c8b531c3c13ed65b42677793eafc300147b56ebe84be563","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-30T13:45:55Z","title_canon_sha256":"1338b3374ab5f5e3fbc12c659ef2d087f4d6756357e33280a1b781464ed82dec"},"schema_version":"1.0","source":{"id":"2011.14787","kind":"arxiv","version":2}},"canonical_sha256":"ac49168d0cbd05b75a8ffbca3cacf1526b73346926d783d07b1eaf8cf4b319c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac49168d0cbd05b75a8ffbca3cacf1526b73346926d783d07b1eaf8cf4b319c9","first_computed_at":"2026-07-05T02:21:19.139628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:21:19.139628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkABFgFmSYqiaFcAfuajnSrPL/OloFHqqYgjZPWEky+rd5PaySbvWH+TPv9gK+OHhuHlRz3X1u34yirnVqZKBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:21:19.140088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.14787","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0185a74be6304d9e4b610583b71e592aaf28d460261b303ffcebdfc1f7d992f4","sha256:13a4c7f3bb1ef2c72e068bc1ac17ebf18e18ecb2474d95fd25c5015f8e428f54"],"state_sha256":"5edcf8290e78ce2788041fb63ca08746d4ac876c76f4c39fd0ff4433c5a90e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1PU7mlt1SO8pxGOfBUdrkxApn6rlSKL3gCcZ2PEYy1Mg3p2Sw3RAtQ8mXKyc1NrSvUqiR2o/EDDlVXxXkKxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:44:57.074231Z","bundle_sha256":"7197fca1c431c27408a0b02f742aceda8bc0d4755717af263c79d7cdca261717"}}