{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZS45KT3DSDDTRGM3NP5JSXTKAI","short_pith_number":"pith:ZS45KT3D","schema_version":"1.0","canonical_sha256":"ccb9d54f6390c738999b6bfa995e6a0224f1091b943019551f9f898a8d973793","source":{"kind":"arxiv","id":"1702.01357","version":1},"attestation_state":"computed","paper":{"title":"Planar polynomials and an extremal problem of Fischer and Matousek","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Rex W. Matthews, Robert S. Coulter","submitted_at":"2017-02-05T01:47:16Z","abstract_excerpt":"Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction involving arbitrary projective planes shows that there is such a graph with $(1 - o(1)) k^{3/2} $ triangles, and a double counting argument shows that one cannot have more than $(1+o(1)) k^{7/4} $ triangles. Using affine planes defined by specific planar polynomials over finite fields, we improve the lower bound to $(1 - o(1)) k^{5/3}$."},"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":"1702.01357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-05T01:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"19bd849d987233734f6e0ae14e7300b2a1a3df05ab98543598cebfb02ad5bb09","abstract_canon_sha256":"a9f93b872e096722b04a59d572952eaa8e615b7e5b5fbb34225c14e01010db30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.662058Z","signature_b64":"+k1lbo9dyes9ToVaAM8izprmDBR3qbBIHUYn9zdWYbmpAesgYIwNLakIe08ilS/TnNXBoLnlA98787FlgQjtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccb9d54f6390c738999b6bfa995e6a0224f1091b943019551f9f898a8d973793","last_reissued_at":"2026-05-18T00:51:23.661513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.661513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar polynomials and an extremal problem of Fischer and Matousek","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Rex W. Matthews, Robert S. Coulter","submitted_at":"2017-02-05T01:47:16Z","abstract_excerpt":"Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction involving arbitrary projective planes shows that there is such a graph with $(1 - o(1)) k^{3/2} $ triangles, and a double counting argument shows that one cannot have more than $(1+o(1)) k^{7/4} $ triangles. Using affine planes defined by specific planar polynomials over finite fields, we improve the lower bound to $(1 - o(1)) k^{5/3}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01357","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":"1702.01357","created_at":"2026-05-18T00:51:23.661591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01357v1","created_at":"2026-05-18T00:51:23.661591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01357","created_at":"2026-05-18T00:51:23.661591+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS45KT3DSDDT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS45KT3DSDDTRGM3","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS45KT3D","created_at":"2026-05-18T12:31:59.375834+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/ZS45KT3DSDDTRGM3NP5JSXTKAI","json":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI.json","graph_json":"https://pith.science/api/pith-number/ZS45KT3DSDDTRGM3NP5JSXTKAI/graph.json","events_json":"https://pith.science/api/pith-number/ZS45KT3DSDDTRGM3NP5JSXTKAI/events.json","paper":"https://pith.science/paper/ZS45KT3D"},"agent_actions":{"view_html":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI","download_json":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI.json","view_paper":"https://pith.science/paper/ZS45KT3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01357&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS45KT3DSDDTRGM3NP5JSXTKAI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS45KT3DSDDTRGM3NP5JSXTKAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI/action/storage_attestation","attest_author":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI/action/author_attestation","sign_citation":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI/action/citation_signature","submit_replication":"https://pith.science/pith/ZS45KT3DSDDTRGM3NP5JSXTKAI/action/replication_record"}},"created_at":"2026-05-18T00:51:23.661591+00:00","updated_at":"2026-05-18T00:51:23.661591+00:00"}