{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GETBENHUDA7CSSKBHU4IJQ3C3G","short_pith_number":"pith:GETBENHU","schema_version":"1.0","canonical_sha256":"31261234f4183e2949413d3884c362d982d5966e8bafb559781963375d9aabd9","source":{"kind":"arxiv","id":"1304.1063","version":3},"attestation_state":"computed","paper":{"title":"Chasing the k-colorability threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Amin Coja-Oghlan, Dan Vilenchik","submitted_at":"2013-04-03T19:21:08Z","abstract_excerpt":"Over the past decade, physicists have developed deep but non-rigorous techniques for studying phase transitions in discrete structures. Recently, their ideas have been harnessed to obtain improved rigorous results on the phase transitions in binary problems such as random $k$-SAT or $k$-NAESAT (e.g., Coja-Oghlan and Panagiotou: STOC 2013). However, these rigorous arguments, typically centered around the second moment method, do not extend easily to problems where there are more than two possible values per variable. The single most intensely studied example of such a problem is random graph $k"},"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":"1304.1063","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-03T19:21:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"75e52da1b4f22cf01d564223fdd0c9377415fe14b153a9f82d9b65828f2e876f","abstract_canon_sha256":"a8d4608735b44eaf29eb97b9149cb2db704bbe6d7e86a005d6a3492c4af5e574"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:29.067796Z","signature_b64":"5kFGOC6XjfqAuHmawub8xYaydA84XVb1do6rc7NMDL0kUwLvBa70iJVQcjCedfWFlD7rvmnxzOlDZcnIIyUODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31261234f4183e2949413d3884c362d982d5966e8bafb559781963375d9aabd9","last_reissued_at":"2026-05-18T00:30:29.067215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:29.067215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chasing the k-colorability threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Amin Coja-Oghlan, Dan Vilenchik","submitted_at":"2013-04-03T19:21:08Z","abstract_excerpt":"Over the past decade, physicists have developed deep but non-rigorous techniques for studying phase transitions in discrete structures. Recently, their ideas have been harnessed to obtain improved rigorous results on the phase transitions in binary problems such as random $k$-SAT or $k$-NAESAT (e.g., Coja-Oghlan and Panagiotou: STOC 2013). However, these rigorous arguments, typically centered around the second moment method, do not extend easily to problems where there are more than two possible values per variable. The single most intensely studied example of such a problem is random graph $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1063","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":"1304.1063","created_at":"2026-05-18T00:30:29.067296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1063v3","created_at":"2026-05-18T00:30:29.067296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1063","created_at":"2026-05-18T00:30:29.067296+00:00"},{"alias_kind":"pith_short_12","alias_value":"GETBENHUDA7C","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GETBENHUDA7CSSKB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GETBENHU","created_at":"2026-05-18T12:27:45.050594+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/GETBENHUDA7CSSKBHU4IJQ3C3G","json":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G.json","graph_json":"https://pith.science/api/pith-number/GETBENHUDA7CSSKBHU4IJQ3C3G/graph.json","events_json":"https://pith.science/api/pith-number/GETBENHUDA7CSSKBHU4IJQ3C3G/events.json","paper":"https://pith.science/paper/GETBENHU"},"agent_actions":{"view_html":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G","download_json":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G.json","view_paper":"https://pith.science/paper/GETBENHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1063&json=true","fetch_graph":"https://pith.science/api/pith-number/GETBENHUDA7CSSKBHU4IJQ3C3G/graph.json","fetch_events":"https://pith.science/api/pith-number/GETBENHUDA7CSSKBHU4IJQ3C3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G/action/storage_attestation","attest_author":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G/action/author_attestation","sign_citation":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G/action/citation_signature","submit_replication":"https://pith.science/pith/GETBENHUDA7CSSKBHU4IJQ3C3G/action/replication_record"}},"created_at":"2026-05-18T00:30:29.067296+00:00","updated_at":"2026-05-18T00:30:29.067296+00:00"}