{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MKZSUJGDSYQLS3UHGLGAFZUDJD","short_pith_number":"pith:MKZSUJGD","schema_version":"1.0","canonical_sha256":"62b32a24c39620b96e8732cc02e68348e0e392fcd8d3c12da8ef730e738c28e1","source":{"kind":"arxiv","id":"1308.4287","version":1},"attestation_state":"computed","paper":{"title":"On the chromatic number of random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich","submitted_at":"2013-08-20T12:27:22Z","abstract_excerpt":"Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}."},"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":"1308.4287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T12:27:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"999886442ccf33e7941ee445b0dfabbde21844eb3397910716d323386b491e83","abstract_canon_sha256":"e9367c5d433d621e554e4b771e4e5bd28ae5c1728bb5464b9d815701ff2da6be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.250975Z","signature_b64":"KiU7Z4xoPut98MkoZo3KwhNMo0jVvFucfY50DTJJAKfgKEY4c9yrmP21aCQx00FimUYFlZfDf15iVeak5JkGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b32a24c39620b96e8732cc02e68348e0e392fcd8d3c12da8ef730e738c28e1","last_reissued_at":"2026-05-18T03:15:33.250234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.250234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the chromatic number of random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich","submitted_at":"2013-08-20T12:27:22Z","abstract_excerpt":"Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4287","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":""},"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":"1308.4287","created_at":"2026-05-18T03:15:33.250366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4287v1","created_at":"2026-05-18T03:15:33.250366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4287","created_at":"2026-05-18T03:15:33.250366+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKZSUJGDSYQL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKZSUJGDSYQLS3UH","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKZSUJGD","created_at":"2026-05-18T12:27:52.871228+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/MKZSUJGDSYQLS3UHGLGAFZUDJD","json":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD.json","graph_json":"https://pith.science/api/pith-number/MKZSUJGDSYQLS3UHGLGAFZUDJD/graph.json","events_json":"https://pith.science/api/pith-number/MKZSUJGDSYQLS3UHGLGAFZUDJD/events.json","paper":"https://pith.science/paper/MKZSUJGD"},"agent_actions":{"view_html":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD","download_json":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD.json","view_paper":"https://pith.science/paper/MKZSUJGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4287&json=true","fetch_graph":"https://pith.science/api/pith-number/MKZSUJGDSYQLS3UHGLGAFZUDJD/graph.json","fetch_events":"https://pith.science/api/pith-number/MKZSUJGDSYQLS3UHGLGAFZUDJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD/action/storage_attestation","attest_author":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD/action/author_attestation","sign_citation":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD/action/citation_signature","submit_replication":"https://pith.science/pith/MKZSUJGDSYQLS3UHGLGAFZUDJD/action/replication_record"}},"created_at":"2026-05-18T03:15:33.250366+00:00","updated_at":"2026-05-18T03:15:33.250366+00:00"}