{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:237SJ5C43CFR333DLIFQMEIDDO","short_pith_number":"pith:237SJ5C4","schema_version":"1.0","canonical_sha256":"d6ff24f45cd88b1def635a0b0611031bbb47b40684daf4580c60ccde084f75b0","source":{"kind":"arxiv","id":"1708.03869","version":1},"attestation_state":"computed","paper":{"title":"Strong geodetic problem in grid like architectures","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-13T07:45:13Z","abstract_excerpt":"A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If $G$ is a graph, then ${\\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that one can assign a fixed geodesic to each pair $\\{x,y\\}\\subseteq S$ so that these $\\binom{|S|}{2}$ geodesics cover all the vertices of $G$. In this paper, the strong geodesic problem is studied on Cartesian product graphs. A general upper bound is proved on the Cartesian product of a path with an arbitrary graph and showed that the bound is tight on flat grids and flat cylinders."},"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.03869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-13T07:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"76cf106f29f6585bbafd82065cba5161199caab7dec7f0cfbdd5afa0ef2340ef","abstract_canon_sha256":"955a1e95dafb590ff990722f0bc1bd07065eec53e7b8c61d202574e5b7b3f5be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:07.671798Z","signature_b64":"GQw8+DjjTUn8/c6+yR6AOVW+XgrmLUyOD/x2obB6yWQIvDLIj4qAbnQgBBgh/o0AULoBcrzXGAfg1AEG0H31Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ff24f45cd88b1def635a0b0611031bbb47b40684daf4580c60ccde084f75b0","last_reissued_at":"2026-05-18T00:38:07.671203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:07.671203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong geodetic problem in grid like architectures","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-13T07:45:13Z","abstract_excerpt":"A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If $G$ is a graph, then ${\\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that one can assign a fixed geodesic to each pair $\\{x,y\\}\\subseteq S$ so that these $\\binom{|S|}{2}$ geodesics cover all the vertices of $G$. In this paper, the strong geodesic problem is studied on Cartesian product graphs. A general upper bound is proved on the Cartesian product of a path with an arbitrary graph and showed that the bound is tight on flat grids and flat cylinders."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03869","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.03869","created_at":"2026-05-18T00:38:07.671285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03869v1","created_at":"2026-05-18T00:38:07.671285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03869","created_at":"2026-05-18T00:38:07.671285+00:00"},{"alias_kind":"pith_short_12","alias_value":"237SJ5C43CFR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"237SJ5C43CFR333D","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"237SJ5C4","created_at":"2026-05-18T12:30:55.937587+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/237SJ5C43CFR333DLIFQMEIDDO","json":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO.json","graph_json":"https://pith.science/api/pith-number/237SJ5C43CFR333DLIFQMEIDDO/graph.json","events_json":"https://pith.science/api/pith-number/237SJ5C43CFR333DLIFQMEIDDO/events.json","paper":"https://pith.science/paper/237SJ5C4"},"agent_actions":{"view_html":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO","download_json":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO.json","view_paper":"https://pith.science/paper/237SJ5C4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03869&json=true","fetch_graph":"https://pith.science/api/pith-number/237SJ5C43CFR333DLIFQMEIDDO/graph.json","fetch_events":"https://pith.science/api/pith-number/237SJ5C43CFR333DLIFQMEIDDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO/action/storage_attestation","attest_author":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO/action/author_attestation","sign_citation":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO/action/citation_signature","submit_replication":"https://pith.science/pith/237SJ5C43CFR333DLIFQMEIDDO/action/replication_record"}},"created_at":"2026-05-18T00:38:07.671285+00:00","updated_at":"2026-05-18T00:38:07.671285+00:00"}