{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SNLONEJKGOCOR2S3EDHCOJKVVW","short_pith_number":"pith:SNLONEJK","schema_version":"1.0","canonical_sha256":"9356e6912a3384e8ea5b20ce272555adb29c675c5893dd34b584b47ed8dc2743","source":{"kind":"arxiv","id":"1703.06347","version":2},"attestation_state":"computed","paper":{"title":"Triangle-free induced subgraphs of polarity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Jared Loucks","submitted_at":"2017-03-18T20:28:27Z","abstract_excerpt":"Given a finite projective plane $\\Pi$ and a polarity $\\theta$ of $\\Pi$, the corresponding polarity graph is the graph whose vertices are the points of $\\Pi$. Two distinct vertices $p$ and $p'$ are adjacent if $p$ is incident to $\\theta (p')$. Polarity graphs have been used in a variety of extremal problems, perhaps the most well-known being the Tur\\'{a}n number of the cycle of length four. We investigate the problem of finding the maximum number of vertices in an induced triangle-free subgraph of a polarity graph. Mubayi and Williford showed that when $\\Pi$ is the projective geometry $PG(2,q)$"},"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":"1703.06347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-18T20:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"1221e6493549a48222b16fbbcef4fb146844178c1eb5da7976d17b0848a91be1","abstract_canon_sha256":"7a5a974ad5d70dc83255c2af6476b4f42f860d3c1a09cb07c962ccbc5ce3a703"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.077632Z","signature_b64":"MxbquNNSUfRSXPeBhv1/6BYkoitdG6tmfSFNcmtsV19xMzqHHuiNnFWKx5pPDFE/miuHHUBJLuGHC0EFnT8bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9356e6912a3384e8ea5b20ce272555adb29c675c5893dd34b584b47ed8dc2743","last_reissued_at":"2026-05-18T00:46:55.077072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.077072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free induced subgraphs of polarity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Jared Loucks","submitted_at":"2017-03-18T20:28:27Z","abstract_excerpt":"Given a finite projective plane $\\Pi$ and a polarity $\\theta$ of $\\Pi$, the corresponding polarity graph is the graph whose vertices are the points of $\\Pi$. Two distinct vertices $p$ and $p'$ are adjacent if $p$ is incident to $\\theta (p')$. Polarity graphs have been used in a variety of extremal problems, perhaps the most well-known being the Tur\\'{a}n number of the cycle of length four. We investigate the problem of finding the maximum number of vertices in an induced triangle-free subgraph of a polarity graph. Mubayi and Williford showed that when $\\Pi$ is the projective geometry $PG(2,q)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06347","kind":"arxiv","version":2},"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":"1703.06347","created_at":"2026-05-18T00:46:55.077152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06347v2","created_at":"2026-05-18T00:46:55.077152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06347","created_at":"2026-05-18T00:46:55.077152+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNLONEJKGOCO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNLONEJKGOCOR2S3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNLONEJK","created_at":"2026-05-18T12:31:43.269735+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/SNLONEJKGOCOR2S3EDHCOJKVVW","json":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW.json","graph_json":"https://pith.science/api/pith-number/SNLONEJKGOCOR2S3EDHCOJKVVW/graph.json","events_json":"https://pith.science/api/pith-number/SNLONEJKGOCOR2S3EDHCOJKVVW/events.json","paper":"https://pith.science/paper/SNLONEJK"},"agent_actions":{"view_html":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW","download_json":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW.json","view_paper":"https://pith.science/paper/SNLONEJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06347&json=true","fetch_graph":"https://pith.science/api/pith-number/SNLONEJKGOCOR2S3EDHCOJKVVW/graph.json","fetch_events":"https://pith.science/api/pith-number/SNLONEJKGOCOR2S3EDHCOJKVVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW/action/storage_attestation","attest_author":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW/action/author_attestation","sign_citation":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW/action/citation_signature","submit_replication":"https://pith.science/pith/SNLONEJKGOCOR2S3EDHCOJKVVW/action/replication_record"}},"created_at":"2026-05-18T00:46:55.077152+00:00","updated_at":"2026-05-18T00:46:55.077152+00:00"}