{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FFFER7ZS2OZLKDJ66KZXVEDSJR","short_pith_number":"pith:FFFER7ZS","canonical_record":{"source":{"id":"1701.02776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T20:20:24Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"61937b9d645fcf7f75a0669132b3127a8074243ce14f10ee7ce9a16570c7bfe0","abstract_canon_sha256":"76fc0636ed5441de579148f0e0c63c748cf7f6c3a00d3c9ed16b6719ec171eb9"},"schema_version":"1.0"},"canonical_sha256":"294a48ff32d3b2b50d3ef2b37a90724c433581c82d2559b18c9636822abc7c42","source":{"kind":"arxiv","id":"1701.02776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02776","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02776v2","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02776","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"FFFER7ZS2OZL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFFER7ZS2OZLKDJ6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFFER7ZS","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FFFER7ZS2OZLKDJ66KZXVEDSJR","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T20:20:24Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"61937b9d645fcf7f75a0669132b3127a8074243ce14f10ee7ce9a16570c7bfe0","abstract_canon_sha256":"76fc0636ed5441de579148f0e0c63c748cf7f6c3a00d3c9ed16b6719ec171eb9"},"schema_version":"1.0"},"canonical_sha256":"294a48ff32d3b2b50d3ef2b37a90724c433581c82d2559b18c9636822abc7c42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:10.778716Z","signature_b64":"A72iLC3tEJL57n+Wc9z37SD6b4UUbt20takDNSiCsnZ2/ABTTBH8QXXya7k/hAjarSe48rAmwpydYNq/jnDjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294a48ff32d3b2b50d3ef2b37a90724c433581c82d2559b18c9636822abc7c42","last_reissued_at":"2026-05-18T00:29:10.777869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:10.777869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02776","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:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHqAK8G/vsVJf/WZvi7YB915FnWpMRusk0G6Q/InOw9LigMYRj+8yGlCu/+DF0q3yf6W7PFmLf9CNL9706lJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:46:39.947940Z"},"content_sha256":"8808a8f79a7105b3d3b8b4e1618d06fcef138bd7e760698698b0af2e444878d8","schema_version":"1.0","event_id":"sha256:8808a8f79a7105b3d3b8b4e1618d06fcef138bd7e760698698b0af2e444878d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FFFER7ZS2OZLKDJ66KZXVEDSJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Joint Image Clustering and Registration using Partition Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Lav R. Varshney, Ravi Kiran Raman","submitted_at":"2017-01-10T20:20:24Z","abstract_excerpt":"We consider the problem of universal joint clustering and registration of images and define algorithms using multivariate information functionals. We first study registering two images using maximum mutual information and prove its asymptotic optimality. We then show the shortcomings of pairwise registration in multi-image registration, and design an asymptotically optimal algorithm based on multiinformation. Further, we define a novel multivariate information functional to perform joint clustering and registration of images, and prove consistency of the algorithm. Finally, we consider registr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02776","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:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ELTCbHn4eZrVqem4wIXFOxXRIt/H30AlIjOBQWsS5fIME+iUE6grBfRWgDi7h20OQ0sclYcGEIEjZTAVp77DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:46:39.948310Z"},"content_sha256":"5b382417cc96df48303373b85100e38746e24dec18bb95624a52d3bce493625d","schema_version":"1.0","event_id":"sha256:5b382417cc96df48303373b85100e38746e24dec18bb95624a52d3bce493625d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/bundle.json","state_url":"https://pith.science/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/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-03T19:46:39Z","links":{"resolver":"https://pith.science/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR","bundle":"https://pith.science/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/bundle.json","state":"https://pith.science/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFFER7ZS2OZLKDJ66KZXVEDSJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FFFER7ZS2OZLKDJ66KZXVEDSJR","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":"76fc0636ed5441de579148f0e0c63c748cf7f6c3a00d3c9ed16b6719ec171eb9","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T20:20:24Z","title_canon_sha256":"61937b9d645fcf7f75a0669132b3127a8074243ce14f10ee7ce9a16570c7bfe0"},"schema_version":"1.0","source":{"id":"1701.02776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02776","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02776v2","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02776","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"FFFER7ZS2OZL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFFER7ZS2OZLKDJ6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFFER7ZS","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:5b382417cc96df48303373b85100e38746e24dec18bb95624a52d3bce493625d","target":"graph","created_at":"2026-05-18T00:29:10Z","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 consider the problem of universal joint clustering and registration of images and define algorithms using multivariate information functionals. We first study registering two images using maximum mutual information and prove its asymptotic optimality. We then show the shortcomings of pairwise registration in multi-image registration, and design an asymptotically optimal algorithm based on multiinformation. Further, we define a novel multivariate information functional to perform joint clustering and registration of images, and prove consistency of the algorithm. Finally, we consider registr","authors_text":"Lav R. Varshney, Ravi Kiran Raman","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T20:20:24Z","title":"Universal Joint Image Clustering and Registration using Partition Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02776","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:8808a8f79a7105b3d3b8b4e1618d06fcef138bd7e760698698b0af2e444878d8","target":"record","created_at":"2026-05-18T00:29:10Z","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":"76fc0636ed5441de579148f0e0c63c748cf7f6c3a00d3c9ed16b6719ec171eb9","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T20:20:24Z","title_canon_sha256":"61937b9d645fcf7f75a0669132b3127a8074243ce14f10ee7ce9a16570c7bfe0"},"schema_version":"1.0","source":{"id":"1701.02776","kind":"arxiv","version":2}},"canonical_sha256":"294a48ff32d3b2b50d3ef2b37a90724c433581c82d2559b18c9636822abc7c42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"294a48ff32d3b2b50d3ef2b37a90724c433581c82d2559b18c9636822abc7c42","first_computed_at":"2026-05-18T00:29:10.777869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:10.777869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A72iLC3tEJL57n+Wc9z37SD6b4UUbt20takDNSiCsnZ2/ABTTBH8QXXya7k/hAjarSe48rAmwpydYNq/jnDjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:10.778716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8808a8f79a7105b3d3b8b4e1618d06fcef138bd7e760698698b0af2e444878d8","sha256:5b382417cc96df48303373b85100e38746e24dec18bb95624a52d3bce493625d"],"state_sha256":"4f576b15bcb7e87d01675c5826437effa7aedc87096c0cbb56226da8d017bf2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6tqmEO+qnDcbMF+c1V+ki1xbH0DY7jsSK0jT+zb8vaU8Lj31Uz1wuFOiWy/sp1gchjJDgIsHFTRGntlpJqqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:46:39.950204Z","bundle_sha256":"cbdad3b1b3e83fd7b85160230ed8bee0caa505f20d02bd2bc4c277dcaba7eff0"}}