{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4GBXUOFPFIRHWMUTDWYYGMHDXZ","short_pith_number":"pith:4GBXUOFP","canonical_record":{"source":{"id":"1706.08561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T18:56:53Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"443759622c3ca934d03c2a1c434d8cf94b907ae657d4f9c65084399885567f38","abstract_canon_sha256":"ab1c0716de399ac53e239010e8751488e7321a066bf1b96f84fc7091c0993015"},"schema_version":"1.0"},"canonical_sha256":"e1837a38af2a227b32931db18330e3be5d96c76411a81e20d7f65ab801ffc5ce","source":{"kind":"arxiv","id":"1706.08561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08561","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08561v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08561","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"4GBXUOFPFIRH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GBXUOFPFIRHWMUT","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GBXUOFP","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4GBXUOFPFIRHWMUTDWYYGMHDXZ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T18:56:53Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"443759622c3ca934d03c2a1c434d8cf94b907ae657d4f9c65084399885567f38","abstract_canon_sha256":"ab1c0716de399ac53e239010e8751488e7321a066bf1b96f84fc7091c0993015"},"schema_version":"1.0"},"canonical_sha256":"e1837a38af2a227b32931db18330e3be5d96c76411a81e20d7f65ab801ffc5ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.716796Z","signature_b64":"rBYhacAIWXi97Vj8/kyaXxt5IgdcqhJp2RXK7mdBqG0LwqJ71NUnmO2+083e5xypLWhLuvMPrsAGpZ5jKubvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1837a38af2a227b32931db18330e3be5d96c76411a81e20d7f65ab801ffc5ce","last_reissued_at":"2026-05-18T00:41:31.716300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.716300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08561","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkCAOmB8Vlbcl7vNc98US3WN1k2EKDxWgYeVIgcNiqSOZ11ZSjWWEXsHd810uh3QjOGEejD9Ffrfpi9E72q8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:37:42.708840Z"},"content_sha256":"bf68e7b3851392ace9434fc7a72e1011ba27a546e66a53ed3cfc753cae0463e2","schema_version":"1.0","event_id":"sha256:bf68e7b3851392ace9434fc7a72e1011ba27a546e66a53ed3cfc753cae0463e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4GBXUOFPFIRHWMUTDWYYGMHDXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Synchronization on Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Allan Sly, Andrea Montanari, Emmanuel Abbe, Laurent Massoulie, Nikhil Srivastava","submitted_at":"2017-06-26T18:56:53Z","abstract_excerpt":"Group synchronization requires to estimate unknown elements $({\\theta}_v)_{v\\in V}$ of a compact group ${\\mathfrak G}$ associated to the vertices of a graph $G=(V,E)$, using noisy observations of the group differences associated to the edges. This model is relevant to a variety of applications ranging from structure from motion in computer vision to graph localization and positioning, to certain families of community detection problems.\n  We focus on the case in which the graph $G$ is the $d$-dimensional grid. Since the unknowns ${\\boldsymbol \\theta}_v$ are only determined up to a global actio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08561","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FPd+ts3/UMc8ioen79MSO3G1lOcB4CmYiV0mqYMwqtgUcTUq4FqI1d90287vdF6RRFdfh2S6jiLBwy0R7DYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:37:42.709480Z"},"content_sha256":"43efc9744f35377faca43856455e1ce925b7f256dc91b2183660d66552b4923b","schema_version":"1.0","event_id":"sha256:43efc9744f35377faca43856455e1ce925b7f256dc91b2183660d66552b4923b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/bundle.json","state_url":"https://pith.science/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/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-18T17:37:42Z","links":{"resolver":"https://pith.science/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ","bundle":"https://pith.science/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/bundle.json","state":"https://pith.science/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GBXUOFPFIRHWMUTDWYYGMHDXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4GBXUOFPFIRHWMUTDWYYGMHDXZ","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":"ab1c0716de399ac53e239010e8751488e7321a066bf1b96f84fc7091c0993015","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T18:56:53Z","title_canon_sha256":"443759622c3ca934d03c2a1c434d8cf94b907ae657d4f9c65084399885567f38"},"schema_version":"1.0","source":{"id":"1706.08561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08561","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08561v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08561","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"4GBXUOFPFIRH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GBXUOFPFIRHWMUT","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GBXUOFP","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:43efc9744f35377faca43856455e1ce925b7f256dc91b2183660d66552b4923b","target":"graph","created_at":"2026-05-18T00:41:31Z","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":"Group synchronization requires to estimate unknown elements $({\\theta}_v)_{v\\in V}$ of a compact group ${\\mathfrak G}$ associated to the vertices of a graph $G=(V,E)$, using noisy observations of the group differences associated to the edges. This model is relevant to a variety of applications ranging from structure from motion in computer vision to graph localization and positioning, to certain families of community detection problems.\n  We focus on the case in which the graph $G$ is the $d$-dimensional grid. Since the unknowns ${\\boldsymbol \\theta}_v$ are only determined up to a global actio","authors_text":"Allan Sly, Andrea Montanari, Emmanuel Abbe, Laurent Massoulie, Nikhil Srivastava","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T18:56:53Z","title":"Group Synchronization on Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08561","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:bf68e7b3851392ace9434fc7a72e1011ba27a546e66a53ed3cfc753cae0463e2","target":"record","created_at":"2026-05-18T00:41:31Z","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":"ab1c0716de399ac53e239010e8751488e7321a066bf1b96f84fc7091c0993015","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-06-26T18:56:53Z","title_canon_sha256":"443759622c3ca934d03c2a1c434d8cf94b907ae657d4f9c65084399885567f38"},"schema_version":"1.0","source":{"id":"1706.08561","kind":"arxiv","version":1}},"canonical_sha256":"e1837a38af2a227b32931db18330e3be5d96c76411a81e20d7f65ab801ffc5ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1837a38af2a227b32931db18330e3be5d96c76411a81e20d7f65ab801ffc5ce","first_computed_at":"2026-05-18T00:41:31.716300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.716300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rBYhacAIWXi97Vj8/kyaXxt5IgdcqhJp2RXK7mdBqG0LwqJ71NUnmO2+083e5xypLWhLuvMPrsAGpZ5jKubvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.716796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf68e7b3851392ace9434fc7a72e1011ba27a546e66a53ed3cfc753cae0463e2","sha256:43efc9744f35377faca43856455e1ce925b7f256dc91b2183660d66552b4923b"],"state_sha256":"c1186097e9849cecc7eae3adbec3b63ad3ede9cbda583cdcfb203a7ff64f420e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lVM++Syuq2HHB9L0wUgAEZjMyNA2q//IVeaJ/c/0VcW0n5BDYQAXOs8NqYeFudQLY2FkZMf2QXMQ1h0RyrfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T17:37:42.711509Z","bundle_sha256":"9860cf248019dc078cd4aa199481aa73665eecd5caf33acdc05157aa93ca4cae"}}