{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KNMRTG2QIDHGUFRSXQ5JKVENYW","short_pith_number":"pith:KNMRTG2Q","schema_version":"1.0","canonical_sha256":"5359199b5040ce6a1632bc3a95548dc592ddb33eb76cbfabd89c9e9ca3deed9f","source":{"kind":"arxiv","id":"1708.09130","version":1},"attestation_state":"computed","paper":{"title":"Graph theory general position problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Manuel, Sandi Klav\\v{z}ar","submitted_at":"2017-08-30T05:51:46Z","abstract_excerpt":"The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \\times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset Selection Problem is to find a maximum subset $S'$ of $S$ such that no three points of $S'$ are collinear. Motivated by these problems, the following graph theory variation is introduced: Given a graph $G$, determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a gp-set of $G$ and its size is "},"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":"1708.09130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T05:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"4f95a8fe7851676591f772b438a4823dd344d4c957463c2fda05a2af47a27819","abstract_canon_sha256":"7f78deb4cb64ccc4d7e7b35c0fba3ef2c4640ce86f61ae5bfd816723b9d6cb3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.893166Z","signature_b64":"UG1euqpvXxcAZR+unuLPS3vhzEqMVJyiAHf16odMczZCwvKjePqcHU2jfTIc7nKXRX29xt8BZtt8HEknqse+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5359199b5040ce6a1632bc3a95548dc592ddb33eb76cbfabd89c9e9ca3deed9f","last_reissued_at":"2026-05-18T00:36:20.892596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.892596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph theory general position problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Manuel, Sandi Klav\\v{z}ar","submitted_at":"2017-08-30T05:51:46Z","abstract_excerpt":"The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \\times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset Selection Problem is to find a maximum subset $S'$ of $S$ such that no three points of $S'$ are collinear. Motivated by these problems, the following graph theory variation is introduced: Given a graph $G$, determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a gp-set of $G$ and its size is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09130","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":"1708.09130","created_at":"2026-05-18T00:36:20.892670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09130v1","created_at":"2026-05-18T00:36:20.892670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09130","created_at":"2026-05-18T00:36:20.892670+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNMRTG2QIDHG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNMRTG2QIDHGUFRS","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNMRTG2Q","created_at":"2026-05-18T12:31:24.725408+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/KNMRTG2QIDHGUFRSXQ5JKVENYW","json":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW.json","graph_json":"https://pith.science/api/pith-number/KNMRTG2QIDHGUFRSXQ5JKVENYW/graph.json","events_json":"https://pith.science/api/pith-number/KNMRTG2QIDHGUFRSXQ5JKVENYW/events.json","paper":"https://pith.science/paper/KNMRTG2Q"},"agent_actions":{"view_html":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW","download_json":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW.json","view_paper":"https://pith.science/paper/KNMRTG2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09130&json=true","fetch_graph":"https://pith.science/api/pith-number/KNMRTG2QIDHGUFRSXQ5JKVENYW/graph.json","fetch_events":"https://pith.science/api/pith-number/KNMRTG2QIDHGUFRSXQ5JKVENYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW/action/storage_attestation","attest_author":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW/action/author_attestation","sign_citation":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW/action/citation_signature","submit_replication":"https://pith.science/pith/KNMRTG2QIDHGUFRSXQ5JKVENYW/action/replication_record"}},"created_at":"2026-05-18T00:36:20.892670+00:00","updated_at":"2026-05-18T00:36:20.892670+00:00"}