{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4N3VLVIGN5FPZWNG7KGLL55XRS","short_pith_number":"pith:4N3VLVIG","schema_version":"1.0","canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","source":{"kind":"arxiv","id":"1906.00935","version":1},"attestation_state":"computed","paper":{"title":"The general position problem and strong resolving graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Sandi Klavzar","submitted_at":"2019-06-03T17:25:01Z","abstract_excerpt":"The general position number ${\\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\\rm gp}(G)\\ge \\omega(G_{\\rm SR}$, where $G_{\\rm SR}$ is the strong resolving graph of $G$, and $\\omega(G_{\\rm SR})$ is its clique number. That the bound is sharp is demonstrated with numerous constructions including for instance direct products of complete graphs and different families of strong products, of generalized lexicographic products, and of rooted product graphs. For "},"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":"1906.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"85a5997ee037b4fba0db2255ea491cc84aa0fa3b84d64d95a941c0e858723176","abstract_canon_sha256":"551dc66719becf22dab4014c34e844b819a9be8d3d11c67eda2e76615013357c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.464051Z","signature_b64":"dDZfVNGZxx3udiulkHqmuCV4wjSN5s8cymgs+4FidVHhtQPSwlzJgp6hiL1f2irF5b18M0pc2YzbQqoZXrZBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","last_reissued_at":"2026-05-17T23:44:23.463398Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.463398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The general position problem and strong resolving graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Sandi Klavzar","submitted_at":"2019-06-03T17:25:01Z","abstract_excerpt":"The general position number ${\\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\\rm gp}(G)\\ge \\omega(G_{\\rm SR}$, where $G_{\\rm SR}$ is the strong resolving graph of $G$, and $\\omega(G_{\\rm SR})$ is its clique number. That the bound is sharp is demonstrated with numerous constructions including for instance direct products of complete graphs and different families of strong products, of generalized lexicographic products, and of rooted product graphs. For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00935","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":"1906.00935","created_at":"2026-05-17T23:44:23.463505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00935v1","created_at":"2026-05-17T23:44:23.463505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00935","created_at":"2026-05-17T23:44:23.463505+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N3VLVIGN5FP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N3VLVIGN5FPZWNG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N3VLVIG","created_at":"2026-05-18T12:33:10.108867+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/4N3VLVIGN5FPZWNG7KGLL55XRS","json":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS.json","graph_json":"https://pith.science/api/pith-number/4N3VLVIGN5FPZWNG7KGLL55XRS/graph.json","events_json":"https://pith.science/api/pith-number/4N3VLVIGN5FPZWNG7KGLL55XRS/events.json","paper":"https://pith.science/paper/4N3VLVIG"},"agent_actions":{"view_html":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS","download_json":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS.json","view_paper":"https://pith.science/paper/4N3VLVIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00935&json=true","fetch_graph":"https://pith.science/api/pith-number/4N3VLVIGN5FPZWNG7KGLL55XRS/graph.json","fetch_events":"https://pith.science/api/pith-number/4N3VLVIGN5FPZWNG7KGLL55XRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/action/storage_attestation","attest_author":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/action/author_attestation","sign_citation":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/action/citation_signature","submit_replication":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/action/replication_record"}},"created_at":"2026-05-17T23:44:23.463505+00:00","updated_at":"2026-05-17T23:44:23.463505+00:00"}