{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XFXOBEAMAT6DBIIUOUUWMTHPSC","short_pith_number":"pith:XFXOBEAM","schema_version":"1.0","canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","source":{"kind":"arxiv","id":"1710.00244","version":1},"attestation_state":"computed","paper":{"title":"The graph theory general position problem on some interconnection networks","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-09-30T18:42:56Z","abstract_excerpt":"Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short) of $G$ and denoted by ${\\rm gp}(G)$. In this paper, the gp-number is determined for a large class of subgraphs of the infinite grid graph and for the infinite diagonal grid. To derive these results, we introduce monotone-geodesic labeling and prove a Monotone Geodesic Lemma that is in turn developed using the Erd\\\"os-Szekeres theorem on monotone sequences. 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":"1710.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-30T18:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"9ae9f8625e731e812456249cf3df0cc51960b59342bdf543519de2732c303be5","abstract_canon_sha256":"8bdb20c9bc0f96e3c3e3ad0a3f4d7da012742952f90ef3e6f16da7593c114d55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:55.425735Z","signature_b64":"kWCTKf8KeNXshL+pkbSq1O0MOZLM0dtMCplIF3uxUInqAoFJOyw+bBidwh+qflJVO+jBtgRqPJ5o5Qf7WOt/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","last_reissued_at":"2026-05-18T00:33:55.425078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:55.425078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The graph theory general position problem on some interconnection networks","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-09-30T18:42:56Z","abstract_excerpt":"Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short) of $G$ and denoted by ${\\rm gp}(G)$. In this paper, the gp-number is determined for a large class of subgraphs of the infinite grid graph and for the infinite diagonal grid. To derive these results, we introduce monotone-geodesic labeling and prove a Monotone Geodesic Lemma that is in turn developed using the Erd\\\"os-Szekeres theorem on monotone sequences. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00244","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":"1710.00244","created_at":"2026-05-18T00:33:55.425185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00244v1","created_at":"2026-05-18T00:33:55.425185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00244","created_at":"2026-05-18T00:33:55.425185+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFXOBEAMAT6D","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFXOBEAMAT6DBIIU","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFXOBEAM","created_at":"2026-05-18T12:31:53.515858+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/XFXOBEAMAT6DBIIUOUUWMTHPSC","json":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC.json","graph_json":"https://pith.science/api/pith-number/XFXOBEAMAT6DBIIUOUUWMTHPSC/graph.json","events_json":"https://pith.science/api/pith-number/XFXOBEAMAT6DBIIUOUUWMTHPSC/events.json","paper":"https://pith.science/paper/XFXOBEAM"},"agent_actions":{"view_html":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC","download_json":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC.json","view_paper":"https://pith.science/paper/XFXOBEAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00244&json=true","fetch_graph":"https://pith.science/api/pith-number/XFXOBEAMAT6DBIIUOUUWMTHPSC/graph.json","fetch_events":"https://pith.science/api/pith-number/XFXOBEAMAT6DBIIUOUUWMTHPSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/action/storage_attestation","attest_author":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/action/author_attestation","sign_citation":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/action/citation_signature","submit_replication":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/action/replication_record"}},"created_at":"2026-05-18T00:33:55.425185+00:00","updated_at":"2026-05-18T00:33:55.425185+00:00"}