{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MEDMRR3HLONXUOC6OAGHDASP5T","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":"a7cdbac3c9f1bf022c8e2b06be6b13ddbceb0242fcc6f04cb6054162f11da0b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T05:48:35Z","title_canon_sha256":"ce22e4e4ccda19d62a571f46462cfd6e7fb3634cada50648270000e79ebe9195"},"schema_version":"1.0","source":{"id":"1609.03002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03002","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03002v1","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03002","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"MEDMRR3HLONX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MEDMRR3HLONXUOC6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MEDMRR3H","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:403e6c43191c7bfedcc982c6ebd38dea4bd32652756469f70a132574e31fed3a","target":"graph","created_at":"2026-05-18T01:04:49Z","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 graph $G$ is a mapping $f: V(G) \\rightarrow \\{0, 1, 2, \\ldots\\}$ such that $|f(u)-f(v)|\\geq d + 1 - d(u,v)$ for every pair of distinct vertices $u, v$ of $G$, where $d$ is the diameter of $G$ and $d(u,v)$ the distance between $u$ and $v$ in $G$. The radio number of $G$ is the smallest integer $k$ such that $G$ has a radio labeling $f$ with $\\max\\{f(v) : v \\in V(G)\\} = k$. We give a necessary and sufficient condition for a lower bound on the radio number of trees to be achieved, two other sufficient conditions for the same bound to be achieved by a tree, and an upper bound","authors_text":"Devsi Bantva, Samir Vaidya, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T05:48:35Z","title":"Radio number of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03002","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:3e7ac2a4d6949d7544b2a8d66999b2d064a1ab5d9b50df24c79c47e63d71e6e9","target":"record","created_at":"2026-05-18T01:04:49Z","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":"a7cdbac3c9f1bf022c8e2b06be6b13ddbceb0242fcc6f04cb6054162f11da0b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T05:48:35Z","title_canon_sha256":"ce22e4e4ccda19d62a571f46462cfd6e7fb3634cada50648270000e79ebe9195"},"schema_version":"1.0","source":{"id":"1609.03002","kind":"arxiv","version":1}},"canonical_sha256":"6106c8c7675b9b7a385e700c71824fecf5e46978f4da77f6897b7fb87d0876dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6106c8c7675b9b7a385e700c71824fecf5e46978f4da77f6897b7fb87d0876dd","first_computed_at":"2026-05-18T01:04:49.172445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:49.172445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x38INr/5iqiUIEYj2CQS7o6kHFkuiJZpfipndri4DGaILPRQEg0d7d0SlXg4TxYrMS7rk/ZRkgjoPCOMg1hACw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:49.172991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e7ac2a4d6949d7544b2a8d66999b2d064a1ab5d9b50df24c79c47e63d71e6e9","sha256:403e6c43191c7bfedcc982c6ebd38dea4bd32652756469f70a132574e31fed3a"],"state_sha256":"2cd45c40664386d8a96a3f2f0f7e048285a86c24118aae1bacb6326dd600406b"}