{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XFXOBEAMAT6DBIIUOUUWMTHPSC","short_pith_number":"pith:XFXOBEAM","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"},"canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","source":{"kind":"arxiv","id":"1710.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00244","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00244v1","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00244","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"pith_short_12","alias_value":"XFXOBEAMAT6D","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XFXOBEAMAT6DBIIU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XFXOBEAM","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XFXOBEAMAT6DBIIUOUUWMTHPSC","target":"record","payload":{"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"},"canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","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"},"source_kind":"arxiv","source_id":"1710.00244","source_version":1,"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-18T00:33:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQnvhqFo1sSQ0ApSUzXus6ajR9+FH/rwcoT5ZYq/thnAWyzi7DdfX8/H1EGpiwu9t4XjXkmm6IsrgzFpDD3IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:38:28.510993Z"},"content_sha256":"4753d00dca5f971a2c972734bcf19a03708550aa11872e9e7a486dac4e848ae7","schema_version":"1.0","event_id":"sha256:4753d00dca5f971a2c972734bcf19a03708550aa11872e9e7a486dac4e848ae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XFXOBEAMAT6DBIIUOUUWMTHPSC","target":"graph","payload":{"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"},"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-18T00:33:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQE3TNVvDPbNcmLFZ0nDoJSUtggd/w2f59zzGSgtxyeRJFBHFbLIPUTbuzu4xokI/mIPPZEWfvcKKHwWTXYmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:38:28.511352Z"},"content_sha256":"9a0512fb49b9480f77c2b581d8a5177277f9ec426807a0d5c23dea45c4e42def","schema_version":"1.0","event_id":"sha256:9a0512fb49b9480f77c2b581d8a5177277f9ec426807a0d5c23dea45c4e42def"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/bundle.json","state_url":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/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-24T01:38:28Z","links":{"resolver":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC","bundle":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/bundle.json","state":"https://pith.science/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFXOBEAMAT6DBIIUOUUWMTHPSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XFXOBEAMAT6DBIIUOUUWMTHPSC","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":"8bdb20c9bc0f96e3c3e3ad0a3f4d7da012742952f90ef3e6f16da7593c114d55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-30T18:42:56Z","title_canon_sha256":"9ae9f8625e731e812456249cf3df0cc51960b59342bdf543519de2732c303be5"},"schema_version":"1.0","source":{"id":"1710.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00244","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00244v1","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00244","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"pith_short_12","alias_value":"XFXOBEAMAT6D","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XFXOBEAMAT6DBIIU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XFXOBEAM","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:9a0512fb49b9480f77c2b581d8a5177277f9ec426807a0d5c23dea45c4e42def","target":"graph","created_at":"2026-05-18T00:33:55Z","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":"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","authors_text":"Paul Manuel, Sandi Klav\\v{z}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-30T18:42:56Z","title":"The graph theory general position problem on some interconnection networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00244","kind":"arxiv","version":1},"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:4753d00dca5f971a2c972734bcf19a03708550aa11872e9e7a486dac4e848ae7","target":"record","created_at":"2026-05-18T00:33:55Z","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":"8bdb20c9bc0f96e3c3e3ad0a3f4d7da012742952f90ef3e6f16da7593c114d55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-30T18:42:56Z","title_canon_sha256":"9ae9f8625e731e812456249cf3df0cc51960b59342bdf543519de2732c303be5"},"schema_version":"1.0","source":{"id":"1710.00244","kind":"arxiv","version":1}},"canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96ee0900c04fc30a1147529664cef90b139c095871609a19175f2991b8f171a","first_computed_at":"2026-05-18T00:33:55.425078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:55.425078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWCTKf8KeNXshL+pkbSq1O0MOZLM0dtMCplIF3uxUInqAoFJOyw+bBidwh+qflJVO+jBtgRqPJ5o5Qf7WOt/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:55.425735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4753d00dca5f971a2c972734bcf19a03708550aa11872e9e7a486dac4e848ae7","sha256:9a0512fb49b9480f77c2b581d8a5177277f9ec426807a0d5c23dea45c4e42def"],"state_sha256":"2db5b86d5cbd0ace8ce2ecb9876dff1663e745582840c58be3e8cc56f5b246c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvCBuCKxtRlYTlP7z7Frw4tplGiZ6djRSX+IzqxIuxE66ls/2cVLxJxzRhoJA7tvT6gCqYk6UOsyv5jyr877DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:38:28.513467Z","bundle_sha256":"3d308703d30337fa4c24a076c802db3991dc1d3df30e631df728ce43196bd2fc"}}