{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:674F74XHS6P7PPE5R66WZYR3LF","short_pith_number":"pith:674F74XH","schema_version":"1.0","canonical_sha256":"f7f85ff2e7979ff7bc9d8fbd6ce23b59730d064b3e5754d52a6463a07054cc43","source":{"kind":"arxiv","id":"1106.1030","version":4},"attestation_state":"computed","paper":{"title":"On the minimal monochromatic K4-density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konrad Sperfeld","submitted_at":"2011-06-06T11:44:02Z","abstract_excerpt":"We use Razborov's flag algebra method to show a new asymptotic lower bound for the minimal density $m_4$ of monochromatic $K_4$'s in any 2-coloring of the edges of the complete graph $K_n$ on $n$ vertices. The hitherto best known lower bound was obtained by Giraud, who proved that m_4>1/46, whereas the best known upper bound by Thomason states that m_4<1/33. We can show that m_4>1/35."},"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":"1106.1030","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-06T11:44:02Z","cross_cats_sorted":[],"title_canon_sha256":"5ffd10afee505634a405175210ee19e25d03b8e5bb29d2206206c67c96841b07","abstract_canon_sha256":"440c085c89f1f04143845361b4b6b1195800541c198a1c5f24d64aa8b5eaad5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:05.123104Z","signature_b64":"Ns4fm/Y70W8y4geUVJKN0oSrsza2MJ+wlEKUIilsoDBNC0ogz5Cl6WL2sGzhj3hkxkCCrlqgmLxXpgbZK2S2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f85ff2e7979ff7bc9d8fbd6ce23b59730d064b3e5754d52a6463a07054cc43","last_reissued_at":"2026-05-18T04:08:05.122584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:05.122584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimal monochromatic K4-density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konrad Sperfeld","submitted_at":"2011-06-06T11:44:02Z","abstract_excerpt":"We use Razborov's flag algebra method to show a new asymptotic lower bound for the minimal density $m_4$ of monochromatic $K_4$'s in any 2-coloring of the edges of the complete graph $K_n$ on $n$ vertices. The hitherto best known lower bound was obtained by Giraud, who proved that m_4>1/46, whereas the best known upper bound by Thomason states that m_4<1/33. We can show that m_4>1/35."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1030","kind":"arxiv","version":4},"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":"1106.1030","created_at":"2026-05-18T04:08:05.122662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1030v4","created_at":"2026-05-18T04:08:05.122662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1030","created_at":"2026-05-18T04:08:05.122662+00:00"},{"alias_kind":"pith_short_12","alias_value":"674F74XHS6P7","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"674F74XHS6P7PPE5","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"674F74XH","created_at":"2026-05-18T12:26:22.705136+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/674F74XHS6P7PPE5R66WZYR3LF","json":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF.json","graph_json":"https://pith.science/api/pith-number/674F74XHS6P7PPE5R66WZYR3LF/graph.json","events_json":"https://pith.science/api/pith-number/674F74XHS6P7PPE5R66WZYR3LF/events.json","paper":"https://pith.science/paper/674F74XH"},"agent_actions":{"view_html":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF","download_json":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF.json","view_paper":"https://pith.science/paper/674F74XH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1030&json=true","fetch_graph":"https://pith.science/api/pith-number/674F74XHS6P7PPE5R66WZYR3LF/graph.json","fetch_events":"https://pith.science/api/pith-number/674F74XHS6P7PPE5R66WZYR3LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF/action/storage_attestation","attest_author":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF/action/author_attestation","sign_citation":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF/action/citation_signature","submit_replication":"https://pith.science/pith/674F74XHS6P7PPE5R66WZYR3LF/action/replication_record"}},"created_at":"2026-05-18T04:08:05.122662+00:00","updated_at":"2026-05-18T04:08:05.122662+00:00"}