{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GCGJFCFEJIVIXDTGNXXG7SZVHU","short_pith_number":"pith:GCGJFCFE","canonical_record":{"source":{"id":"1711.07641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T06:17:39Z","cross_cats_sorted":[],"title_canon_sha256":"c8170c2c1316828530bf518a0a984ab6c495fd4a9018f47b3fd2e5fc5cf6b735","abstract_canon_sha256":"0935c23fb6fdfb228716f6a918c8f316e424c2067f7c86fa71276945a497c994"},"schema_version":"1.0"},"canonical_sha256":"308c9288a44a2a8b8e666dee6fcb353d211959290a11482d586c636aea2cfde5","source":{"kind":"arxiv","id":"1711.07641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07641","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07641v2","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07641","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"GCGJFCFEJIVI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GCGJFCFEJIVIXDTG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GCGJFCFE","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GCGJFCFEJIVIXDTGNXXG7SZVHU","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T06:17:39Z","cross_cats_sorted":[],"title_canon_sha256":"c8170c2c1316828530bf518a0a984ab6c495fd4a9018f47b3fd2e5fc5cf6b735","abstract_canon_sha256":"0935c23fb6fdfb228716f6a918c8f316e424c2067f7c86fa71276945a497c994"},"schema_version":"1.0"},"canonical_sha256":"308c9288a44a2a8b8e666dee6fcb353d211959290a11482d586c636aea2cfde5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.182149Z","signature_b64":"3Q5RMkLO26NyQqlGtFIV2dq+9Fweo6c+BS8pwnRgBTNlcwYyeQqjz88qZ9WVb+Rv9uyJ3NcOgQT2unv28yegAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"308c9288a44a2a8b8e666dee6fcb353d211959290a11482d586c636aea2cfde5","last_reissued_at":"2026-05-18T00:17:13.181527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.181527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07641","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:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEoioTuRjsOk9jVplRB8Gr7k6Pg6V5l5d96ILBfCbcTKSLFzW9NL3keRXO4p9zG8Fx4anPQ8nqQMLIhwTb8LDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:46:27.258687Z"},"content_sha256":"ce2ad8c4e83ce15d8b73d7384162cd64b01e18d44d64a58574ee3e4221f6f72f","schema_version":"1.0","event_id":"sha256:ce2ad8c4e83ce15d8b73d7384162cd64b01e18d44d64a58574ee3e4221f6f72f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GCGJFCFEJIVIXDTGNXXG7SZVHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Image Semantic Matching by Mining Consistent Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kostas Daniilidis, Qianqian Wang, Xiaowei Zhou","submitted_at":"2017-11-21T06:17:39Z","abstract_excerpt":"This work proposes a multi-image matching method to estimate semantic correspondences across multiple images. In contrast to the previous methods that optimize all pairwise correspondences, the proposed method identifies and matches only a sparse set of reliable features in the image collection. In this way, the proposed method is able to prune nonrepeatable features and also highly scalable to handle thousands of images. We additionally propose a low-rank constraint to ensure the geometric consistency of feature correspondences over the whole image collection. Besides the competitive performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07641","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:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toPIXgeEihJUv7ip1nU59tfYddIXsr06aWLR5+sP/uf0PqAh+nTj22zniAWDOBpX8hh09PTzdZVmio5Mku5XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:46:27.259025Z"},"content_sha256":"75b5a68c66b1bd086ca3472475eb91b41680e5485f2e0e34ed7bad0b8aff3e5b","schema_version":"1.0","event_id":"sha256:75b5a68c66b1bd086ca3472475eb91b41680e5485f2e0e34ed7bad0b8aff3e5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/bundle.json","state_url":"https://pith.science/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/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-03T04:46:27Z","links":{"resolver":"https://pith.science/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU","bundle":"https://pith.science/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/bundle.json","state":"https://pith.science/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCGJFCFEJIVIXDTGNXXG7SZVHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GCGJFCFEJIVIXDTGNXXG7SZVHU","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":"0935c23fb6fdfb228716f6a918c8f316e424c2067f7c86fa71276945a497c994","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T06:17:39Z","title_canon_sha256":"c8170c2c1316828530bf518a0a984ab6c495fd4a9018f47b3fd2e5fc5cf6b735"},"schema_version":"1.0","source":{"id":"1711.07641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07641","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07641v2","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07641","created_at":"2026-05-18T00:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"GCGJFCFEJIVI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GCGJFCFEJIVIXDTG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GCGJFCFE","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:75b5a68c66b1bd086ca3472475eb91b41680e5485f2e0e34ed7bad0b8aff3e5b","target":"graph","created_at":"2026-05-18T00:17:13Z","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":"This work proposes a multi-image matching method to estimate semantic correspondences across multiple images. In contrast to the previous methods that optimize all pairwise correspondences, the proposed method identifies and matches only a sparse set of reliable features in the image collection. In this way, the proposed method is able to prune nonrepeatable features and also highly scalable to handle thousands of images. We additionally propose a low-rank constraint to ensure the geometric consistency of feature correspondences over the whole image collection. Besides the competitive performa","authors_text":"Kostas Daniilidis, Qianqian Wang, Xiaowei Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T06:17:39Z","title":"Multi-Image Semantic Matching by Mining Consistent Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07641","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:ce2ad8c4e83ce15d8b73d7384162cd64b01e18d44d64a58574ee3e4221f6f72f","target":"record","created_at":"2026-05-18T00:17:13Z","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":"0935c23fb6fdfb228716f6a918c8f316e424c2067f7c86fa71276945a497c994","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-21T06:17:39Z","title_canon_sha256":"c8170c2c1316828530bf518a0a984ab6c495fd4a9018f47b3fd2e5fc5cf6b735"},"schema_version":"1.0","source":{"id":"1711.07641","kind":"arxiv","version":2}},"canonical_sha256":"308c9288a44a2a8b8e666dee6fcb353d211959290a11482d586c636aea2cfde5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"308c9288a44a2a8b8e666dee6fcb353d211959290a11482d586c636aea2cfde5","first_computed_at":"2026-05-18T00:17:13.181527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:13.181527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Q5RMkLO26NyQqlGtFIV2dq+9Fweo6c+BS8pwnRgBTNlcwYyeQqjz88qZ9WVb+Rv9uyJ3NcOgQT2unv28yegAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:13.182149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce2ad8c4e83ce15d8b73d7384162cd64b01e18d44d64a58574ee3e4221f6f72f","sha256:75b5a68c66b1bd086ca3472475eb91b41680e5485f2e0e34ed7bad0b8aff3e5b"],"state_sha256":"ab72ad1e4105ef63c19c62f5d4ee435df09d28f3a052a9725347633585c3cd61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzKw8p4VYtggv8Ip1A+7Uq9hMGxI3awtmEI1PGLZRIiAcig5q6bNtSb8CZJSU0hLBK4vj4NcR7JG/UECExudDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:46:27.260864Z","bundle_sha256":"07c387a81abd49a9660e85debcb214929879ccef7e2c84a92568f54e6c2351f6"}}