{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A6YQQNU7HCFXRWHMZ5CFERC7KV","short_pith_number":"pith:A6YQQNU7","schema_version":"1.0","canonical_sha256":"07b108369f388b78d8eccf4452445f554b27cb71a2278626bbeb1aaa24750a60","source":{"kind":"arxiv","id":"1608.01008","version":3},"attestation_state":"computed","paper":{"title":"Fast Mixing Markov Chains for Strongly Rayleigh Measures, DPPs, and Constrained Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2016-08-02T21:15:30Z","abstract_excerpt":"We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider the task of rapidly sampling from such constrained measures, and develop fast Markov chain samplers for them. Our first main result is for MCMC sampling from Strongly Rayleigh (SR) measures, for which we present sharp polynomial bounds on the mixing time. As a corollary, this result yields a fast mixing sampler for Determinantal Point Processes (DPPs), yiel"},"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":"1608.01008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T21:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"b96e2852ebcf94c08975a1d8e107c394a4964724d8cf3daf244991b512192084","abstract_canon_sha256":"b896e3a419d1ebb70a3c70f2aaea336b61002e199f7c8fb86397391d661fd2a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:15.549933Z","signature_b64":"J7UvXJACCKLfGdPF9lFgGs2RPokq3ywBj2yprQPtlfhsbGXPoLVl6H0UQfTxBKqxNajVWrVagflLX81DaxOCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07b108369f388b78d8eccf4452445f554b27cb71a2278626bbeb1aaa24750a60","last_reissued_at":"2026-05-18T00:53:15.549563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:15.549563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Mixing Markov Chains for Strongly Rayleigh Measures, DPPs, and Constrained Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2016-08-02T21:15:30Z","abstract_excerpt":"We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider the task of rapidly sampling from such constrained measures, and develop fast Markov chain samplers for them. Our first main result is for MCMC sampling from Strongly Rayleigh (SR) measures, for which we present sharp polynomial bounds on the mixing time. As a corollary, this result yields a fast mixing sampler for Determinantal Point Processes (DPPs), yiel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01008","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01008","created_at":"2026-05-18T00:53:15.549629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01008v3","created_at":"2026-05-18T00:53:15.549629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01008","created_at":"2026-05-18T00:53:15.549629+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6YQQNU7HCFX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6YQQNU7HCFXRWHM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6YQQNU7","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV","json":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV.json","graph_json":"https://pith.science/api/pith-number/A6YQQNU7HCFXRWHMZ5CFERC7KV/graph.json","events_json":"https://pith.science/api/pith-number/A6YQQNU7HCFXRWHMZ5CFERC7KV/events.json","paper":"https://pith.science/paper/A6YQQNU7"},"agent_actions":{"view_html":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV","download_json":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV.json","view_paper":"https://pith.science/paper/A6YQQNU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01008&json=true","fetch_graph":"https://pith.science/api/pith-number/A6YQQNU7HCFXRWHMZ5CFERC7KV/graph.json","fetch_events":"https://pith.science/api/pith-number/A6YQQNU7HCFXRWHMZ5CFERC7KV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV/action/storage_attestation","attest_author":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV/action/author_attestation","sign_citation":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV/action/citation_signature","submit_replication":"https://pith.science/pith/A6YQQNU7HCFXRWHMZ5CFERC7KV/action/replication_record"}},"created_at":"2026-05-18T00:53:15.549629+00:00","updated_at":"2026-05-18T00:53:15.549629+00:00"}