{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LWY535OP335ZG3UOVAVPNOLJVQ","short_pith_number":"pith:LWY535OP","schema_version":"1.0","canonical_sha256":"5db1ddf5cfdefb936e8ea82af6b969ac3e7e829652103041c7df50328af4fb75","source":{"kind":"arxiv","id":"1604.03716","version":1},"attestation_state":"computed","paper":{"title":"Small minimal $(3, 3)$-Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Bikov","submitted_at":"2016-04-13T10:40:39Z","abstract_excerpt":"We say that $G$ is a $(3, 3)$-Ramsey graph if every $2$-coloring of the edges of $G$ forces a monochromatic triangle. The $(3, 3)$-Ramsey graph $G$ is minimal if $G$ does not contain a proper $(3, 3)$-Ramsey subgraph. In this work we find all minimal $(3, 3)$-Ramsey graphs with up to 13 vertices with the help of a computer, and we obtain some new results for these graphs. We also obtain new upper bounds on the independence number and new lower bounds on the minimum degree of arbitrary $(3, 3)$-Ramsey graphs."},"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":"1604.03716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T10:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"7fc322d2a76bbdd92e510f9076530dcaa40491c991a2036b3f4b151517d8a9a7","abstract_canon_sha256":"1175214dd0d2ebc9321f51a46f8b89ee26d366aeb1e1f38a1c61e02c21c7ed63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:07.671171Z","signature_b64":"15Pmpp1Q8w74nuailLdGBYTzb2eNicmLvldhujRFBnQWcCIUa4v2QG96FbYhfxMe4Ux3swBt2sQUr3ky3rgpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db1ddf5cfdefb936e8ea82af6b969ac3e7e829652103041c7df50328af4fb75","last_reissued_at":"2026-05-17T23:50:07.670532Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:07.670532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small minimal $(3, 3)$-Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Bikov","submitted_at":"2016-04-13T10:40:39Z","abstract_excerpt":"We say that $G$ is a $(3, 3)$-Ramsey graph if every $2$-coloring of the edges of $G$ forces a monochromatic triangle. The $(3, 3)$-Ramsey graph $G$ is minimal if $G$ does not contain a proper $(3, 3)$-Ramsey subgraph. In this work we find all minimal $(3, 3)$-Ramsey graphs with up to 13 vertices with the help of a computer, and we obtain some new results for these graphs. We also obtain new upper bounds on the independence number and new lower bounds on the minimum degree of arbitrary $(3, 3)$-Ramsey graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03716","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":"1604.03716","created_at":"2026-05-17T23:50:07.670623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03716v1","created_at":"2026-05-17T23:50:07.670623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03716","created_at":"2026-05-17T23:50:07.670623+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWY535OP335Z","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWY535OP335ZG3UO","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWY535OP","created_at":"2026-05-18T12:30:29.479603+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/LWY535OP335ZG3UOVAVPNOLJVQ","json":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ.json","graph_json":"https://pith.science/api/pith-number/LWY535OP335ZG3UOVAVPNOLJVQ/graph.json","events_json":"https://pith.science/api/pith-number/LWY535OP335ZG3UOVAVPNOLJVQ/events.json","paper":"https://pith.science/paper/LWY535OP"},"agent_actions":{"view_html":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ","download_json":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ.json","view_paper":"https://pith.science/paper/LWY535OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03716&json=true","fetch_graph":"https://pith.science/api/pith-number/LWY535OP335ZG3UOVAVPNOLJVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LWY535OP335ZG3UOVAVPNOLJVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ/action/storage_attestation","attest_author":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ/action/author_attestation","sign_citation":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ/action/citation_signature","submit_replication":"https://pith.science/pith/LWY535OP335ZG3UOVAVPNOLJVQ/action/replication_record"}},"created_at":"2026-05-17T23:50:07.670623+00:00","updated_at":"2026-05-17T23:50:07.670623+00:00"}