{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:T2ZCC5XYPUIH52EG46CFH3EUCA","short_pith_number":"pith:T2ZCC5XY","schema_version":"1.0","canonical_sha256":"9eb22176f87d107ee886e78453ec94101f716db339103816ea3f6b709b2e79d2","source":{"kind":"arxiv","id":"1409.8123","version":1},"attestation_state":"computed","paper":{"title":"The number of the maximal triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, \\v{S}\\'arka Pet\\v{r}\\'i\\v{c}kov\\'a","submitted_at":"2014-09-29T13:48:52Z","abstract_excerpt":"Paul Erd\\H{o}s suggested the following problem: Determine or estimate the number of maximal triangle-free graphs on $n$ vertices. Here we show that the number of maximal triangle-free graphs is at most $2^{n^2/8+o(n^2)}$, which matches the previously known lower bound. Our proof uses among others the Ruzsa-Szemer\\'{e}di triangle removal lemma, and recent results on characterizing of the structure of independent sets in hypergraphs."},"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":"1409.8123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T13:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"2b59467452496ed91e55309532f71bb8b0e135acecec74c0adeeace7e769e162","abstract_canon_sha256":"2607053e5ee4a18a9cd8085f95e829c97a2f10e9177bbe8dc39e15223cd95f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:33.666885Z","signature_b64":"ApotzaBEpMp9TF14+N3wLaqlVQ4zzg9QBSUVUU9Cwc0f2n5b9bBgS2l1a1lUYgRqpAgewo3+Nbj3dig3KsdsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb22176f87d107ee886e78453ec94101f716db339103816ea3f6b709b2e79d2","last_reissued_at":"2026-05-18T02:41:33.666544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:33.666544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of the maximal triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, \\v{S}\\'arka Pet\\v{r}\\'i\\v{c}kov\\'a","submitted_at":"2014-09-29T13:48:52Z","abstract_excerpt":"Paul Erd\\H{o}s suggested the following problem: Determine or estimate the number of maximal triangle-free graphs on $n$ vertices. Here we show that the number of maximal triangle-free graphs is at most $2^{n^2/8+o(n^2)}$, which matches the previously known lower bound. Our proof uses among others the Ruzsa-Szemer\\'{e}di triangle removal lemma, and recent results on characterizing of the structure of independent sets in hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8123","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":"1409.8123","created_at":"2026-05-18T02:41:33.666600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8123v1","created_at":"2026-05-18T02:41:33.666600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8123","created_at":"2026-05-18T02:41:33.666600+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2ZCC5XYPUIH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2ZCC5XYPUIH52EG","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2ZCC5XY","created_at":"2026-05-18T12:28:49.207871+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/T2ZCC5XYPUIH52EG46CFH3EUCA","json":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA.json","graph_json":"https://pith.science/api/pith-number/T2ZCC5XYPUIH52EG46CFH3EUCA/graph.json","events_json":"https://pith.science/api/pith-number/T2ZCC5XYPUIH52EG46CFH3EUCA/events.json","paper":"https://pith.science/paper/T2ZCC5XY"},"agent_actions":{"view_html":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA","download_json":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA.json","view_paper":"https://pith.science/paper/T2ZCC5XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8123&json=true","fetch_graph":"https://pith.science/api/pith-number/T2ZCC5XYPUIH52EG46CFH3EUCA/graph.json","fetch_events":"https://pith.science/api/pith-number/T2ZCC5XYPUIH52EG46CFH3EUCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA/action/storage_attestation","attest_author":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA/action/author_attestation","sign_citation":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA/action/citation_signature","submit_replication":"https://pith.science/pith/T2ZCC5XYPUIH52EG46CFH3EUCA/action/replication_record"}},"created_at":"2026-05-18T02:41:33.666600+00:00","updated_at":"2026-05-18T02:41:33.666600+00:00"}