{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QP6ROVD7J3D7V3VKX6AZPFT4Z7","short_pith_number":"pith:QP6ROVD7","canonical_record":{"source":{"id":"1312.7085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-26T10:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"d0445a99b0c2cb9fbbd30f4c3082d9443471a0e37b9daa9174c506310ccdbbbc","abstract_canon_sha256":"a857d5c394a88247b59eb7e2cb13223b7bded4be9062d37ee95186c292e7e044"},"schema_version":"1.0"},"canonical_sha256":"83fd17547f4ec7faeeaabf8197967ccfd930d4c9140024449d20a8857640d598","source":{"kind":"arxiv","id":"1312.7085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7085","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7085v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7085","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"QP6ROVD7J3D7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QP6ROVD7J3D7V3VK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QP6ROVD7","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QP6ROVD7J3D7V3VKX6AZPFT4Z7","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-26T10:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"d0445a99b0c2cb9fbbd30f4c3082d9443471a0e37b9daa9174c506310ccdbbbc","abstract_canon_sha256":"a857d5c394a88247b59eb7e2cb13223b7bded4be9062d37ee95186c292e7e044"},"schema_version":"1.0"},"canonical_sha256":"83fd17547f4ec7faeeaabf8197967ccfd930d4c9140024449d20a8857640d598","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.938796Z","signature_b64":"A+LulS4NqUy7ox3uPrtYKh6DsTYPTdTb+xkPAssnUidmxseC6TkPSlyNeE9Bmw5CGzCv29uORdV8BOMNBLVZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83fd17547f4ec7faeeaabf8197967ccfd930d4c9140024449d20a8857640d598","last_reissued_at":"2026-05-18T03:03:45.938063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.938063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7085","source_version":1,"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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqMWtIbnPHvmAB/sZrEkDD7RxNgtB07ChCdygTx9tEbmTLmVV0WURTaEdpV2JfzJOhZ3qp9toYVaABVczrT0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:55:30.827660Z"},"content_sha256":"a9a1db6c908f79634727f6d02f04c6b8fe322906319cb778119360e9856ae9a5","schema_version":"1.0","event_id":"sha256:a9a1db6c908f79634727f6d02f04c6b8fe322906319cb778119360e9856ae9a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QP6ROVD7J3D7V3VKX6AZPFT4Z7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding More Relevance: Propagating Similarity on Markov Random Field for Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Peng Lu, Xiaojie Wang, Xinshan Zhu, Xujun Peng","submitted_at":"2013-12-26T10:55:14Z","abstract_excerpt":"To effectively retrieve objects from large corpus with high accuracy is a challenge task. In this paper, we propose a method that propagates visual feature level similarities on a Markov random field (MRF) to obtain a high level correspondence in image space for image pairs. The proposed correspondence between image pair reflects not only the similarity of low-level visual features but also the relations built through other images in the database and it can be easily integrated into the existing bag-of-visual-words(BoW) based systems to reduce the missing rate. We evaluate our method on the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7085","kind":"arxiv","version":1},"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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZoOwwjZnEEhFD1dbrcrToEMjxNGnsSrgHFpbkPzqiWcsClZVW/IOVa3c3akjO5WXhfLvHStP1eG6SxkdwPlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:55:30.828004Z"},"content_sha256":"22a07c3c4aa5740addd7f60129bdc256402e75ea84027cfa26ee6e1c28e53415","schema_version":"1.0","event_id":"sha256:22a07c3c4aa5740addd7f60129bdc256402e75ea84027cfa26ee6e1c28e53415"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/bundle.json","state_url":"https://pith.science/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/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-03T06:55:30Z","links":{"resolver":"https://pith.science/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7","bundle":"https://pith.science/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/bundle.json","state":"https://pith.science/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP6ROVD7J3D7V3VKX6AZPFT4Z7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QP6ROVD7J3D7V3VKX6AZPFT4Z7","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":"a857d5c394a88247b59eb7e2cb13223b7bded4be9062d37ee95186c292e7e044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-26T10:55:14Z","title_canon_sha256":"d0445a99b0c2cb9fbbd30f4c3082d9443471a0e37b9daa9174c506310ccdbbbc"},"schema_version":"1.0","source":{"id":"1312.7085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7085","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7085v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7085","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"QP6ROVD7J3D7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QP6ROVD7J3D7V3VK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QP6ROVD7","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:22a07c3c4aa5740addd7f60129bdc256402e75ea84027cfa26ee6e1c28e53415","target":"graph","created_at":"2026-05-18T03:03:45Z","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":"To effectively retrieve objects from large corpus with high accuracy is a challenge task. In this paper, we propose a method that propagates visual feature level similarities on a Markov random field (MRF) to obtain a high level correspondence in image space for image pairs. The proposed correspondence between image pair reflects not only the similarity of low-level visual features but also the relations built through other images in the database and it can be easily integrated into the existing bag-of-visual-words(BoW) based systems to reduce the missing rate. We evaluate our method on the st","authors_text":"Peng Lu, Xiaojie Wang, Xinshan Zhu, Xujun Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-26T10:55:14Z","title":"Finding More Relevance: Propagating Similarity on Markov Random Field for Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7085","kind":"arxiv","version":1},"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:a9a1db6c908f79634727f6d02f04c6b8fe322906319cb778119360e9856ae9a5","target":"record","created_at":"2026-05-18T03:03:45Z","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":"a857d5c394a88247b59eb7e2cb13223b7bded4be9062d37ee95186c292e7e044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-26T10:55:14Z","title_canon_sha256":"d0445a99b0c2cb9fbbd30f4c3082d9443471a0e37b9daa9174c506310ccdbbbc"},"schema_version":"1.0","source":{"id":"1312.7085","kind":"arxiv","version":1}},"canonical_sha256":"83fd17547f4ec7faeeaabf8197967ccfd930d4c9140024449d20a8857640d598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83fd17547f4ec7faeeaabf8197967ccfd930d4c9140024449d20a8857640d598","first_computed_at":"2026-05-18T03:03:45.938063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.938063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A+LulS4NqUy7ox3uPrtYKh6DsTYPTdTb+xkPAssnUidmxseC6TkPSlyNeE9Bmw5CGzCv29uORdV8BOMNBLVZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.938796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9a1db6c908f79634727f6d02f04c6b8fe322906319cb778119360e9856ae9a5","sha256:22a07c3c4aa5740addd7f60129bdc256402e75ea84027cfa26ee6e1c28e53415"],"state_sha256":"b3355ad57ade32e3b08bb771d04bd60a1fcb002c26841b106a8cd91b53ac856f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lzcapj7u1iYha2fp5C0CLXyH0I3JGv9cOmQCaMaM0F9NyTU5GWThowgPPkI11ASEivRFmz5xBSTfx/JN/il8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:55:30.830052Z","bundle_sha256":"5ba97c170a4ddc505474482ecb39a0878a9aca04a2943eb09c0c9c5b6f6d5e8b"}}