{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OCOY2GXR7CPGMNJKIXZOUJAO2J","short_pith_number":"pith:OCOY2GXR","canonical_record":{"source":{"id":"1610.04583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T19:05:32Z","cross_cats_sorted":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"title_canon_sha256":"ca8b8279c059dde3db9184da8a413b073553f49466702ea691742f46c2baaadd","abstract_canon_sha256":"292c79f1ea189cd64455fca24bb72254320312a3577d7da0e9295d171271c882"},"schema_version":"1.0"},"canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","source":{"kind":"arxiv","id":"1610.04583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04583","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04583v1","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04583","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"OCOY2GXR7CPG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OCOY2GXR7CPGMNJK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OCOY2GXR","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OCOY2GXR7CPGMNJKIXZOUJAO2J","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T19:05:32Z","cross_cats_sorted":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"title_canon_sha256":"ca8b8279c059dde3db9184da8a413b073553f49466702ea691742f46c2baaadd","abstract_canon_sha256":"292c79f1ea189cd64455fca24bb72254320312a3577d7da0e9295d171271c882"},"schema_version":"1.0"},"canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:51.536146Z","signature_b64":"JRwYFz2IyIDjB6dweXkWAAaN8SjkwxrzXF3QpcTY35nkPmAWNxIdaRRSnEu6VMzm3+08XuzTVaMTkkagzRP3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","last_reissued_at":"2026-05-18T00:05:51.535435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:51.535435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04583","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-18T00:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzFxoO/BaiubOXWJFwyi6MwgPW2Wib90LUxhiSF+SEKqTkCN5O2HoKqOzE8MFO5/IWHl5GnIsM7gAhKYZv+ZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:29:45.745455Z"},"content_sha256":"76a2172dae4e563a55c7570e66781593a188965534a017dd9e05d2f8fc3d2cda","schema_version":"1.0","event_id":"sha256:76a2172dae4e563a55c7570e66781593a188965534a017dd9e05d2f8fc3d2cda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OCOY2GXR7CPGMNJKIXZOUJAO2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message-passing algorithms for synchronization problems over compact groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry, Ankur Moitra","submitted_at":"2016-10-14T19:05:32Z","abstract_excerpt":"Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or SO(3). The goal of such problems is to estimate an unknown vector of group elements given noisy relative observations. We present an efficient iterative algorithm to solve a large class of these problems, allowing for any compact group, with measurements on multiple 'frequency channels' (Fourier modes, or more generally, irreducible representations of the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04583","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-18T00:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SMMYQs9oLFRrPy4Ewqkp+uyH37MDaEDPlRTTL7tqycfBDwmua8qPFCZOkQxCMh8GLarg3CFvndiD55KxB0kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:29:45.745825Z"},"content_sha256":"b11e69879a723915f4e2b6c1d1f52110485c613fd5ab385deeba4481d3f36a0a","schema_version":"1.0","event_id":"sha256:b11e69879a723915f4e2b6c1d1f52110485c613fd5ab385deeba4481d3f36a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/bundle.json","state_url":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/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-28T13:29:45Z","links":{"resolver":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J","bundle":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/bundle.json","state":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OCOY2GXR7CPGMNJKIXZOUJAO2J","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":"292c79f1ea189cd64455fca24bb72254320312a3577d7da0e9295d171271c882","cross_cats_sorted":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T19:05:32Z","title_canon_sha256":"ca8b8279c059dde3db9184da8a413b073553f49466702ea691742f46c2baaadd"},"schema_version":"1.0","source":{"id":"1610.04583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04583","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04583v1","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04583","created_at":"2026-05-18T00:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"OCOY2GXR7CPG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OCOY2GXR7CPGMNJK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OCOY2GXR","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:b11e69879a723915f4e2b6c1d1f52110485c613fd5ab385deeba4481d3f36a0a","target":"graph","created_at":"2026-05-18T00:05:51Z","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":"Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or SO(3). The goal of such problems is to estimate an unknown vector of group elements given noisy relative observations. We present an efficient iterative algorithm to solve a large class of these problems, allowing for any compact group, with measurements on multiple 'frequency channels' (Fourier modes, or more generally, irreducible representations of the gr","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry, Ankur Moitra","cross_cats":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T19:05:32Z","title":"Message-passing algorithms for synchronization problems over compact groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04583","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:76a2172dae4e563a55c7570e66781593a188965534a017dd9e05d2f8fc3d2cda","target":"record","created_at":"2026-05-18T00:05:51Z","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":"292c79f1ea189cd64455fca24bb72254320312a3577d7da0e9295d171271c882","cross_cats_sorted":["cs.CV","cs.DS","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-14T19:05:32Z","title_canon_sha256":"ca8b8279c059dde3db9184da8a413b073553f49466702ea691742f46c2baaadd"},"schema_version":"1.0","source":{"id":"1610.04583","kind":"arxiv","version":1}},"canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","first_computed_at":"2026-05-18T00:05:51.535435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:51.535435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRwYFz2IyIDjB6dweXkWAAaN8SjkwxrzXF3QpcTY35nkPmAWNxIdaRRSnEu6VMzm3+08XuzTVaMTkkagzRP3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:51.536146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76a2172dae4e563a55c7570e66781593a188965534a017dd9e05d2f8fc3d2cda","sha256:b11e69879a723915f4e2b6c1d1f52110485c613fd5ab385deeba4481d3f36a0a"],"state_sha256":"94548e2aff4665e092966fea74aa027fe8cda35503d9953f21a50d145f7e5751"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ez3etNDXuD4XxbvWolhgzLRA9OfbpPtu5/QsjmrvnoKLZvoIS3i3opEXRz1NBB0HBTsJ3Em8XsopLdXbqE2ICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:29:45.748102Z","bundle_sha256":"6a59ceaac3c966c6d9a24ebc8a5ec4994efe70d28a32ee9fd7922580eb5eed7b"}}