{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VHMVONURSIXGEZZ442FZBR4YDA","short_pith_number":"pith:VHMVONUR","schema_version":"1.0","canonical_sha256":"a9d9573691922e62673ce68b90c798180b5cd3a04939d16fef34560d3aede5ad","source":{"kind":"arxiv","id":"1306.2020","version":3},"attestation_state":"computed","paper":{"title":"Graphs with few 3-cliques and 3-anticliques are 3-universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Avraham Morgenstern, Nati Linial","submitted_at":"2013-06-09T13:50:59Z","abstract_excerpt":"For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar phenomenon is established as well for tournaments with k=l=4."},"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":"1306.2020","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T13:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"20bc343f6b9f03e42ea5eeed03f961058a4168bc13049433cc00000365a9a84d","abstract_canon_sha256":"9778cbaf35620be4850242c83b1748b9878f5d95c152b1488ce69c22902b3a36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:46.049304Z","signature_b64":"pCLExUYZYJ5Shi87hgsPMKp7vr/rWkrTIVfq0jc1GbeQfJQ5n2iM6A8dayTXlA8KQcT0JEEwumDZRgg9+UUFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d9573691922e62673ce68b90c798180b5cd3a04939d16fef34560d3aede5ad","last_reissued_at":"2026-05-18T02:58:46.048486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:46.048486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with few 3-cliques and 3-anticliques are 3-universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Avraham Morgenstern, Nati Linial","submitted_at":"2013-06-09T13:50:59Z","abstract_excerpt":"For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar phenomenon is established as well for tournaments with k=l=4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2020","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":"1306.2020","created_at":"2026-05-18T02:58:46.048632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2020v3","created_at":"2026-05-18T02:58:46.048632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2020","created_at":"2026-05-18T02:58:46.048632+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHMVONURSIXG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHMVONURSIXGEZZ4","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHMVONUR","created_at":"2026-05-18T12:28:04.890932+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/VHMVONURSIXGEZZ442FZBR4YDA","json":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA.json","graph_json":"https://pith.science/api/pith-number/VHMVONURSIXGEZZ442FZBR4YDA/graph.json","events_json":"https://pith.science/api/pith-number/VHMVONURSIXGEZZ442FZBR4YDA/events.json","paper":"https://pith.science/paper/VHMVONUR"},"agent_actions":{"view_html":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA","download_json":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA.json","view_paper":"https://pith.science/paper/VHMVONUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2020&json=true","fetch_graph":"https://pith.science/api/pith-number/VHMVONURSIXGEZZ442FZBR4YDA/graph.json","fetch_events":"https://pith.science/api/pith-number/VHMVONURSIXGEZZ442FZBR4YDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA/action/storage_attestation","attest_author":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA/action/author_attestation","sign_citation":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA/action/citation_signature","submit_replication":"https://pith.science/pith/VHMVONURSIXGEZZ442FZBR4YDA/action/replication_record"}},"created_at":"2026-05-18T02:58:46.048632+00:00","updated_at":"2026-05-18T02:58:46.048632+00:00"}