{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ROMG2LXND6I5ZT3CPXFFBNE7LL","short_pith_number":"pith:ROMG2LXN","schema_version":"1.0","canonical_sha256":"8b986d2eed1f91dccf627dca50b49f5af72980bcb1e4afbfe341a2794bd7c1ca","source":{"kind":"arxiv","id":"2107.03932","version":1},"attestation_state":"computed","paper":{"title":"Perfect Sampling for (Atomic) Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Kewen Wu, Kun He, Xiaoming Sun","submitted_at":"2021-07-08T16:04:40Z","abstract_excerpt":"We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lov\\'asz local lemma conditions where each constraint of the CSP has a small number of forbidden local configurations, our algorithm is accurate and efficient: it outputs a perfect uniform random solution and its expected running time is quasilinear in the number of variables. Prior to our work, perfect samplers are only shown to exist for CSPs under much more restrictive conditions (Guo, Jerrum, and Liu, JACM'19).\n  Our algorithm has two components:\n  1. A sim"},"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":"2107.03932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-08T16:04:40Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"bc380dfc57315106f6d9cc364bbbc81c4c51be8ce75a891b319eb7bfefa178c6","abstract_canon_sha256":"1679f2d6650ac3e7cbd3569a369a14303f3e06a65b1f0c79c0d9a81d2708ddc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:20.874788Z","signature_b64":"1KXkcz8LhvBneiuw0TfHmHbBnPD9nJTos7kR9mPO1SJkgbwjabVLwgVpwefstPomVZbaIaMwHJx8zLcuAerTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b986d2eed1f91dccf627dca50b49f5af72980bcb1e4afbfe341a2794bd7c1ca","last_reissued_at":"2026-07-05T02:56:20.874453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:20.874453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Sampling for (Atomic) Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Kewen Wu, Kun He, Xiaoming Sun","submitted_at":"2021-07-08T16:04:40Z","abstract_excerpt":"We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lov\\'asz local lemma conditions where each constraint of the CSP has a small number of forbidden local configurations, our algorithm is accurate and efficient: it outputs a perfect uniform random solution and its expected running time is quasilinear in the number of variables. Prior to our work, perfect samplers are only shown to exist for CSPs under much more restrictive conditions (Guo, Jerrum, and Liu, JACM'19).\n  Our algorithm has two components:\n  1. A sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.03932","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.03932/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":"2107.03932","created_at":"2026-07-05T02:56:20.874509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.03932v1","created_at":"2026-07-05T02:56:20.874509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.03932","created_at":"2026-07-05T02:56:20.874509+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROMG2LXND6I5","created_at":"2026-07-05T02:56:20.874509+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROMG2LXND6I5ZT3C","created_at":"2026-07-05T02:56:20.874509+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROMG2LXN","created_at":"2026-07-05T02:56:20.874509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03839","citing_title":"On Computing Total Variation Distance Between Mixtures of Product Distributions","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL","json":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL.json","graph_json":"https://pith.science/api/pith-number/ROMG2LXND6I5ZT3CPXFFBNE7LL/graph.json","events_json":"https://pith.science/api/pith-number/ROMG2LXND6I5ZT3CPXFFBNE7LL/events.json","paper":"https://pith.science/paper/ROMG2LXN"},"agent_actions":{"view_html":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL","download_json":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL.json","view_paper":"https://pith.science/paper/ROMG2LXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.03932&json=true","fetch_graph":"https://pith.science/api/pith-number/ROMG2LXND6I5ZT3CPXFFBNE7LL/graph.json","fetch_events":"https://pith.science/api/pith-number/ROMG2LXND6I5ZT3CPXFFBNE7LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL/action/storage_attestation","attest_author":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL/action/author_attestation","sign_citation":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL/action/citation_signature","submit_replication":"https://pith.science/pith/ROMG2LXND6I5ZT3CPXFFBNE7LL/action/replication_record"}},"created_at":"2026-07-05T02:56:20.874509+00:00","updated_at":"2026-07-05T02:56:20.874509+00:00"}