{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QRFN2E76JQCTOUFNKKD65ZAISE","short_pith_number":"pith:QRFN2E76","schema_version":"1.0","canonical_sha256":"844add13fe4c053750ad5287eee4089104dc2bc1bf938e996b8a2063bcfab5e8","source":{"kind":"arxiv","id":"1905.04677","version":3},"attestation_state":"computed","paper":{"title":"A construction for clique-free pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe","submitted_at":"2019-05-12T09:23:53Z","abstract_excerpt":"A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\\Theta(n^{-1/(k -2)})$. In this short note we improve their result by constructing an infinite family of highly pseudorandom $K_k$-free graphs with a higher edge density of $\\Theta(n^{-1/(k - 1)})$."},"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":"1905.04677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-12T09:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"cbabbcda58d46b34ba4cd38e98482ea96d4ce6e0d06ae1492990f71bf4e541a2","abstract_canon_sha256":"e626dd59bec3a5d1c29e23a1f43fed517cfcb7e71af81fbc1cb02fe8a323759d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:30.030361Z","signature_b64":"YDXtOxPEH/Wcvvcai80G0U5fKKSe9M9NwYctD/uulpAv5/uMZSwaws3eoBC7oQjxlMgUs1eBb4NRNdXkMGw5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"844add13fe4c053750ad5287eee4089104dc2bc1bf938e996b8a2063bcfab5e8","last_reissued_at":"2026-07-05T00:32:30.029876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:30.029876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A construction for clique-free pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe","submitted_at":"2019-05-12T09:23:53Z","abstract_excerpt":"A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\\Theta(n^{-1/(k -2)})$. In this short note we improve their result by constructing an infinite family of highly pseudorandom $K_k$-free graphs with a higher edge density of $\\Theta(n^{-1/(k - 1)})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04677","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.04677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.04677","created_at":"2026-07-05T00:32:30.029935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04677v3","created_at":"2026-07-05T00:32:30.029935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04677","created_at":"2026-07-05T00:32:30.029935+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRFN2E76JQCT","created_at":"2026-07-05T00:32:30.029935+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRFN2E76JQCTOUFN","created_at":"2026-07-05T00:32:30.029935+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRFN2E76","created_at":"2026-07-05T00:32:30.029935+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/QRFN2E76JQCTOUFNKKD65ZAISE","json":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE.json","graph_json":"https://pith.science/api/pith-number/QRFN2E76JQCTOUFNKKD65ZAISE/graph.json","events_json":"https://pith.science/api/pith-number/QRFN2E76JQCTOUFNKKD65ZAISE/events.json","paper":"https://pith.science/paper/QRFN2E76"},"agent_actions":{"view_html":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE","download_json":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE.json","view_paper":"https://pith.science/paper/QRFN2E76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04677&json=true","fetch_graph":"https://pith.science/api/pith-number/QRFN2E76JQCTOUFNKKD65ZAISE/graph.json","fetch_events":"https://pith.science/api/pith-number/QRFN2E76JQCTOUFNKKD65ZAISE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE/action/storage_attestation","attest_author":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE/action/author_attestation","sign_citation":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE/action/citation_signature","submit_replication":"https://pith.science/pith/QRFN2E76JQCTOUFNKKD65ZAISE/action/replication_record"}},"created_at":"2026-07-05T00:32:30.029935+00:00","updated_at":"2026-07-05T00:32:30.029935+00:00"}