{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3ACC3RL2OKUHPTBFPT3MYIIUDJ","short_pith_number":"pith:3ACC3RL2","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"},"canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","source":{"kind":"arxiv","id":"1903.08056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08056","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08056v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08056","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"3ACC3RL2OKUH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3ACC3RL2OKUHPTBF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3ACC3RL2","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3ACC3RL2OKUHPTBFPT3MYIIUDJ","target":"record","payload":{"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"},"canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","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"},"source_kind":"arxiv","source_id":"1903.08056","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pHxEhd9cpQWGqKBnmWHcfencCVXdJ3t/BTTWLlgrIfX8msLWcCb1K0lL8ZJLN/OfYcYG7Xw0c4FHFXCSkETNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:51.407011Z"},"content_sha256":"2adf667c6a4e7c680d1aa7f304ce0fa810a45dbe1536e0a9e97c19de534480b1","schema_version":"1.0","event_id":"sha256:2adf667c6a4e7c680d1aa7f304ce0fa810a45dbe1536e0a9e97c19de534480b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3ACC3RL2OKUHPTBFPT3MYIIUDJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIymk0Bc1NAeAbEHNxEl8LL8n9Zd0FKbbgIMn35EMsqLj5NCrRUBV98q7AWsg6AxVX25AMJ2Vsji9nDV4Z1eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:51.407618Z"},"content_sha256":"f00e98a36e801dad9131b85b3d833e4c381a15702cf99766760e3d1224801709","schema_version":"1.0","event_id":"sha256:f00e98a36e801dad9131b85b3d833e4c381a15702cf99766760e3d1224801709"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/bundle.json","state_url":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T21:09:51Z","links":{"resolver":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ","bundle":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/bundle.json","state":"https://pith.science/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ACC3RL2OKUHPTBFPT3MYIIUDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3ACC3RL2OKUHPTBFPT3MYIIUDJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7cfc61e8750e0b3e062da15eeb10e6eb2a46b0881471fdb0f4f2e6522b8430a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T15:35:54Z","title_canon_sha256":"d68f826e35e1a1d20662e5fa8a20773a76f90bacd7344fcaa9fa17d01bdcd218"},"schema_version":"1.0","source":{"id":"1903.08056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08056","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08056v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08056","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"3ACC3RL2OKUH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3ACC3RL2OKUHPTBF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3ACC3RL2","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f00e98a36e801dad9131b85b3d833e4c381a15702cf99766760e3d1224801709","target":"graph","created_at":"2026-05-17T23:40:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bal\\'azs Patk\\'os","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T15:35:54Z","title":"On the general position problem on Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08056","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2adf667c6a4e7c680d1aa7f304ce0fa810a45dbe1536e0a9e97c19de534480b1","target":"record","created_at":"2026-05-17T23:40:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7cfc61e8750e0b3e062da15eeb10e6eb2a46b0881471fdb0f4f2e6522b8430a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T15:35:54Z","title_canon_sha256":"d68f826e35e1a1d20662e5fa8a20773a76f90bacd7344fcaa9fa17d01bdcd218"},"schema_version":"1.0","source":{"id":"1903.08056","kind":"arxiv","version":2}},"canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8042dc57a72a877cc257cf6cc21141a423a37a7af905e1895ebbc708331d0cd","first_computed_at":"2026-05-17T23:40:03.695432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:03.695432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C/8r2XDVX48cbsR5+1b6w9Gnj1/rsIqPuxNSKKh+4FbhAqI3iPC/6e2/4Ax7/EREh3dmwhqvQIkfxnToIfu5Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:03.696093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2adf667c6a4e7c680d1aa7f304ce0fa810a45dbe1536e0a9e97c19de534480b1","sha256:f00e98a36e801dad9131b85b3d833e4c381a15702cf99766760e3d1224801709"],"state_sha256":"4b9272eb38f4fa0d92619a85700fbdc967a8dea19aea845c71163b8ace075843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uh/YSgsmz1111uFcNV/FuUDHICVZRKl50z1Z1bEbrD2XNI2PYN4BOwP8q0ySXipTv79GbBruUYPl0E3RhKZKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:09:51.411305Z","bundle_sha256":"857cc2a5dccccc6382d9aacaa021535528f56f21f14e60d76e3569c8e78870cc"}}