{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NPOXWSGHAYPZ2HKACYWRFKMSCH","short_pith_number":"pith:NPOXWSGH","canonical_record":{"source":{"id":"1506.07656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T08:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"45431b343c7f58c5c13099aedc2659f3cdcd2e0120c35ac7fc241092a1c16a07","abstract_canon_sha256":"dcd36e50b22ce0dcc8ad3fad3da08f7902f667d64c831072590c23de00d33fe7"},"schema_version":"1.0"},"canonical_sha256":"6bdd7b48c7061f9d1d40162d12a99211c4efbebf38fd7caac2569ee4f940ac60","source":{"kind":"arxiv","id":"1506.07656","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07656","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07656v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07656","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"NPOXWSGHAYPZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NPOXWSGHAYPZ2HKA","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NPOXWSGH","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NPOXWSGHAYPZ2HKACYWRFKMSCH","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T08:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"45431b343c7f58c5c13099aedc2659f3cdcd2e0120c35ac7fc241092a1c16a07","abstract_canon_sha256":"dcd36e50b22ce0dcc8ad3fad3da08f7902f667d64c831072590c23de00d33fe7"},"schema_version":"1.0"},"canonical_sha256":"6bdd7b48c7061f9d1d40162d12a99211c4efbebf38fd7caac2569ee4f940ac60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.717684Z","signature_b64":"EzxrADlOTBIzRgJc0JPZ6ftV2yZOX1Lo+vyh5/D0nU+7f+OQ6UHbSQDsfWR6LmElO8KblzD2rMxbpwPxvFWeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bdd7b48c7061f9d1d40162d12a99211c4efbebf38fd7caac2569ee4f940ac60","last_reissued_at":"2026-05-18T01:30:42.716873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.716873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07656","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBk6kvvJ0MRB3SB8fneqLj1TwpL532tAJXMnvoVlZ9GWnnAqmxbbYwhoS9/x8uNWkHaTm7GyzGgX1lMDsGMgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:17.436050Z"},"content_sha256":"1609019a1a666f02669dcf89d313273883bf95d7505d97c807c4e7991191bcdf","schema_version":"1.0","event_id":"sha256:1609019a1a666f02669dcf89d313273883bf95d7505d97c807c4e7991191bcdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NPOXWSGHAYPZ2HKACYWRFKMSCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeepMatching: Hierarchical Deformable Dense Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cordelia Schmid (LEAR), Jerome Revaud (LEAR), Philippe Weinzaepfel (LEAR), Zaid Harchaoui (LEAR)","submitted_at":"2015-06-25T08:12:02Z","abstract_excerpt":"We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences between images. DeepMatching relies on a hierarchical, multi-layer, correlational architecture designed for matching images and was inspired by deep convolutional approaches. The proposed matching algorithm can handle non-rigid deformations and repetitive textures and efficiently determines dense correspondences in the presence of significant changes between images. We evaluate the performance of DeepMatching, in comparison with state-of-the-art matching algorithms, on the Mikolajczyk (Mikolajczyk et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07656","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2YOiVoN6uNjnmr8jtRj9Zs2ImcSWJq3whHjKX46MyF8yD5NO87c4SRCSwZ0EPKgqBFKoXTrqL+3gvhgY/LiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:17.436777Z"},"content_sha256":"0d18848d3da5c82eac66eedde2ecc7654da9fa3056f3120791436c4556c823f2","schema_version":"1.0","event_id":"sha256:0d18848d3da5c82eac66eedde2ecc7654da9fa3056f3120791436c4556c823f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/bundle.json","state_url":"https://pith.science/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/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-09T07:16:17Z","links":{"resolver":"https://pith.science/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH","bundle":"https://pith.science/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/bundle.json","state":"https://pith.science/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPOXWSGHAYPZ2HKACYWRFKMSCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NPOXWSGHAYPZ2HKACYWRFKMSCH","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":"dcd36e50b22ce0dcc8ad3fad3da08f7902f667d64c831072590c23de00d33fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T08:12:02Z","title_canon_sha256":"45431b343c7f58c5c13099aedc2659f3cdcd2e0120c35ac7fc241092a1c16a07"},"schema_version":"1.0","source":{"id":"1506.07656","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07656","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07656v2","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07656","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"NPOXWSGHAYPZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NPOXWSGHAYPZ2HKA","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NPOXWSGH","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:0d18848d3da5c82eac66eedde2ecc7654da9fa3056f3120791436c4556c823f2","target":"graph","created_at":"2026-05-18T01:30:42Z","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":"We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences between images. DeepMatching relies on a hierarchical, multi-layer, correlational architecture designed for matching images and was inspired by deep convolutional approaches. The proposed matching algorithm can handle non-rigid deformations and repetitive textures and efficiently determines dense correspondences in the presence of significant changes between images. We evaluate the performance of DeepMatching, in comparison with state-of-the-art matching algorithms, on the Mikolajczyk (Mikolajczyk et","authors_text":"Cordelia Schmid (LEAR), Jerome Revaud (LEAR), Philippe Weinzaepfel (LEAR), Zaid Harchaoui (LEAR)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T08:12:02Z","title":"DeepMatching: Hierarchical Deformable Dense Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07656","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:1609019a1a666f02669dcf89d313273883bf95d7505d97c807c4e7991191bcdf","target":"record","created_at":"2026-05-18T01:30:42Z","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":"dcd36e50b22ce0dcc8ad3fad3da08f7902f667d64c831072590c23de00d33fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-25T08:12:02Z","title_canon_sha256":"45431b343c7f58c5c13099aedc2659f3cdcd2e0120c35ac7fc241092a1c16a07"},"schema_version":"1.0","source":{"id":"1506.07656","kind":"arxiv","version":2}},"canonical_sha256":"6bdd7b48c7061f9d1d40162d12a99211c4efbebf38fd7caac2569ee4f940ac60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bdd7b48c7061f9d1d40162d12a99211c4efbebf38fd7caac2569ee4f940ac60","first_computed_at":"2026-05-18T01:30:42.716873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:42.716873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EzxrADlOTBIzRgJc0JPZ6ftV2yZOX1Lo+vyh5/D0nU+7f+OQ6UHbSQDsfWR6LmElO8KblzD2rMxbpwPxvFWeAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:42.717684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07656","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1609019a1a666f02669dcf89d313273883bf95d7505d97c807c4e7991191bcdf","sha256:0d18848d3da5c82eac66eedde2ecc7654da9fa3056f3120791436c4556c823f2"],"state_sha256":"7a311fe241ce87197dee70af0a5b76531344fd3f53f14101860641825dc3cb9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhkL/26+7rkeqNOCt0YtVu/gD0vANT4FvQYKnKdgUmKwmHkhAKcWTRmJar8O9AvXWfIEehcJtCdjWt9TRHDBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:16:17.440952Z","bundle_sha256":"17fb04196a58f4df06c2f545ebaa1105dc977f1300f839ab45a87463248299f2"}}