{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KBXA3GSG62OVJZGLB2HNHZ5LWX","short_pith_number":"pith:KBXA3GSG","schema_version":"1.0","canonical_sha256":"506e0d9a46f69d54e4cb0e8ed3e7abb5c0f12f93188a3e9d0be401363e9a8d66","source":{"kind":"arxiv","id":"1503.03351","version":2},"attestation_state":"computed","paper":{"title":"Sampling colorings almost uniformly in sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chihao Zhang, Yitong Yin","submitted_at":"2015-03-11T14:31:49Z","abstract_excerpt":"The problem of sampling proper $q$-colorings from uniform distribution has been extensively studied. Most of existing samplers require $q\\ge \\alpha \\Delta+\\beta$ for some constants $\\alpha$ and $\\beta$, where $\\Delta$ is the maximum degree of the graph. The problem becomes more challenging when the underlying graph has unbounded degree since even the decision of $q$-colorability becomes nontrivial in this situation. The Erd\\H{o}s-R\\'{e}nyi random graph $\\mathcal{G}(n,d/n)$ is a typical class of such graphs and has received a lot of recent attention. In this case, the performance of a sampler i"},"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":"1503.03351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-11T14:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc6c13eb669abaa3f7dd721631bf4f502c54f73b7a82ea248081ddb5e97bb231","abstract_canon_sha256":"c42106de6b0087d6569aa468bd5a10ea421798082653338673590ae8b0c90272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:13.457927Z","signature_b64":"Ju4yBpUV5f+F1FmETGVrIxl3TL3Xcm5BVMhrnPMBWZ13T/I2l9iP5V70Bc/9Ya3cOwdaDeWXz93bcJvBw3UQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506e0d9a46f69d54e4cb0e8ed3e7abb5c0f12f93188a3e9d0be401363e9a8d66","last_reissued_at":"2026-05-18T01:36:13.457333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:13.457333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling colorings almost uniformly in sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chihao Zhang, Yitong Yin","submitted_at":"2015-03-11T14:31:49Z","abstract_excerpt":"The problem of sampling proper $q$-colorings from uniform distribution has been extensively studied. Most of existing samplers require $q\\ge \\alpha \\Delta+\\beta$ for some constants $\\alpha$ and $\\beta$, where $\\Delta$ is the maximum degree of the graph. The problem becomes more challenging when the underlying graph has unbounded degree since even the decision of $q$-colorability becomes nontrivial in this situation. The Erd\\H{o}s-R\\'{e}nyi random graph $\\mathcal{G}(n,d/n)$ is a typical class of such graphs and has received a lot of recent attention. In this case, the performance of a sampler i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03351","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":"1503.03351","created_at":"2026-05-18T01:36:13.457407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03351v2","created_at":"2026-05-18T01:36:13.457407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03351","created_at":"2026-05-18T01:36:13.457407+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBXA3GSG62OV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBXA3GSG62OVJZGL","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBXA3GSG","created_at":"2026-05-18T12:29:27.538025+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/KBXA3GSG62OVJZGLB2HNHZ5LWX","json":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX.json","graph_json":"https://pith.science/api/pith-number/KBXA3GSG62OVJZGLB2HNHZ5LWX/graph.json","events_json":"https://pith.science/api/pith-number/KBXA3GSG62OVJZGLB2HNHZ5LWX/events.json","paper":"https://pith.science/paper/KBXA3GSG"},"agent_actions":{"view_html":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX","download_json":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX.json","view_paper":"https://pith.science/paper/KBXA3GSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03351&json=true","fetch_graph":"https://pith.science/api/pith-number/KBXA3GSG62OVJZGLB2HNHZ5LWX/graph.json","fetch_events":"https://pith.science/api/pith-number/KBXA3GSG62OVJZGLB2HNHZ5LWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX/action/storage_attestation","attest_author":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX/action/author_attestation","sign_citation":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX/action/citation_signature","submit_replication":"https://pith.science/pith/KBXA3GSG62OVJZGLB2HNHZ5LWX/action/replication_record"}},"created_at":"2026-05-18T01:36:13.457407+00:00","updated_at":"2026-05-18T01:36:13.457407+00:00"}