{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JEM7JATWQQZOPMW74WHROTS2SX","short_pith_number":"pith:JEM7JATW","schema_version":"1.0","canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","source":{"kind":"arxiv","id":"1705.08272","version":3},"attestation_state":"computed","paper":{"title":"Matching neural paths: transfer from recognition to correspondence search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Lubor Ladicky, Marc Pollefeys, Nikolay Savinov","submitted_at":"2017-05-19T16:40:35Z","abstract_excerpt":"Many machine learning tasks require finding per-part correspondences between objects. In this work we focus on low-level correspondences - a highly ambiguous matching problem. We propose to use a hierarchical semantic representation of the objects, coming from a convolutional neural network, to solve this ambiguity. Training it for low-level correspondence prediction directly might not be an option in some domains where the ground-truth correspondences are hard to obtain. We show how transfer from recognition can be used to avoid such training. Our idea is to mark parts as \"matching\" if their "},"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":"1705.08272","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-19T16:40:35Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"d8321960d4ef29d980cc7bf2814401df7c0131a59f01888bbb40b7eb2d392b5d","abstract_canon_sha256":"34b66b5e97fc2857524ee0ca8f31e6128cbbe3f8dc38f21ef4820a0288fbfd8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:19.440402Z","signature_b64":"q4JQhcO+YKTwhqnKoL11HSgJbnhiOg3hZyC1Q4IpzKEhyW9v9n7b/cwQJeXLhiPpEVBbQDQH8/jrd7+mv3LwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","last_reissued_at":"2026-05-18T00:31:19.438619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:19.438619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching neural paths: transfer from recognition to correspondence search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Lubor Ladicky, Marc Pollefeys, Nikolay Savinov","submitted_at":"2017-05-19T16:40:35Z","abstract_excerpt":"Many machine learning tasks require finding per-part correspondences between objects. In this work we focus on low-level correspondences - a highly ambiguous matching problem. We propose to use a hierarchical semantic representation of the objects, coming from a convolutional neural network, to solve this ambiguity. Training it for low-level correspondence prediction directly might not be an option in some domains where the ground-truth correspondences are hard to obtain. We show how transfer from recognition can be used to avoid such training. Our idea is to mark parts as \"matching\" if their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08272","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.08272","created_at":"2026-05-18T00:31:19.439718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08272v3","created_at":"2026-05-18T00:31:19.439718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08272","created_at":"2026-05-18T00:31:19.439718+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEM7JATWQQZO","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEM7JATWQQZOPMW7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEM7JATW","created_at":"2026-05-18T12:31:24.725408+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/JEM7JATWQQZOPMW74WHROTS2SX","json":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX.json","graph_json":"https://pith.science/api/pith-number/JEM7JATWQQZOPMW74WHROTS2SX/graph.json","events_json":"https://pith.science/api/pith-number/JEM7JATWQQZOPMW74WHROTS2SX/events.json","paper":"https://pith.science/paper/JEM7JATW"},"agent_actions":{"view_html":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX","download_json":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX.json","view_paper":"https://pith.science/paper/JEM7JATW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08272&json=true","fetch_graph":"https://pith.science/api/pith-number/JEM7JATWQQZOPMW74WHROTS2SX/graph.json","fetch_events":"https://pith.science/api/pith-number/JEM7JATWQQZOPMW74WHROTS2SX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/action/storage_attestation","attest_author":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/action/author_attestation","sign_citation":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/action/citation_signature","submit_replication":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/action/replication_record"}},"created_at":"2026-05-18T00:31:19.439718+00:00","updated_at":"2026-05-18T00:31:19.439718+00:00"}