{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DDUAUFJPBEO23GMJTIW2QNGXT6","short_pith_number":"pith:DDUAUFJP","canonical_record":{"source":{"id":"1308.5256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T22:19:33Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9e34819606961a6e70101d4b6d0f24746a9598d7c3351ee53e87061a0c98b0c7","abstract_canon_sha256":"84521b77ca77f25ec0f374cfccc356f5f5098190aa91a4936a0f92d54c6660bb"},"schema_version":"1.0"},"canonical_sha256":"18e80a152f091dad99899a2da834d79fabc526d8a229c0f1ea81b5e24a04788a","source":{"kind":"arxiv","id":"1308.5256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5256","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5256v1","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5256","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DDUAUFJPBEO2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDUAUFJPBEO23GMJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDUAUFJP","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DDUAUFJPBEO23GMJTIW2QNGXT6","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T22:19:33Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9e34819606961a6e70101d4b6d0f24746a9598d7c3351ee53e87061a0c98b0c7","abstract_canon_sha256":"84521b77ca77f25ec0f374cfccc356f5f5098190aa91a4936a0f92d54c6660bb"},"schema_version":"1.0"},"canonical_sha256":"18e80a152f091dad99899a2da834d79fabc526d8a229c0f1ea81b5e24a04788a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:07.303292Z","signature_b64":"IYJTABnCaGLON+Is5qCq99lH+t7Lf38WpIwImPCPy4xw1R59f6MOyZ8tXIuzOp+4ZXfTugmfDvFN1AxZNFuhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e80a152f091dad99899a2da834d79fabc526d8a229c0f1ea81b5e24a04788a","last_reissued_at":"2026-05-18T03:15:07.302333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:07.302333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5256","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:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTnzBFquIeQD90TTI5w+8HyRcq4/FszK6HdrLDZAac+q/kUQ8t8qTUamosLXMni8iZoboOfyLOZTYdsGnDFfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:56:51.244636Z"},"content_sha256":"7655db7fd2ffcb953e3e0e1d7ebbbe0141ca7b8c7a38c41947a038203f042a3c","schema_version":"1.0","event_id":"sha256:7655db7fd2ffcb953e3e0e1d7ebbbe0141ca7b8c7a38c41947a038203f042a3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DDUAUFJPBEO23GMJTIW2QNGXT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multireference Alignment using Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Amit Singer, Andy Zhu, Moses Charikar","submitted_at":"2013-08-23T22:19:33Z","abstract_excerpt":"The multireference alignment problem consists of estimating a signal from multiple noisy shifted observations. Inspired by existing Unique-Games approximation algorithms, we provide a semidefinite program (SDP) based relaxation which approximates the maximum likelihood estimator (MLE) for the multireference alignment problem. Although we show that the MLE problem is Unique-Games hard to approximate within any constant, we observe that our poly-time approximation algorithm for the MLE appears to perform quite well in typical instances, outperforming existing methods. In an attempt to explain th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5256","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:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KNBk22L7YgakvEF3vGchROUPf3iCWWy0XheFiamChHC/gwZxO5dtL7gjT9tRs0XPYucHTP/HxQbOyJxjatCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:56:51.245234Z"},"content_sha256":"ee01470de180bd55b55556332e924f6d28e4b56c220a95b5da122d56dd257e5e","schema_version":"1.0","event_id":"sha256:ee01470de180bd55b55556332e924f6d28e4b56c220a95b5da122d56dd257e5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/bundle.json","state_url":"https://pith.science/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/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-06T08:56:51Z","links":{"resolver":"https://pith.science/pith/DDUAUFJPBEO23GMJTIW2QNGXT6","bundle":"https://pith.science/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/bundle.json","state":"https://pith.science/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDUAUFJPBEO23GMJTIW2QNGXT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DDUAUFJPBEO23GMJTIW2QNGXT6","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":"84521b77ca77f25ec0f374cfccc356f5f5098190aa91a4936a0f92d54c6660bb","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T22:19:33Z","title_canon_sha256":"9e34819606961a6e70101d4b6d0f24746a9598d7c3351ee53e87061a0c98b0c7"},"schema_version":"1.0","source":{"id":"1308.5256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5256","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5256v1","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5256","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DDUAUFJPBEO2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDUAUFJPBEO23GMJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDUAUFJP","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:ee01470de180bd55b55556332e924f6d28e4b56c220a95b5da122d56dd257e5e","target":"graph","created_at":"2026-05-18T03:15:07Z","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":"The multireference alignment problem consists of estimating a signal from multiple noisy shifted observations. Inspired by existing Unique-Games approximation algorithms, we provide a semidefinite program (SDP) based relaxation which approximates the maximum likelihood estimator (MLE) for the multireference alignment problem. Although we show that the MLE problem is Unique-Games hard to approximate within any constant, we observe that our poly-time approximation algorithm for the MLE appears to perform quite well in typical instances, outperforming existing methods. In an attempt to explain th","authors_text":"Afonso S. Bandeira, Amit Singer, Andy Zhu, Moses Charikar","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T22:19:33Z","title":"Multireference Alignment using Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5256","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:7655db7fd2ffcb953e3e0e1d7ebbbe0141ca7b8c7a38c41947a038203f042a3c","target":"record","created_at":"2026-05-18T03:15:07Z","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":"84521b77ca77f25ec0f374cfccc356f5f5098190aa91a4936a0f92d54c6660bb","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T22:19:33Z","title_canon_sha256":"9e34819606961a6e70101d4b6d0f24746a9598d7c3351ee53e87061a0c98b0c7"},"schema_version":"1.0","source":{"id":"1308.5256","kind":"arxiv","version":1}},"canonical_sha256":"18e80a152f091dad99899a2da834d79fabc526d8a229c0f1ea81b5e24a04788a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18e80a152f091dad99899a2da834d79fabc526d8a229c0f1ea81b5e24a04788a","first_computed_at":"2026-05-18T03:15:07.302333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:07.302333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IYJTABnCaGLON+Is5qCq99lH+t7Lf38WpIwImPCPy4xw1R59f6MOyZ8tXIuzOp+4ZXfTugmfDvFN1AxZNFuhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:07.303292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7655db7fd2ffcb953e3e0e1d7ebbbe0141ca7b8c7a38c41947a038203f042a3c","sha256:ee01470de180bd55b55556332e924f6d28e4b56c220a95b5da122d56dd257e5e"],"state_sha256":"4376463b38bedf97a80271d4d416eca193bfb74ded32d0940377f4721cd9b707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FID8yTDM5JNZJnHPY0QRMWdhYJHC9Nbynu7dY/05swaDYOPXj2UwWFu+Ai6AIOUdFaFxM1icruvbpYQwO/eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:56:51.248347Z","bundle_sha256":"b00da9778d7f5a9d7e896a186762f36de1c47311061fc70d48848eda3445cf09"}}