{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3ACC3RL2OKUHPTBFPT3MYIIUDJ","short_pith_number":"pith:3ACC3RL2","schema_version":"1.0","canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","source":{"kind":"arxiv","id":"1903.08056","version":2},"attestation_state":"computed","paper":{"title":"On the general position problem on Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os","submitted_at":"2019-03-19T15:35:54Z","abstract_excerpt":"In a graph $G$, a geodesic between two vertices $x$ and $y$ is a shortest path connecting $x$ to $y$. A subset $S$ of the vertices of $G$ is in general position if no vertex of $S$ lies on any geodesic between two other vertices of $S$. The size of a largest set of vertices in general position is the general position number that we denote by $gp(G)$. Recently, Ghorbani et al, proved that for any $k$ if $n\\ge k^3-k^2+2k-2$, then $gp(Kn_{n,k})=\\binom{n-1}{k-1}$, where $Kn_{n,k}$ denotes the Kneser graph. We improve on their result and show that the same conclusion holds for $n\\ge 2.5k-0.5$ and t"},"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":"1903.08056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T15:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"d68f826e35e1a1d20662e5fa8a20773a76f90bacd7344fcaa9fa17d01bdcd218","abstract_canon_sha256":"7cfc61e8750e0b3e062da15eeb10e6eb2a46b0881471fdb0f4f2e6522b8430a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:03.696093Z","signature_b64":"C/8r2XDVX48cbsR5+1b6w9Gnj1/rsIqPuxNSKKh+4FbhAqI3iPC/6e2/4Ax7/EREh3dmwhqvQIkfxnToIfu5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","last_reissued_at":"2026-05-17T23:40:03.695432Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:03.695432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the general position problem on Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os","submitted_at":"2019-03-19T15:35:54Z","abstract_excerpt":"In a graph $G$, a geodesic between two vertices $x$ and $y$ is a shortest path connecting $x$ to $y$. A subset $S$ of the vertices of $G$ is in general position if no vertex of $S$ lies on any geodesic between two other vertices of $S$. The size of a largest set of vertices in general position is the general position number that we denote by $gp(G)$. Recently, Ghorbani et al, proved that for any $k$ if $n\\ge k^3-k^2+2k-2$, then $gp(Kn_{n,k})=\\binom{n-1}{k-1}$, where $Kn_{n,k}$ denotes the Kneser graph. We improve on their result and show that the same conclusion holds for $n\\ge 2.5k-0.5$ and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08056","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":"1903.08056","created_at":"2026-05-17T23:40:03.695536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08056v2","created_at":"2026-05-17T23:40:03.695536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08056","created_at":"2026-05-17T23:40:03.695536+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ACC3RL2OKUH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ACC3RL2OKUHPTBF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ACC3RL2","created_at":"2026-05-18T12:33:07.085635+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/3ACC3RL2OKUHPTBFPT3MYIIUDJ","json":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ.json","graph_json":"https://pith.science/api/pith-number/3ACC3RL2OKUHPTBFPT3MYIIUDJ/graph.json","events_json":"https://pith.science/api/pith-number/3ACC3RL2OKUHPTBFPT3MYIIUDJ/events.json","paper":"https://pith.science/paper/3ACC3RL2"},"agent_actions":{"view_html":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ","download_json":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ.json","view_paper":"https://pith.science/paper/3ACC3RL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08056&json=true","fetch_graph":"https://pith.science/api/pith-number/3ACC3RL2OKUHPTBFPT3MYIIUDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3ACC3RL2OKUHPTBFPT3MYIIUDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/action/storage_attestation","attest_author":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/action/author_attestation","sign_citation":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/action/citation_signature","submit_replication":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/action/replication_record"}},"created_at":"2026-05-17T23:40:03.695536+00:00","updated_at":"2026-05-17T23:40:03.695536+00:00"}