{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KKBFDMDOM3GX3OWMD4CULTK36O","short_pith_number":"pith:KKBFDMDO","schema_version":"1.0","canonical_sha256":"528251b06e66cd7dbacc1f0545cd5bf3938b60f85141c510f5016c47380145be","source":{"kind":"arxiv","id":"1008.4707","version":1},"attestation_state":"computed","paper":{"title":"On the Fon-der-Flaass Interpretation of Extremal Examples for Turan's (3,4)-problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov","submitted_at":"2010-08-27T12:48:48Z","abstract_excerpt":"In 1941, Turan conjectured that the edge density of any 3-graph without independent sets on 4 vertices (Turan (3,4)-graph) is >= 4/9(1-o(1)), and he gave the first example witnessing this bound. Brown (1983) and Kostochka (1982) found many other examples of this density. Fon-der-Flaass (1988) presented a general construction that converts an arbitrary $\\vec C_4$-free orgraph $\\Gamma$ into a Turan (3,4)-graph. He observed that all Turan-Brown-Kostochka examples result from his construction, and proved the bound >= 3/7(1-o(1)) on the edge density of any Turan (3,4)-graph obtainable in this way.\n"},"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":"1008.4707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-27T12:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"568d74f9a7a8a9d2519289fd88961253120e57e7cb709cedc4e7f9482fa00100","abstract_canon_sha256":"0e8ec15641df8802d46cb07aca6f9be0a9b1d11788108d8eebd0af54b770dda3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:44.449087Z","signature_b64":"oTWageicmc2/bBIKmR1I0YsN6/wUrcX3qm//3wjBvflML4AExRMVt7zBZW1ZEL/pcXjzB4p3OV0LrQYMtttEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528251b06e66cd7dbacc1f0545cd5bf3938b60f85141c510f5016c47380145be","last_reissued_at":"2026-05-18T04:41:44.448695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:44.448695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Fon-der-Flaass Interpretation of Extremal Examples for Turan's (3,4)-problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov","submitted_at":"2010-08-27T12:48:48Z","abstract_excerpt":"In 1941, Turan conjectured that the edge density of any 3-graph without independent sets on 4 vertices (Turan (3,4)-graph) is >= 4/9(1-o(1)), and he gave the first example witnessing this bound. Brown (1983) and Kostochka (1982) found many other examples of this density. Fon-der-Flaass (1988) presented a general construction that converts an arbitrary $\\vec C_4$-free orgraph $\\Gamma$ into a Turan (3,4)-graph. He observed that all Turan-Brown-Kostochka examples result from his construction, and proved the bound >= 3/7(1-o(1)) on the edge density of any Turan (3,4)-graph obtainable in this way.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4707","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":"1008.4707","created_at":"2026-05-18T04:41:44.448759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4707v1","created_at":"2026-05-18T04:41:44.448759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4707","created_at":"2026-05-18T04:41:44.448759+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKBFDMDOM3GX","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKBFDMDOM3GX3OWM","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKBFDMDO","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06725","citing_title":"Blow-up trick in Combinatorics","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O","json":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O.json","graph_json":"https://pith.science/api/pith-number/KKBFDMDOM3GX3OWMD4CULTK36O/graph.json","events_json":"https://pith.science/api/pith-number/KKBFDMDOM3GX3OWMD4CULTK36O/events.json","paper":"https://pith.science/paper/KKBFDMDO"},"agent_actions":{"view_html":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O","download_json":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O.json","view_paper":"https://pith.science/paper/KKBFDMDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4707&json=true","fetch_graph":"https://pith.science/api/pith-number/KKBFDMDOM3GX3OWMD4CULTK36O/graph.json","fetch_events":"https://pith.science/api/pith-number/KKBFDMDOM3GX3OWMD4CULTK36O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O/action/storage_attestation","attest_author":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O/action/author_attestation","sign_citation":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O/action/citation_signature","submit_replication":"https://pith.science/pith/KKBFDMDOM3GX3OWMD4CULTK36O/action/replication_record"}},"created_at":"2026-05-18T04:41:44.448759+00:00","updated_at":"2026-05-18T04:41:44.448759+00:00"}