{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JEM7JATWQQZOPMW74WHROTS2SX","short_pith_number":"pith:JEM7JATW","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"},"canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","source":{"kind":"arxiv","id":"1705.08272","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08272","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08272v3","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08272","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"JEM7JATWQQZO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEM7JATWQQZOPMW7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEM7JATW","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JEM7JATWQQZOPMW74WHROTS2SX","target":"record","payload":{"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"},"canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","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"},"source_kind":"arxiv","source_id":"1705.08272","source_version":3,"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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PM6kcSwnyTNc6yVvqpTt49NPjtvIMJHV8A+CyEsuRoa+T3ZR1pp03hmbaPPa90QvBH7kcDjVN+ymtoe+cNZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:20:32.281503Z"},"content_sha256":"cdee15172f65fddfe575c21822bfda0a3d34bdc709df0ded918179bbb0635d5b","schema_version":"1.0","event_id":"sha256:cdee15172f65fddfe575c21822bfda0a3d34bdc709df0ded918179bbb0635d5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JEM7JATWQQZOPMW74WHROTS2SX","target":"graph","payload":{"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"},"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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vEJtPRv14HH8PIuerHglsbR7VOx7iN3NQ/HXxuUKMWhJxMB8rpFI6cqrsnHOC1EmZOWNqdbXG+AmCAqp/LDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:20:32.281857Z"},"content_sha256":"b97fbade57365a8ecc0def70c933164ada39704bcffce5674958e86822b0ed01","schema_version":"1.0","event_id":"sha256:b97fbade57365a8ecc0def70c933164ada39704bcffce5674958e86822b0ed01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/bundle.json","state_url":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEM7JATWQQZOPMW74WHROTS2SX/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-02T01:20:32Z","links":{"resolver":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX","bundle":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/bundle.json","state":"https://pith.science/pith/JEM7JATWQQZOPMW74WHROTS2SX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEM7JATWQQZOPMW74WHROTS2SX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JEM7JATWQQZOPMW74WHROTS2SX","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":"34b66b5e97fc2857524ee0ca8f31e6128cbbe3f8dc38f21ef4820a0288fbfd8d","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-19T16:40:35Z","title_canon_sha256":"d8321960d4ef29d980cc7bf2814401df7c0131a59f01888bbb40b7eb2d392b5d"},"schema_version":"1.0","source":{"id":"1705.08272","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08272","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08272v3","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08272","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"JEM7JATWQQZO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEM7JATWQQZOPMW7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEM7JATW","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b97fbade57365a8ecc0def70c933164ada39704bcffce5674958e86822b0ed01","target":"graph","created_at":"2026-05-18T00:31: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"},"paper":{"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 ","authors_text":"Lubor Ladicky, Marc Pollefeys, Nikolay Savinov","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-19T16:40:35Z","title":"Matching neural paths: transfer from recognition to correspondence search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08272","kind":"arxiv","version":3},"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:cdee15172f65fddfe575c21822bfda0a3d34bdc709df0ded918179bbb0635d5b","target":"record","created_at":"2026-05-18T00:31: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":"34b66b5e97fc2857524ee0ca8f31e6128cbbe3f8dc38f21ef4820a0288fbfd8d","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-19T16:40:35Z","title_canon_sha256":"d8321960d4ef29d980cc7bf2814401df7c0131a59f01888bbb40b7eb2d392b5d"},"schema_version":"1.0","source":{"id":"1705.08272","kind":"arxiv","version":3}},"canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4919f482768432e7b2dfe58f174e5a95d009aac7027917a8a5f71bbf0f41efcc","first_computed_at":"2026-05-18T00:31:19.438619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:19.438619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4JQhcO+YKTwhqnKoL11HSgJbnhiOg3hZyC1Q4IpzKEhyW9v9n7b/cwQJeXLhiPpEVBbQDQH8/jrd7+mv3LwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:19.440402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08272","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdee15172f65fddfe575c21822bfda0a3d34bdc709df0ded918179bbb0635d5b","sha256:b97fbade57365a8ecc0def70c933164ada39704bcffce5674958e86822b0ed01"],"state_sha256":"1e37999d390c680592c6fa0f76597ef99421c2583e2032e59e8aed2dc3f4e284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1kqDRdV80ztYvuI8CN6+Eh8xV5RqZwA6VSCq6cG+zOScu9cdUJGn/ueZaFTzLnMTGk9vr/LXhM0R9TRNlJECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:20:32.286190Z","bundle_sha256":"aa8ef1e26e1daa4eb034977d07fc34aace2419c681105fc9f5973515c556f1e4"}}