{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PAIHHI5C6SRGPW2MLPCPCJCJ7Z","short_pith_number":"pith:PAIHHI5C","schema_version":"1.0","canonical_sha256":"781073a3a2f4a267db4c5bc4f12449fe7c45501cb2f56828c049010515e3e636","source":{"kind":"arxiv","id":"2505.21932","version":2},"attestation_state":"computed","paper":{"title":"Higher-Order Group Synchronization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.CO","math.OC"],"primary_cat":"stat.ML","authors_text":"Adriana L. Duncan, Joe Kileel","submitted_at":"2025-05-28T03:37:10Z","abstract_excerpt":"Group synchronization is the problem of determining reliable global estimates from noisy local measurements on networks. The typical task for group synchronization is to assign elements of a group to the nodes of a graph in a way that respects group elements given on the edges which encode information about local pairwise relationships between the nodes. In this paper, we introduce a novel higher-order group synchronization problem which operates on a hypergraph and seeks to synchronize higher-order local measurements on the hyperedges to obtain global estimates on the nodes. Higher-order grou"},"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":"2505.21932","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-28T03:37:10Z","cross_cats_sorted":["cs.CV","cs.LG","math.CO","math.OC"],"title_canon_sha256":"fb390fec03d9299e58b838b8d64a612eced213b5ebb55c30cc50147efdd2c502","abstract_canon_sha256":"7081cb22f113516acbc06261eca32c701134ef27ecff9bb80e066d8ae0d8ab5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:08.676667Z","signature_b64":"MEN3RI/k9SuxHSnSG+7WL9VDAKnwwsK+iR376DIH99GU9+/ewCcO+CjHJaJ5HahTKODChpNLh9EO9JGWE6BIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"781073a3a2f4a267db4c5bc4f12449fe7c45501cb2f56828c049010515e3e636","last_reissued_at":"2026-07-05T11:16:08.676167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:08.676167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Group Synchronization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.CO","math.OC"],"primary_cat":"stat.ML","authors_text":"Adriana L. Duncan, Joe Kileel","submitted_at":"2025-05-28T03:37:10Z","abstract_excerpt":"Group synchronization is the problem of determining reliable global estimates from noisy local measurements on networks. The typical task for group synchronization is to assign elements of a group to the nodes of a graph in a way that respects group elements given on the edges which encode information about local pairwise relationships between the nodes. In this paper, we introduce a novel higher-order group synchronization problem which operates on a hypergraph and seeks to synchronize higher-order local measurements on the hyperedges to obtain global estimates on the nodes. Higher-order grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21932","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.21932/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.21932","created_at":"2026-07-05T11:16:08.676227+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21932v2","created_at":"2026-07-05T11:16:08.676227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21932","created_at":"2026-07-05T11:16:08.676227+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAIHHI5C6SRG","created_at":"2026-07-05T11:16:08.676227+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAIHHI5C6SRGPW2M","created_at":"2026-07-05T11:16:08.676227+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAIHHI5C","created_at":"2026-07-05T11:16:08.676227+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.22639","citing_title":"QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z","json":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z.json","graph_json":"https://pith.science/api/pith-number/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/graph.json","events_json":"https://pith.science/api/pith-number/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/events.json","paper":"https://pith.science/paper/PAIHHI5C"},"agent_actions":{"view_html":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z","download_json":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z.json","view_paper":"https://pith.science/paper/PAIHHI5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21932&json=true","fetch_graph":"https://pith.science/api/pith-number/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/action/storage_attestation","attest_author":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/action/author_attestation","sign_citation":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/action/citation_signature","submit_replication":"https://pith.science/pith/PAIHHI5C6SRGPW2MLPCPCJCJ7Z/action/replication_record"}},"created_at":"2026-07-05T11:16:08.676227+00:00","updated_at":"2026-07-05T11:16:08.676227+00:00"}