{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:245Y3WSHGVWMTXJMN3QBJ4JL7R","short_pith_number":"pith:245Y3WSH","canonical_record":{"source":{"id":"1105.1948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-05-10T13:55:31Z","cross_cats_sorted":[],"title_canon_sha256":"020cf59ab7cf3b876a959fceaa60121f5bf06fffa9ee064dae5d5712d8d72196","abstract_canon_sha256":"8fad56a453dabb727c2c8534fd1a243d6a84fdc4e089962b22357ba84878d4bb"},"schema_version":"1.0"},"canonical_sha256":"d73b8dda47356cc9dd2c6ee014f12bfc55940cff5f1c460cca19c973db4d3b83","source":{"kind":"arxiv","id":"1105.1948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1948","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1948v1","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1948","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"245Y3WSHGVWM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"245Y3WSHGVWMTXJM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"245Y3WSH","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:245Y3WSHGVWMTXJMN3QBJ4JL7R","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-05-10T13:55:31Z","cross_cats_sorted":[],"title_canon_sha256":"020cf59ab7cf3b876a959fceaa60121f5bf06fffa9ee064dae5d5712d8d72196","abstract_canon_sha256":"8fad56a453dabb727c2c8534fd1a243d6a84fdc4e089962b22357ba84878d4bb"},"schema_version":"1.0"},"canonical_sha256":"d73b8dda47356cc9dd2c6ee014f12bfc55940cff5f1c460cca19c973db4d3b83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.230983Z","signature_b64":"8/14Zg3bkvj2YDk/Kwwm74nR4KS+S+YKlBMX818VlMZv+/rp/Un1/XizAmIE3ab2z4LHsYAb77AXNPJR9D4GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d73b8dda47356cc9dd2c6ee014f12bfc55940cff5f1c460cca19c973db4d3b83","last_reissued_at":"2026-05-18T04:22:30.230558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.230558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1948","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-18T04:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iu9Olrdm9azSbpuyl6nhhqAZGNbk162rFu2yOa431ose/RrwKAGgacGJgQd1HDUmOr8lkvpQW8/SW2rLzfhYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:26:08.639774Z"},"content_sha256":"3489f623e1e703e74e0d5a77d341e56194adc9aea142ae49d642684c8096047a","schema_version":"1.0","event_id":"sha256:3489f623e1e703e74e0d5a77d341e56194adc9aea142ae49d642684c8096047a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:245Y3WSHGVWMTXJMN3QBJ4JL7R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analytical Classification of Multimedia Index Structures by Using a Partitioning Method-Based Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"(2) Department of Computer Engineering, Alzahra University, Iran, Iran), Islamic Azad University, Mohammadreza keyvanpour (1), Najva Izadpanah (2) ((1) Department of Computer Engineering, Qazvin, Qazvin Branch, Tehran","submitted_at":"2011-05-10T13:55:31Z","abstract_excerpt":"Due to the advances in hardware technology and increase in production of multimedia data in many applications, during the last decades, multimedia databases have become increasingly important. Contentbased multimedia retrieval is one of an important research area in the field of multimedia databases. Lots of research on this field has led to proposition of different kinds of index structures to support fast and efficient similarity search to retrieve multimedia data from these databases. Due to variety and plenty of proposed index structures, we suggest a systematic framework based on partitio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1948","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-18T04:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAe7MW+nHUjED0s+tuqspp4g+32bCL0UxmsTHJxTAaJZSAo4pcA+bnEU8Rz/1e4PEfiXYrXW35V1Gmybke7MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:26:08.640132Z"},"content_sha256":"0b9b8b97c1f093941ec326fb87780ddb0c64c637965a0907b074eab358f3f0aa","schema_version":"1.0","event_id":"sha256:0b9b8b97c1f093941ec326fb87780ddb0c64c637965a0907b074eab358f3f0aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/bundle.json","state_url":"https://pith.science/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/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-05-28T05:26:08Z","links":{"resolver":"https://pith.science/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R","bundle":"https://pith.science/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/bundle.json","state":"https://pith.science/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/245Y3WSHGVWMTXJMN3QBJ4JL7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:245Y3WSHGVWMTXJMN3QBJ4JL7R","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":"8fad56a453dabb727c2c8534fd1a243d6a84fdc4e089962b22357ba84878d4bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-05-10T13:55:31Z","title_canon_sha256":"020cf59ab7cf3b876a959fceaa60121f5bf06fffa9ee064dae5d5712d8d72196"},"schema_version":"1.0","source":{"id":"1105.1948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1948","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1948v1","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1948","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"245Y3WSHGVWM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"245Y3WSHGVWMTXJM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"245Y3WSH","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:0b9b8b97c1f093941ec326fb87780ddb0c64c637965a0907b074eab358f3f0aa","target":"graph","created_at":"2026-05-18T04:22:30Z","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":"Due to the advances in hardware technology and increase in production of multimedia data in many applications, during the last decades, multimedia databases have become increasingly important. Contentbased multimedia retrieval is one of an important research area in the field of multimedia databases. Lots of research on this field has led to proposition of different kinds of index structures to support fast and efficient similarity search to retrieve multimedia data from these databases. Due to variety and plenty of proposed index structures, we suggest a systematic framework based on partitio","authors_text":"(2) Department of Computer Engineering, Alzahra University, Iran, Iran), Islamic Azad University, Mohammadreza keyvanpour (1), Najva Izadpanah (2) ((1) Department of Computer Engineering, Qazvin, Qazvin Branch, Tehran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-05-10T13:55:31Z","title":"Analytical Classification of Multimedia Index Structures by Using a Partitioning Method-Based Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1948","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:3489f623e1e703e74e0d5a77d341e56194adc9aea142ae49d642684c8096047a","target":"record","created_at":"2026-05-18T04:22:30Z","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":"8fad56a453dabb727c2c8534fd1a243d6a84fdc4e089962b22357ba84878d4bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-05-10T13:55:31Z","title_canon_sha256":"020cf59ab7cf3b876a959fceaa60121f5bf06fffa9ee064dae5d5712d8d72196"},"schema_version":"1.0","source":{"id":"1105.1948","kind":"arxiv","version":1}},"canonical_sha256":"d73b8dda47356cc9dd2c6ee014f12bfc55940cff5f1c460cca19c973db4d3b83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d73b8dda47356cc9dd2c6ee014f12bfc55940cff5f1c460cca19c973db4d3b83","first_computed_at":"2026-05-18T04:22:30.230558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:30.230558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8/14Zg3bkvj2YDk/Kwwm74nR4KS+S+YKlBMX818VlMZv+/rp/Un1/XizAmIE3ab2z4LHsYAb77AXNPJR9D4GBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:30.230983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3489f623e1e703e74e0d5a77d341e56194adc9aea142ae49d642684c8096047a","sha256:0b9b8b97c1f093941ec326fb87780ddb0c64c637965a0907b074eab358f3f0aa"],"state_sha256":"a5941ecfc6d94ae199a00bb7d6fb122c3cd9321a5b45e4962092a7596730447f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvRxpHddCnF06SmlF6qYTaTW3jGU6SSj42w0VO+GDf+D5UaVWaCcHaye6F2cMJwNEmecVfIb+uTtoxhxa1fyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:26:08.642211Z","bundle_sha256":"ae2726e91f3f9f0920d93ccf86d6f5744587cd03c72279710e4fc641738875d1"}}