{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TJQVW56O4OX23PGJSCWOY7YMCF","short_pith_number":"pith:TJQVW56O","schema_version":"1.0","canonical_sha256":"9a615b77cee3afadbcc990acec7f0c115eb08cc18693a9a6818f3341873a7e9f","source":{"kind":"arxiv","id":"1007.5344","version":1},"attestation_state":"computed","paper":{"title":"The Radio Number of $C_n \\square C_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Yeager, Cindy Wyels, Maggy Tomova, Marc Morris-Rivera","submitted_at":"2010-07-29T22:30:18Z","abstract_excerpt":"Radio labeling is a variation of Hale's channel assignment problem, in which one seeks to assign positive integers to the vertices of a graph $G$ subject to certain constraints involving the distances between the vertices. Specifically, a radio labeling of a connected graph $G$ is a function $c:V(G) \\rightarrow \\mathbb Z_+$ such that $$d(u,v)+|c(u)-c(v)|\\geq 1+\\text{diam}(G)$$ for every two distinct vertices $u$ and $v$ of $G$ (where $d(u,v)$ is the distance between $u$ and $v$). The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph $G$ is the mi"},"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":"1007.5344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-29T22:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"ac23dc60ff7fe63db68ac627c53a93cdca9f4f4873c5f8e829fe8554bc6b2958","abstract_canon_sha256":"a5bf5d2f790b3bd81e0dffb3285d110e18dac56f1590c3a85cde1f07a6858683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.385450Z","signature_b64":"T4sMpMIiADRl3KAwhh2W+9E/mrjeK5mmg/JxaHLF8RKmhJrEM3X+vj8KeWPjvs9QNPcNEk29fMdnNSqGCxpHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a615b77cee3afadbcc990acec7f0c115eb08cc18693a9a6818f3341873a7e9f","last_reissued_at":"2026-05-18T04:42:45.384754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.384754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Radio Number of $C_n \\square C_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Yeager, Cindy Wyels, Maggy Tomova, Marc Morris-Rivera","submitted_at":"2010-07-29T22:30:18Z","abstract_excerpt":"Radio labeling is a variation of Hale's channel assignment problem, in which one seeks to assign positive integers to the vertices of a graph $G$ subject to certain constraints involving the distances between the vertices. Specifically, a radio labeling of a connected graph $G$ is a function $c:V(G) \\rightarrow \\mathbb Z_+$ such that $$d(u,v)+|c(u)-c(v)|\\geq 1+\\text{diam}(G)$$ for every two distinct vertices $u$ and $v$ of $G$ (where $d(u,v)$ is the distance between $u$ and $v$). The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph $G$ is the mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5344","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":"1007.5344","created_at":"2026-05-18T04:42:45.384874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.5344v1","created_at":"2026-05-18T04:42:45.384874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5344","created_at":"2026-05-18T04:42:45.384874+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJQVW56O4OX2","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJQVW56O4OX23PGJ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJQVW56O","created_at":"2026-05-18T12:26:13.927090+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/TJQVW56O4OX23PGJSCWOY7YMCF","json":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF.json","graph_json":"https://pith.science/api/pith-number/TJQVW56O4OX23PGJSCWOY7YMCF/graph.json","events_json":"https://pith.science/api/pith-number/TJQVW56O4OX23PGJSCWOY7YMCF/events.json","paper":"https://pith.science/paper/TJQVW56O"},"agent_actions":{"view_html":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF","download_json":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF.json","view_paper":"https://pith.science/paper/TJQVW56O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.5344&json=true","fetch_graph":"https://pith.science/api/pith-number/TJQVW56O4OX23PGJSCWOY7YMCF/graph.json","fetch_events":"https://pith.science/api/pith-number/TJQVW56O4OX23PGJSCWOY7YMCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF/action/storage_attestation","attest_author":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF/action/author_attestation","sign_citation":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF/action/citation_signature","submit_replication":"https://pith.science/pith/TJQVW56O4OX23PGJSCWOY7YMCF/action/replication_record"}},"created_at":"2026-05-18T04:42:45.384874+00:00","updated_at":"2026-05-18T04:42:45.384874+00:00"}