{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RDUWLDBDI4CS7PHQLUMEJLHLOQ","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":"967dc99bb45be2f03cd7c08d586cfbce4d69c79b2539bec0986ed2617639dbcf","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T20:47:23Z","title_canon_sha256":"5105a5451755eb9277bd5e4dc330727a51b69721464e9370d1d02177e19afa7d"},"schema_version":"1.0","source":{"id":"1211.2227","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2227","created_at":"2026-05-18T03:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2227v3","created_at":"2026-05-18T03:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2227","created_at":"2026-05-18T03:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"RDUWLDBDI4CS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDUWLDBDI4CS7PHQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDUWLDBD","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:9ff4b929e2ca3f1fb21c8c8f24c24154032e904bbc37c2fd046359b5c4653d76","target":"graph","created_at":"2026-05-18T03:21:43Z","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":"We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan [FJK]. Our result can also be interpreted as efficiently learning the intersection of n+1 half-spaces in R^n in the model where the intersection is bounded and we are given polynomially many uniform samples from it. Our proof uses the local search technique from Independent Component Analysis (","authors_text":"Joseph Anderson, Luis Rademacher, Navin Goyal","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T20:47:23Z","title":"Efficient learning of simplices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2227","kind":"arxiv","version":3},"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:6f458fe434978e594fb9b7f96c3e91ca187796edb6db5d0b691c7a8ccecd5f8d","target":"record","created_at":"2026-05-18T03:21:43Z","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":"967dc99bb45be2f03cd7c08d586cfbce4d69c79b2539bec0986ed2617639dbcf","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T20:47:23Z","title_canon_sha256":"5105a5451755eb9277bd5e4dc330727a51b69721464e9370d1d02177e19afa7d"},"schema_version":"1.0","source":{"id":"1211.2227","kind":"arxiv","version":3}},"canonical_sha256":"88e9658c2347052fbcf05d1844aceb740fc342ae2ae614519dee72c58285a011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e9658c2347052fbcf05d1844aceb740fc342ae2ae614519dee72c58285a011","first_computed_at":"2026-05-18T03:21:43.502753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:43.502753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"duHmLxgdiCStb3GsvradHYY628JXyiPtStJvMt2hCtvo3VGbCJGbBWzbevStsbLHiAnvtstPjDYuFCbEjuE4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:43.503255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2227","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f458fe434978e594fb9b7f96c3e91ca187796edb6db5d0b691c7a8ccecd5f8d","sha256:9ff4b929e2ca3f1fb21c8c8f24c24154032e904bbc37c2fd046359b5c4653d76"],"state_sha256":"890d8d09e34408d23d7b2270c6a9d96910a12af5de597d9a2e80c782042ce912"}