{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5UQCP2VUKEIFMG5FNFBBRLBV34","short_pith_number":"pith:5UQCP2VU","schema_version":"1.0","canonical_sha256":"ed2027eab45110561ba5694218ac35df054c05021a09a7fcf346f02c38322a7c","source":{"kind":"arxiv","id":"1212.1328","version":3},"attestation_state":"computed","paper":{"title":"A New Lower Bound for the Ramsey Number R(4, 8)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hiroshi Fujita","submitted_at":"2012-12-06T14:04:42Z","abstract_excerpt":"The lower bound for the classical Ramsey number R(4, 8) is improved from 56 to 58. The author has found a new edge coloring of K_{57} that has no complete graphs of order 4 in the first color, and no complete graphs of order 8 in the second color. The coloring was found using a SAT solver which is based on MiniSat and customized for solving Ramsey problems."},"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":"1212.1328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-06T14:04:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a29ea7d41d8435302dfbb5cc57ad0faf9238e570b6bb3227917bfaa04cdbc846","abstract_canon_sha256":"5c7c36dbe74a6f9c2562f52c0305cf69bfaa36147109cf306ad797d702272d08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.931410Z","signature_b64":"lirAZBIiHXpYRzgtCsw0EueXil6HL+hf/HaTzdYugPrewREoEBux9PKV8MS1vkNqlK9p+jv78nGbKU0BJObUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2027eab45110561ba5694218ac35df054c05021a09a7fcf346f02c38322a7c","last_reissued_at":"2026-05-18T03:29:26.930656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.930656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Lower Bound for the Ramsey Number R(4, 8)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hiroshi Fujita","submitted_at":"2012-12-06T14:04:42Z","abstract_excerpt":"The lower bound for the classical Ramsey number R(4, 8) is improved from 56 to 58. The author has found a new edge coloring of K_{57} that has no complete graphs of order 4 in the first color, and no complete graphs of order 8 in the second color. The coloring was found using a SAT solver which is based on MiniSat and customized for solving Ramsey problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1328","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":"1212.1328","created_at":"2026-05-18T03:29:26.930791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1328v3","created_at":"2026-05-18T03:29:26.930791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1328","created_at":"2026-05-18T03:29:26.930791+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UQCP2VUKEIF","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UQCP2VUKEIFMG5F","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UQCP2VU","created_at":"2026-05-18T12:26:56.085431+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/5UQCP2VUKEIFMG5FNFBBRLBV34","json":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34.json","graph_json":"https://pith.science/api/pith-number/5UQCP2VUKEIFMG5FNFBBRLBV34/graph.json","events_json":"https://pith.science/api/pith-number/5UQCP2VUKEIFMG5FNFBBRLBV34/events.json","paper":"https://pith.science/paper/5UQCP2VU"},"agent_actions":{"view_html":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34","download_json":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34.json","view_paper":"https://pith.science/paper/5UQCP2VU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1328&json=true","fetch_graph":"https://pith.science/api/pith-number/5UQCP2VUKEIFMG5FNFBBRLBV34/graph.json","fetch_events":"https://pith.science/api/pith-number/5UQCP2VUKEIFMG5FNFBBRLBV34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34/action/storage_attestation","attest_author":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34/action/author_attestation","sign_citation":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34/action/citation_signature","submit_replication":"https://pith.science/pith/5UQCP2VUKEIFMG5FNFBBRLBV34/action/replication_record"}},"created_at":"2026-05-18T03:29:26.930791+00:00","updated_at":"2026-05-18T03:29:26.930791+00:00"}