{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LT72HOJPFD3KYLD52VKJ247CY7","short_pith_number":"pith:LT72HOJP","schema_version":"1.0","canonical_sha256":"5cffa3b92f28f6ac2c7dd5549d73e2c7e90e1758934b4cf259b91a102dffef82","source":{"kind":"arxiv","id":"1601.05058","version":1},"attestation_state":"computed","paper":{"title":"Independent sets in polarity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Michael Tait","submitted_at":"2016-01-19T20:01:04Z","abstract_excerpt":"Given a projective plane $\\Sigma$ and a polarity $\\theta$ of $\\Sigma$, the corresponding polarity graph is the graph whose vertices are the points of $\\Sigma$, and two distinct points $p_1$ and $p_2$ are adjacent if $p_1$ is incident to $p_2^{ \\theta}$ in $\\Sigma$. A well-known example of a polarity graph is the Erd\\H{o}s-R\\'{e}nyi orthogonal polarity graph $ER_q$, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an upper bound on the independence number of any polarity graph. Mubayi and Williford showed that in the case of $ER_q$, the eigenvalue method gi"},"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":"1601.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-19T20:01:04Z","cross_cats_sorted":[],"title_canon_sha256":"8b069795b460589abc07470c6ab8eb87061c31a8c69da3e25d901132ba920b9f","abstract_canon_sha256":"ba20d060e9f333c2a0d2faead7ad3272f7d7417d2f0bdf89eec62c6175f81f45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.321792Z","signature_b64":"bKIebYkG3JEJyer1sLGSLsN/kC6IcKkstx2EYwrvxKEroernxb6YcBzVYGDt8xqnPW5XslVYh6Fm+L2wGcdyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cffa3b92f28f6ac2c7dd5549d73e2c7e90e1758934b4cf259b91a102dffef82","last_reissued_at":"2026-05-18T01:22:31.321207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.321207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent sets in polarity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Michael Tait","submitted_at":"2016-01-19T20:01:04Z","abstract_excerpt":"Given a projective plane $\\Sigma$ and a polarity $\\theta$ of $\\Sigma$, the corresponding polarity graph is the graph whose vertices are the points of $\\Sigma$, and two distinct points $p_1$ and $p_2$ are adjacent if $p_1$ is incident to $p_2^{ \\theta}$ in $\\Sigma$. A well-known example of a polarity graph is the Erd\\H{o}s-R\\'{e}nyi orthogonal polarity graph $ER_q$, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an upper bound on the independence number of any polarity graph. Mubayi and Williford showed that in the case of $ER_q$, the eigenvalue method gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05058","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":"1601.05058","created_at":"2026-05-18T01:22:31.321298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05058v1","created_at":"2026-05-18T01:22:31.321298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05058","created_at":"2026-05-18T01:22:31.321298+00:00"},{"alias_kind":"pith_short_12","alias_value":"LT72HOJPFD3K","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LT72HOJPFD3KYLD5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LT72HOJP","created_at":"2026-05-18T12:30:29.479603+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/LT72HOJPFD3KYLD52VKJ247CY7","json":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7.json","graph_json":"https://pith.science/api/pith-number/LT72HOJPFD3KYLD52VKJ247CY7/graph.json","events_json":"https://pith.science/api/pith-number/LT72HOJPFD3KYLD52VKJ247CY7/events.json","paper":"https://pith.science/paper/LT72HOJP"},"agent_actions":{"view_html":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7","download_json":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7.json","view_paper":"https://pith.science/paper/LT72HOJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/LT72HOJPFD3KYLD52VKJ247CY7/graph.json","fetch_events":"https://pith.science/api/pith-number/LT72HOJPFD3KYLD52VKJ247CY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7/action/storage_attestation","attest_author":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7/action/author_attestation","sign_citation":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7/action/citation_signature","submit_replication":"https://pith.science/pith/LT72HOJPFD3KYLD52VKJ247CY7/action/replication_record"}},"created_at":"2026-05-18T01:22:31.321298+00:00","updated_at":"2026-05-18T01:22:31.321298+00:00"}