{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GIESKUKKROHTLSM4S22ZE6H2PH","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":"82245cc4fceb6070207ff3fad863733fa2f093a02d26c29bfee6a585a4bb10f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T16:23:43Z","title_canon_sha256":"079bd3ec49fdb4ddd45f2645674b559fb2380d9eedc028d794ab759298713c95"},"schema_version":"1.0","source":{"id":"1206.6327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6327","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6327v1","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6327","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"GIESKUKKROHT","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GIESKUKKROHTLSM4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GIESKUKK","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0c4df4f96f36229deefdca1b85acf8fe16dd545b213cb20bb708d7be3a8b6e8d","target":"graph","created_at":"2026-05-18T03:52:26Z","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":"A radio labeling of a connected graph $G$ is a function $c:V(G) \\to \\mathbb Z_+$ such that for every two distinct vertices $u$ and $v$ of $G$ $$\\text{distance}(u,v)+|c(u)-c(v)|\\geq 1+ \\text{diameter}(G).$$ The radio number of a graph $G$ is the smallest integer $M$ for which there exists a labeling $c$ with $c(v)\\leq M$ for all $v\\in V(G)$. The radio number of graphs of order $n$ and diameter $n-1$, i.e., paths, was determined in \\cite{paths}. Here we determine the radio numbers of all graphs of order $n$ and diameter $n-2$.","authors_text":"Katherine Benson, Maggy Tomova, Matthew Porter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T16:23:43Z","title":"The Radio numbers of all graphs of order $n$ and diameter $n-2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6327","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:8df9390b40f4bb5c79decbaed8313bb4d1ef580d91d83081f7d4d1e98c2f649a","target":"record","created_at":"2026-05-18T03:52:26Z","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":"82245cc4fceb6070207ff3fad863733fa2f093a02d26c29bfee6a585a4bb10f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T16:23:43Z","title_canon_sha256":"079bd3ec49fdb4ddd45f2645674b559fb2380d9eedc028d794ab759298713c95"},"schema_version":"1.0","source":{"id":"1206.6327","kind":"arxiv","version":1}},"canonical_sha256":"320925514a8b8f35c99c96b59278fa79df4c0d68b0825bd6725be908b3831865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320925514a8b8f35c99c96b59278fa79df4c0d68b0825bd6725be908b3831865","first_computed_at":"2026-05-18T03:52:26.952652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:26.952652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UgNE+UYO7ztA+0ZWUXVz1hQP2g908j1tKgm/S9mrdHGlJAmHBronDAspaFe2VqZRDpX+jhPyUXUMfrmSAwqODA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:26.953361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8df9390b40f4bb5c79decbaed8313bb4d1ef580d91d83081f7d4d1e98c2f649a","sha256:0c4df4f96f36229deefdca1b85acf8fe16dd545b213cb20bb708d7be3a8b6e8d"],"state_sha256":"86159f6682ea5f724816bb75347b2504926cc2e53c14901a780157f7606e5ae4"}