{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SQQM2ZCD2ARDTIREZY5PREBCXU","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":"781e13301b5cdd119d23d2ede3dfd5c09fbf4f80e5ba3ed02feec65e1b274b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T12:07:05Z","title_canon_sha256":"39c241d76118f6de15345a6018ad0396b7f51b09c5c376d01fd362c0a7654f3d"},"schema_version":"1.0","source":{"id":"1806.00302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00302","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00302v1","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00302","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"SQQM2ZCD2ARD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SQQM2ZCD2ARDTIRE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SQQM2ZCD","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:b2ac1725eec17f379a7070e48ff2b1d3d0852154249ea309fd7f3c0ce8e5183d","target":"graph","created_at":"2026-05-18T00:14:24Z","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":"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.","authors_text":"Matja\\v{z} Konvalinka, Vesna Ir\\v{s}i\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T12:07:05Z","title":"Strong geodetic problem on complete multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00302","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:535ca43029984e21a9a30cdd1fcaa68acdac136f924923864e0b6a3e319c2f08","target":"record","created_at":"2026-05-18T00:14:24Z","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":"781e13301b5cdd119d23d2ede3dfd5c09fbf4f80e5ba3ed02feec65e1b274b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T12:07:05Z","title_canon_sha256":"39c241d76118f6de15345a6018ad0396b7f51b09c5c376d01fd362c0a7654f3d"},"schema_version":"1.0","source":{"id":"1806.00302","kind":"arxiv","version":1}},"canonical_sha256":"9420cd6443d02239a224ce3af89022bd3c998bcb936dfca1de12585a91be0840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9420cd6443d02239a224ce3af89022bd3c998bcb936dfca1de12585a91be0840","first_computed_at":"2026-05-18T00:14:24.104591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:24.104591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"flNQeVqgeozH855/rcmrlWT4hnBVGjgFCwcT/siC5oAzsETMz6yqpncs4/VuF+TIdlUwNdeDyAvAci3R58l7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:24.105226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:535ca43029984e21a9a30cdd1fcaa68acdac136f924923864e0b6a3e319c2f08","sha256:b2ac1725eec17f379a7070e48ff2b1d3d0852154249ea309fd7f3c0ce8e5183d"],"state_sha256":"a4bed6f46dff5aa44df152f33b8890e9aef52dd50db3f6971ce0a53757d1cb6d"}