{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TWP4PU6LP6B7H7GZOIMCQQJD62","short_pith_number":"pith:TWP4PU6L","schema_version":"1.0","canonical_sha256":"9d9fc7d3cb7f83f3fcd97218284123f6925c8ba8cafa555838d7732254c33df5","source":{"kind":"arxiv","id":"1908.05190","version":1},"attestation_state":"computed","paper":{"title":"Exploring Projective Norm Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lajos R\\'onyai, Tam\\'as M\\'esz\\'aros, Tibor Szab\\'o, Tomas Bayer","submitted_at":"2019-08-14T16:06:53Z","abstract_excerpt":"The projective norm graphs $\\text{NG}(q,t)$ provide tight constructions for the Tur\\'an number of complete bipartite graphs $K_{t,s}$ with $s>(t-1)!$. In this paper we determine their automorphism group and explore their small subgraphs. To this end we give quite precise estimates on the number of solutions of certain equation systems involving norms over finite fields. The determination of the largest integer $s_t$, such that the projective norm graph $\\text{NG}(q,t)$ contains $K_{t,s_t}$ for all large enough prime powers $q$ is an important open question with far-reaching general consequence"},"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":"1908.05190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6d5f29e4ce16b63409c591bb684113a7aaf2c5c9ae2f10e86cada9f69482a70","abstract_canon_sha256":"3a06556d522511aa323d1e7579c54da07bf2ceb114eccdca83507cdc3b4b4e59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:37.250062Z","signature_b64":"ltjvLz+FaXI1WdlBuO4W1r77lu0rP0RzOF1TFulsPCkKx01XRhsfNkhzn+HzSJ0YEbuZhDSd3d/YaGwGjkT7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9fc7d3cb7f83f3fcd97218284123f6925c8ba8cafa555838d7732254c33df5","last_reissued_at":"2026-07-04T23:56:37.249597Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:37.249597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Projective Norm Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lajos R\\'onyai, Tam\\'as M\\'esz\\'aros, Tibor Szab\\'o, Tomas Bayer","submitted_at":"2019-08-14T16:06:53Z","abstract_excerpt":"The projective norm graphs $\\text{NG}(q,t)$ provide tight constructions for the Tur\\'an number of complete bipartite graphs $K_{t,s}$ with $s>(t-1)!$. In this paper we determine their automorphism group and explore their small subgraphs. To this end we give quite precise estimates on the number of solutions of certain equation systems involving norms over finite fields. The determination of the largest integer $s_t$, such that the projective norm graph $\\text{NG}(q,t)$ contains $K_{t,s_t}$ for all large enough prime powers $q$ is an important open question with far-reaching general consequence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05190","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05190/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":"1908.05190","created_at":"2026-07-04T23:56:37.249653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05190v1","created_at":"2026-07-04T23:56:37.249653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05190","created_at":"2026-07-04T23:56:37.249653+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWP4PU6LP6B7","created_at":"2026-07-04T23:56:37.249653+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWP4PU6LP6B7H7GZ","created_at":"2026-07-04T23:56:37.249653+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWP4PU6L","created_at":"2026-07-04T23:56:37.249653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01680","citing_title":"On the generalized Tur\\'{a}n number of the complete bipartite graph $K_{3,b+1}$","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09801","citing_title":"On the generalized Tur\\'an number of complete bipartite graphs","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62","json":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62.json","graph_json":"https://pith.science/api/pith-number/TWP4PU6LP6B7H7GZOIMCQQJD62/graph.json","events_json":"https://pith.science/api/pith-number/TWP4PU6LP6B7H7GZOIMCQQJD62/events.json","paper":"https://pith.science/paper/TWP4PU6L"},"agent_actions":{"view_html":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62","download_json":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62.json","view_paper":"https://pith.science/paper/TWP4PU6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05190&json=true","fetch_graph":"https://pith.science/api/pith-number/TWP4PU6LP6B7H7GZOIMCQQJD62/graph.json","fetch_events":"https://pith.science/api/pith-number/TWP4PU6LP6B7H7GZOIMCQQJD62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62/action/storage_attestation","attest_author":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62/action/author_attestation","sign_citation":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62/action/citation_signature","submit_replication":"https://pith.science/pith/TWP4PU6LP6B7H7GZOIMCQQJD62/action/replication_record"}},"created_at":"2026-07-04T23:56:37.249653+00:00","updated_at":"2026-07-04T23:56:37.249653+00:00"}