{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DJLAPXOJO3WW5MKXFUWVKEKV5M","short_pith_number":"pith:DJLAPXOJ","schema_version":"1.0","canonical_sha256":"1a5607ddc976ed6eb1572d2d551155eb15e38f234d3722680de17725ae6a68a6","source":{"kind":"arxiv","id":"1712.10163","version":4},"attestation_state":"computed","paper":{"title":"Estimation under group actions: recovering orbits from invariants","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.AC","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry, Ben Blum-Smith, Joe Kileel, Jonathan Niles-Weed","submitted_at":"2017-12-29T09:53:24Z","abstract_excerpt":"We study a class of orbit recovery problems in which we observe independent copies of an unknown element of $\\mathbb{R}^p$, each linearly acted upon by a random element of some group (such as $\\mathbb{Z}/p$ or $\\mathrm{SO}(3)$) and then corrupted by additive Gaussian noise. We prove matching upper and lower bounds on the number of samples required to approximately recover the group orbit of this unknown element with high probability. These bounds, based on quantitative techniques in invariant theory, give a precise correspondence between the statistical difficulty of the estimation problem and"},"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":"1712.10163","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2017-12-29T09:53:24Z","cross_cats_sorted":["cs.DS","cs.IT","math.AC","math.IT","stat.TH"],"title_canon_sha256":"d3f7ebfe15cdf693d074c414cc5b1b49e4f0565f772c44d5473b458ab5b8f85f","abstract_canon_sha256":"d32661722a88a6b3f18081a1faed30d3564a0484a9d4ee84e84edce8c57d548d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:52.066820Z","signature_b64":"NwOwWfeMwt+WVBT7hePu8HgWB36LIwBUIN/SVWyePPkCIqJ6vQ+a3zPSO8eiFIACVy2aSfhBIrNJDMBkLx6UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5607ddc976ed6eb1572d2d551155eb15e38f234d3722680de17725ae6a68a6","last_reissued_at":"2026-07-05T06:23:52.066367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:52.066367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation under group actions: recovering orbits from invariants","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.AC","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry, Ben Blum-Smith, Joe Kileel, Jonathan Niles-Weed","submitted_at":"2017-12-29T09:53:24Z","abstract_excerpt":"We study a class of orbit recovery problems in which we observe independent copies of an unknown element of $\\mathbb{R}^p$, each linearly acted upon by a random element of some group (such as $\\mathbb{Z}/p$ or $\\mathrm{SO}(3)$) and then corrupted by additive Gaussian noise. We prove matching upper and lower bounds on the number of samples required to approximately recover the group orbit of this unknown element with high probability. These bounds, based on quantitative techniques in invariant theory, give a precise correspondence between the statistical difficulty of the estimation problem and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10163","kind":"arxiv","version":4},"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/1712.10163/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":"1712.10163","created_at":"2026-07-05T06:23:52.066426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.10163v4","created_at":"2026-07-05T06:23:52.066426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10163","created_at":"2026-07-05T06:23:52.066426+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJLAPXOJO3WW","created_at":"2026-07-05T06:23:52.066426+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJLAPXOJO3WW5MKX","created_at":"2026-07-05T06:23:52.066426+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJLAPXOJ","created_at":"2026-07-05T06:23:52.066426+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.12201","citing_title":"Functional Multi-Reference Alignment via Deconvolution","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07270","citing_title":"bispectrum: Selective $G$-Bispectra Made Practical","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M","json":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M.json","graph_json":"https://pith.science/api/pith-number/DJLAPXOJO3WW5MKXFUWVKEKV5M/graph.json","events_json":"https://pith.science/api/pith-number/DJLAPXOJO3WW5MKXFUWVKEKV5M/events.json","paper":"https://pith.science/paper/DJLAPXOJ"},"agent_actions":{"view_html":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M","download_json":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M.json","view_paper":"https://pith.science/paper/DJLAPXOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.10163&json=true","fetch_graph":"https://pith.science/api/pith-number/DJLAPXOJO3WW5MKXFUWVKEKV5M/graph.json","fetch_events":"https://pith.science/api/pith-number/DJLAPXOJO3WW5MKXFUWVKEKV5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M/action/storage_attestation","attest_author":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M/action/author_attestation","sign_citation":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M/action/citation_signature","submit_replication":"https://pith.science/pith/DJLAPXOJO3WW5MKXFUWVKEKV5M/action/replication_record"}},"created_at":"2026-07-05T06:23:52.066426+00:00","updated_at":"2026-07-05T06:23:52.066426+00:00"}