{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AL4HQYTD7EYLPJ25P6OI6SLLYB","short_pith_number":"pith:AL4HQYTD","schema_version":"1.0","canonical_sha256":"02f8786263f930b7a75d7f9c8f496bc0680365fbf1987c26d0242dbcb84f5376","source":{"kind":"arxiv","id":"1804.03156","version":2},"attestation_state":"computed","paper":{"title":"Linear Programming Bounds for Randomly Sampling Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math-ph","math.MP","math.PR"],"primary_cat":"cs.DS","authors_text":"Ankur Moitra, Sitan Chen","submitted_at":"2018-04-09T18:00:14Z","abstract_excerpt":"Here we study the problem of sampling random proper colorings of a bounded degree graph. Let $k$ be the number of colors and let $d$ be the maximum degree. In 1999, Vigoda showed that the Glauber dynamics is rapidly mixing for any $k > \\frac{11}{6} d$. It turns out that there is a natural barrier at $\\frac{11}{6}$, below which there is no one-step coupling that is contractive, even for the flip dynamics.\n  We use linear programming and duality arguments to guide our construction of a better coupling. We fully characterize the obstructions to going beyond $\\frac{11}{6}$. These examples turn out"},"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":"1804.03156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T18:00:14Z","cross_cats_sorted":["cs.DM","math-ph","math.MP","math.PR"],"title_canon_sha256":"168ad916a9601e48a6e5d3ccc450f2b45080ce4ed38bf7460d6d7c2b745544e3","abstract_canon_sha256":"84e5ef4044bb65f811a114868b39479a1da4b376e5ead381ebc9c05588bb15dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:59.996578Z","signature_b64":"E4yTY7XJFewx/SKAO6Vzbx6wRa/bSY1+jkBuDJoxO99TREopSciVJD3p7Gf6a2bKAfpQ5YSD6+poQpCbxwx6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f8786263f930b7a75d7f9c8f496bc0680365fbf1987c26d0242dbcb84f5376","last_reissued_at":"2026-05-18T00:13:59.995876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:59.995876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming Bounds for Randomly Sampling Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math-ph","math.MP","math.PR"],"primary_cat":"cs.DS","authors_text":"Ankur Moitra, Sitan Chen","submitted_at":"2018-04-09T18:00:14Z","abstract_excerpt":"Here we study the problem of sampling random proper colorings of a bounded degree graph. Let $k$ be the number of colors and let $d$ be the maximum degree. In 1999, Vigoda showed that the Glauber dynamics is rapidly mixing for any $k > \\frac{11}{6} d$. It turns out that there is a natural barrier at $\\frac{11}{6}$, below which there is no one-step coupling that is contractive, even for the flip dynamics.\n  We use linear programming and duality arguments to guide our construction of a better coupling. We fully characterize the obstructions to going beyond $\\frac{11}{6}$. These examples turn out"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03156","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":""},"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":"1804.03156","created_at":"2026-05-18T00:13:59.995995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03156v2","created_at":"2026-05-18T00:13:59.995995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03156","created_at":"2026-05-18T00:13:59.995995+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL4HQYTD7EYL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL4HQYTD7EYLPJ25","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL4HQYTD","created_at":"2026-05-18T12:32:13.499390+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/AL4HQYTD7EYLPJ25P6OI6SLLYB","json":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB.json","graph_json":"https://pith.science/api/pith-number/AL4HQYTD7EYLPJ25P6OI6SLLYB/graph.json","events_json":"https://pith.science/api/pith-number/AL4HQYTD7EYLPJ25P6OI6SLLYB/events.json","paper":"https://pith.science/paper/AL4HQYTD"},"agent_actions":{"view_html":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB","download_json":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB.json","view_paper":"https://pith.science/paper/AL4HQYTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03156&json=true","fetch_graph":"https://pith.science/api/pith-number/AL4HQYTD7EYLPJ25P6OI6SLLYB/graph.json","fetch_events":"https://pith.science/api/pith-number/AL4HQYTD7EYLPJ25P6OI6SLLYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB/action/storage_attestation","attest_author":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB/action/author_attestation","sign_citation":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB/action/citation_signature","submit_replication":"https://pith.science/pith/AL4HQYTD7EYLPJ25P6OI6SLLYB/action/replication_record"}},"created_at":"2026-05-18T00:13:59.995995+00:00","updated_at":"2026-05-18T00:13:59.995995+00:00"}