{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7OQCK5D5TFKHO2HUQLZED3PHO6","short_pith_number":"pith:7OQCK5D5","schema_version":"1.0","canonical_sha256":"fba025747d99547768f482f241ede777b0003c8082feb27227b41aa1370f8ae8","source":{"kind":"arxiv","id":"1708.02414","version":1},"attestation_state":"computed","paper":{"title":"Strong geodetic problem on Cartesian products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2017-08-08T09:16:52Z","abstract_excerpt":"The strong geodetic problem is a recent variation of the geodetic problem. For a graph $G$, its strong geodetic number ${\\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on a fixed shortest path between a pair of vertices from $S$. In this paper, the strong geodetic problem is studied on the Cartesian product of graphs. A general upper bound for ${\\rm sg}(G \\,\\square\\, H)$ is determined, as well as exact values for $K_m \\,\\square\\, K_n$, $K_{1, k} \\,\\square\\, P_l$, and certain prisms. Connections between the strong geodetic number of a graph and"},"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.02414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T09:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"4b036b2a8a928cb1a0b87a6c09518f69a2e4c94506c1fde9d1679f3c51a42a8b","abstract_canon_sha256":"88f6ecdb2ff703f2d3a25d5d157bab4fdf2ee5ff29e05ff5bc33c52a93600ff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:24.340958Z","signature_b64":"gLZoNMveiopdV2WVL8TrCC31yGp3fRY0KaR5kUO/7D2cReJ5WbmDaiehhBVvlE7n5doKmKa9Kfm9BzTTkp6eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba025747d99547768f482f241ede777b0003c8082feb27227b41aa1370f8ae8","last_reissued_at":"2026-05-18T00:38:24.340212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:24.340212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong geodetic problem on Cartesian products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sandi Klav\\v{z}ar, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2017-08-08T09:16:52Z","abstract_excerpt":"The strong geodetic problem is a recent variation of the geodetic problem. For a graph $G$, its strong geodetic number ${\\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on a fixed shortest path between a pair of vertices from $S$. In this paper, the strong geodetic problem is studied on the Cartesian product of graphs. A general upper bound for ${\\rm sg}(G \\,\\square\\, H)$ is determined, as well as exact values for $K_m \\,\\square\\, K_n$, $K_{1, k} \\,\\square\\, P_l$, and certain prisms. Connections between the strong geodetic number of a graph and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02414","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.02414","created_at":"2026-05-18T00:38:24.340329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02414v1","created_at":"2026-05-18T00:38:24.340329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02414","created_at":"2026-05-18T00:38:24.340329+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OQCK5D5TFKH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OQCK5D5TFKHO2HU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OQCK5D5","created_at":"2026-05-18T12:31:05.417338+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/7OQCK5D5TFKHO2HUQLZED3PHO6","json":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6.json","graph_json":"https://pith.science/api/pith-number/7OQCK5D5TFKHO2HUQLZED3PHO6/graph.json","events_json":"https://pith.science/api/pith-number/7OQCK5D5TFKHO2HUQLZED3PHO6/events.json","paper":"https://pith.science/paper/7OQCK5D5"},"agent_actions":{"view_html":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6","download_json":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6.json","view_paper":"https://pith.science/paper/7OQCK5D5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02414&json=true","fetch_graph":"https://pith.science/api/pith-number/7OQCK5D5TFKHO2HUQLZED3PHO6/graph.json","fetch_events":"https://pith.science/api/pith-number/7OQCK5D5TFKHO2HUQLZED3PHO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6/action/storage_attestation","attest_author":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6/action/author_attestation","sign_citation":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6/action/citation_signature","submit_replication":"https://pith.science/pith/7OQCK5D5TFKHO2HUQLZED3PHO6/action/replication_record"}},"created_at":"2026-05-18T00:38:24.340329+00:00","updated_at":"2026-05-18T00:38:24.340329+00:00"}