{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OCOY2GXR7CPGMNJKIXZOUJAO2J","short_pith_number":"pith:OCOY2GXR","schema_version":"1.0","canonical_sha256":"709d8d1af1f89e66352a45f2ea240ed27e497f49058a3d8e70da59d52847beb7","source":{"kind":"arxiv","id":"1610.04583","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.04583","created_at":"2026-05-18T00:05:51.535551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04583v1","created_at":"2026-05-18T00:05:51.535551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04583","created_at":"2026-05-18T00:05:51.535551+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCOY2GXR7CPG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCOY2GXR7CPGMNJK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCOY2GXR","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J","json":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J.json","graph_json":"https://pith.science/api/pith-number/OCOY2GXR7CPGMNJKIXZOUJAO2J/graph.json","events_json":"https://pith.science/api/pith-number/OCOY2GXR7CPGMNJKIXZOUJAO2J/events.json","paper":"https://pith.science/paper/OCOY2GXR"},"agent_actions":{"view_html":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J","download_json":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J.json","view_paper":"https://pith.science/paper/OCOY2GXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04583&json=true","fetch_graph":"https://pith.science/api/pith-number/OCOY2GXR7CPGMNJKIXZOUJAO2J/graph.json","fetch_events":"https://pith.science/api/pith-number/OCOY2GXR7CPGMNJKIXZOUJAO2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/action/storage_attestation","attest_author":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/action/author_attestation","sign_citation":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/action/citation_signature","submit_replication":"https://pith.science/pith/OCOY2GXR7CPGMNJKIXZOUJAO2J/action/replication_record"}},"created_at":"2026-05-18T00:05:51.535551+00:00","updated_at":"2026-05-18T00:05:51.535551+00:00"}