{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SQQM2ZCD2ARDTIREZY5PREBCXU","short_pith_number":"pith:SQQM2ZCD","schema_version":"1.0","canonical_sha256":"9420cd6443d02239a224ce3af89022bd3c998bcb936dfca1de12585a91be0840","source":{"kind":"arxiv","id":"1806.00302","version":1},"attestation_state":"computed","paper":{"title":"Strong geodetic problem on complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matja\\v{z} Konvalinka, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2018-06-01T12:07:05Z","abstract_excerpt":"The strong geodetic problem is to find the smallest number of vertices such that by fixing one shortest path between each pair, all vertices of the graph are covered. In this paper we study the strong geodetic problem on complete bipartite graphs; in particular, we discuss its asymptotic behavior. Some results for complete multipartite graphs are also derived. Finally, we prove that the strong geodetic problem restricted to (general) bipartite graphs is NP-complete."},"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":"1806.00302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T12:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"39c241d76118f6de15345a6018ad0396b7f51b09c5c376d01fd362c0a7654f3d","abstract_canon_sha256":"781e13301b5cdd119d23d2ede3dfd5c09fbf4f80e5ba3ed02feec65e1b274b17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:24.105226Z","signature_b64":"flNQeVqgeozH855/rcmrlWT4hnBVGjgFCwcT/siC5oAzsETMz6yqpncs4/VuF+TIdlUwNdeDyAvAci3R58l7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9420cd6443d02239a224ce3af89022bd3c998bcb936dfca1de12585a91be0840","last_reissued_at":"2026-05-18T00:14:24.104591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:24.104591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong geodetic problem on complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matja\\v{z} Konvalinka, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2018-06-01T12:07:05Z","abstract_excerpt":"The strong geodetic problem is to find the smallest number of vertices such that by fixing one shortest path between each pair, all vertices of the graph are covered. In this paper we study the strong geodetic problem on complete bipartite graphs; in particular, we discuss its asymptotic behavior. Some results for complete multipartite graphs are also derived. Finally, we prove that the strong geodetic problem restricted to (general) bipartite graphs is NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00302","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":"1806.00302","created_at":"2026-05-18T00:14:24.104686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00302v1","created_at":"2026-05-18T00:14:24.104686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00302","created_at":"2026-05-18T00:14:24.104686+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQQM2ZCD2ARD","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQQM2ZCD2ARDTIRE","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQQM2ZCD","created_at":"2026-05-18T12:32:53.628368+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/SQQM2ZCD2ARDTIREZY5PREBCXU","json":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU.json","graph_json":"https://pith.science/api/pith-number/SQQM2ZCD2ARDTIREZY5PREBCXU/graph.json","events_json":"https://pith.science/api/pith-number/SQQM2ZCD2ARDTIREZY5PREBCXU/events.json","paper":"https://pith.science/paper/SQQM2ZCD"},"agent_actions":{"view_html":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU","download_json":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU.json","view_paper":"https://pith.science/paper/SQQM2ZCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00302&json=true","fetch_graph":"https://pith.science/api/pith-number/SQQM2ZCD2ARDTIREZY5PREBCXU/graph.json","fetch_events":"https://pith.science/api/pith-number/SQQM2ZCD2ARDTIREZY5PREBCXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU/action/storage_attestation","attest_author":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU/action/author_attestation","sign_citation":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU/action/citation_signature","submit_replication":"https://pith.science/pith/SQQM2ZCD2ARDTIREZY5PREBCXU/action/replication_record"}},"created_at":"2026-05-18T00:14:24.104686+00:00","updated_at":"2026-05-18T00:14:24.104686+00:00"}