{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NEQFWLG5VZRUKFILTL3RVYXKKH","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":"8aa57bed04908c5f0e2ff85dc1a3440d98a5c36fc3e03e0a69320586d0d71e02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-09T14:06:23Z","title_canon_sha256":"373886dec29e4f429cddbdf65ee7dc7a4be991015a5053eca02c3fc0760dda24"},"schema_version":"1.0","source":{"id":"1810.04004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04004","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04004v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04004","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"NEQFWLG5VZRU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NEQFWLG5VZRUKFIL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NEQFWLG5","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:04760e66484f37691699ca15f183fd10b42bed53895538694e78716eb66b6f17","target":"graph","created_at":"2026-05-18T00:03:44Z","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 number, $\\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the study of the strong geodetic number of complete bipartite graphs is continued. The formula for $\\text{sg}(K_{n,m})$ is given, as well as a formula for the crown graphs $S_n^0$. Bounds on $\\text{sg}(Q_n)$ are also discussed.","authors_text":"Valentin Gledel, 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-10-09T14:06:23Z","title":"Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04004","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:78fff2f5db53f1954da9ebcd1a650124d8c8dfe2aafdd8aaa7caf0e1ac31bfee","target":"record","created_at":"2026-05-18T00:03:44Z","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":"8aa57bed04908c5f0e2ff85dc1a3440d98a5c36fc3e03e0a69320586d0d71e02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-09T14:06:23Z","title_canon_sha256":"373886dec29e4f429cddbdf65ee7dc7a4be991015a5053eca02c3fc0760dda24"},"schema_version":"1.0","source":{"id":"1810.04004","kind":"arxiv","version":1}},"canonical_sha256":"69205b2cddae6345150b9af71ae2ea51cbf0651a2de4d37206b7511485533d06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69205b2cddae6345150b9af71ae2ea51cbf0651a2de4d37206b7511485533d06","first_computed_at":"2026-05-18T00:03:44.106757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.106757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fsGkiVp1rCxiuve47oeyJkFh5CHhs8g7Cz9bQE4pF3cojw+bad2/fDpateJkogC02FjTKlw8ncactFev2Jn8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.107291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78fff2f5db53f1954da9ebcd1a650124d8c8dfe2aafdd8aaa7caf0e1ac31bfee","sha256:04760e66484f37691699ca15f183fd10b42bed53895538694e78716eb66b6f17"],"state_sha256":"3f1e9c2049d32b4b0d119268be3ec2da117ba8724e85bf7979706587dd12e928"}