{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LCWCZYEGBOZP62HKAG2XHJ2A4D","short_pith_number":"pith:LCWCZYEG","canonical_record":{"source":{"id":"1709.08480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-25T13:37:01Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2ceb58a252e92ce20e71e11abd9942afeb5ceb12988dedba9342779630d3f4d1","abstract_canon_sha256":"456543948a3434afd78b3a35002f92fa404a6ccbe8ef94705d07c3570433887c"},"schema_version":"1.0"},"canonical_sha256":"58ac2ce0860bb2ff68ea01b573a740e0d005ec39ce930450be328bb45b861529","source":{"kind":"arxiv","id":"1709.08480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08480","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08480v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08480","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"LCWCZYEGBOZP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LCWCZYEGBOZP62HK","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LCWCZYEG","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LCWCZYEGBOZP62HKAG2XHJ2A4D","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-25T13:37:01Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2ceb58a252e92ce20e71e11abd9942afeb5ceb12988dedba9342779630d3f4d1","abstract_canon_sha256":"456543948a3434afd78b3a35002f92fa404a6ccbe8ef94705d07c3570433887c"},"schema_version":"1.0"},"canonical_sha256":"58ac2ce0860bb2ff68ea01b573a740e0d005ec39ce930450be328bb45b861529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:44.523986Z","signature_b64":"3f02eB0HBmnZklNE2CvBq1zxWeAdkEThne468XEWTrRnnRpcApRxkNNnEtjrhcO6OEVeP180AyHciVaOeqPoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58ac2ce0860bb2ff68ea01b573a740e0d005ec39ce930450be328bb45b861529","last_reissued_at":"2026-05-18T00:22:44.523521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:44.523521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08480","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-05-18T00:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRbefLgpJL7PWFWGoiHZSnsZtDl3ZCID5uZIiiifKZbSAvOGl+ezS4hnwdbp3nCyVHGhoI7HOZgfF/TLB1yyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:49:16.518570Z"},"content_sha256":"42d0be0f53a3cde28943d24fc3cdea26881057954ca866b871007ce4bce12e8f","schema_version":"1.0","event_id":"sha256:42d0be0f53a3cde28943d24fc3cdea26881057954ca866b871007ce4bce12e8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LCWCZYEGBOZP62HKAG2XHJ2A4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"J-MOD$^{2}$: Joint Monocular Obstacle Detection and Depth Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.LG","authors_text":"Gabriele Costante, Michele Mancini, Paolo Valigi, Thomas A. Ciarfuglia","submitted_at":"2017-09-25T13:37:01Z","abstract_excerpt":"In this work, we propose an end-to-end deep architecture that jointly learns to detect obstacles and estimate their depth for MAV flight applications. Most of the existing approaches either rely on Visual SLAM systems or on depth estimation models to build 3D maps and detect obstacles. However, for the task of avoiding obstacles this level of complexity is not required. Recent works have proposed multi task architectures to both perform scene understanding and depth estimation. We follow their track and propose a specific architecture to jointly estimate depth and obstacles, without the need t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08480","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":""},"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:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNIp1J0O51Xq/uQFF4fhem/xF9ihTDP0e/soYyyjRi2uRVb28C7Bpdsyg6Nz1fprdDIC7AMJpi3+zQFoMRqrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:49:16.518921Z"},"content_sha256":"5c6eff739731debc7eda389449eb0fcd1d978bf59839eeebe11c2d60f3090910","schema_version":"1.0","event_id":"sha256:5c6eff739731debc7eda389449eb0fcd1d978bf59839eeebe11c2d60f3090910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/bundle.json","state_url":"https://pith.science/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/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-03T01:49:16Z","links":{"resolver":"https://pith.science/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D","bundle":"https://pith.science/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/bundle.json","state":"https://pith.science/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCWCZYEGBOZP62HKAG2XHJ2A4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LCWCZYEGBOZP62HKAG2XHJ2A4D","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":"456543948a3434afd78b3a35002f92fa404a6ccbe8ef94705d07c3570433887c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-25T13:37:01Z","title_canon_sha256":"2ceb58a252e92ce20e71e11abd9942afeb5ceb12988dedba9342779630d3f4d1"},"schema_version":"1.0","source":{"id":"1709.08480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08480","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08480v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08480","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"LCWCZYEGBOZP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LCWCZYEGBOZP62HK","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LCWCZYEG","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5c6eff739731debc7eda389449eb0fcd1d978bf59839eeebe11c2d60f3090910","target":"graph","created_at":"2026-05-18T00:22:44Z","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 this work, we propose an end-to-end deep architecture that jointly learns to detect obstacles and estimate their depth for MAV flight applications. Most of the existing approaches either rely on Visual SLAM systems or on depth estimation models to build 3D maps and detect obstacles. However, for the task of avoiding obstacles this level of complexity is not required. Recent works have proposed multi task architectures to both perform scene understanding and depth estimation. We follow their track and propose a specific architecture to jointly estimate depth and obstacles, without the need t","authors_text":"Gabriele Costante, Michele Mancini, Paolo Valigi, Thomas A. Ciarfuglia","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-25T13:37:01Z","title":"J-MOD$^{2}$: Joint Monocular Obstacle Detection and Depth Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08480","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:42d0be0f53a3cde28943d24fc3cdea26881057954ca866b871007ce4bce12e8f","target":"record","created_at":"2026-05-18T00:22:44Z","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":"456543948a3434afd78b3a35002f92fa404a6ccbe8ef94705d07c3570433887c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-25T13:37:01Z","title_canon_sha256":"2ceb58a252e92ce20e71e11abd9942afeb5ceb12988dedba9342779630d3f4d1"},"schema_version":"1.0","source":{"id":"1709.08480","kind":"arxiv","version":2}},"canonical_sha256":"58ac2ce0860bb2ff68ea01b573a740e0d005ec39ce930450be328bb45b861529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58ac2ce0860bb2ff68ea01b573a740e0d005ec39ce930450be328bb45b861529","first_computed_at":"2026-05-18T00:22:44.523521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:44.523521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3f02eB0HBmnZklNE2CvBq1zxWeAdkEThne468XEWTrRnnRpcApRxkNNnEtjrhcO6OEVeP180AyHciVaOeqPoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:44.523986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42d0be0f53a3cde28943d24fc3cdea26881057954ca866b871007ce4bce12e8f","sha256:5c6eff739731debc7eda389449eb0fcd1d978bf59839eeebe11c2d60f3090910"],"state_sha256":"43eae885e0a8e8c64853b4109bcf0de5d21b0a899e6b73d6ae65be6af32cfc38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aLDTfqVEXnhiWx+jcyMln2SXCva813hofLd6GG48mXyPktqqvbfrf93KBEKRF19LduBun0e2bOZ5EMpxoXJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:49:16.520932Z","bundle_sha256":"9a51f49024b2af6f07b0af1a8fd0a7c9b61cc712fc65e22929f7c48c005691ec"}}