{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TOTVW73SVKXMLUIYYUETNHSEKE","short_pith_number":"pith:TOTVW73S","schema_version":"1.0","canonical_sha256":"9ba75b7f72aaaec5d118c509369e445112bf1eff35616d2fd120eaad9723831c","source":{"kind":"arxiv","id":"1103.3917","version":3},"attestation_state":"computed","paper":{"title":"Large chromatic number and Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csaba Bir\\'o, Sogol Jahanbekam, Zolt\\'an F\\\"uredi","submitted_at":"2011-03-21T04:58:29Z","abstract_excerpt":"Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2."},"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":"1103.3917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-21T04:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"06b50a2b62a1833928e1f8dee455e7f845052e5712aaa540b13e7e08a48251bd","abstract_canon_sha256":"7062002bcb5ebf5ea5ad867df62db0196b1e692c29c509138975b95128891aee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:14.191070Z","signature_b64":"JugQ7FrmpewMIJkml+he3N7pg9O2Dky2SeKbp4eOKha2dM25nwhRTJdHrqrtUOFc2G7CojacbsCfYgMEZJLFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba75b7f72aaaec5d118c509369e445112bf1eff35616d2fd120eaad9723831c","last_reissued_at":"2026-05-18T03:58:14.190515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:14.190515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large chromatic number and Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csaba Bir\\'o, Sogol Jahanbekam, Zolt\\'an F\\\"uredi","submitted_at":"2011-03-21T04:58:29Z","abstract_excerpt":"Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3917","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":"1103.3917","created_at":"2026-05-18T03:58:14.190586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3917v3","created_at":"2026-05-18T03:58:14.190586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3917","created_at":"2026-05-18T03:58:14.190586+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOTVW73SVKXM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOTVW73SVKXMLUIY","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOTVW73S","created_at":"2026-05-18T12:26:42.757692+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/TOTVW73SVKXMLUIYYUETNHSEKE","json":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE.json","graph_json":"https://pith.science/api/pith-number/TOTVW73SVKXMLUIYYUETNHSEKE/graph.json","events_json":"https://pith.science/api/pith-number/TOTVW73SVKXMLUIYYUETNHSEKE/events.json","paper":"https://pith.science/paper/TOTVW73S"},"agent_actions":{"view_html":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE","download_json":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE.json","view_paper":"https://pith.science/paper/TOTVW73S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3917&json=true","fetch_graph":"https://pith.science/api/pith-number/TOTVW73SVKXMLUIYYUETNHSEKE/graph.json","fetch_events":"https://pith.science/api/pith-number/TOTVW73SVKXMLUIYYUETNHSEKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE/action/storage_attestation","attest_author":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE/action/author_attestation","sign_citation":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE/action/citation_signature","submit_replication":"https://pith.science/pith/TOTVW73SVKXMLUIYYUETNHSEKE/action/replication_record"}},"created_at":"2026-05-18T03:58:14.190586+00:00","updated_at":"2026-05-18T03:58:14.190586+00:00"}