{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4TFQT2SKDXL6XG3AGY3Z2XF4BU","short_pith_number":"pith:4TFQT2SK","schema_version":"1.0","canonical_sha256":"e4cb09ea4a1dd7eb9b6036379d5cbc0d0926235b2daf15ddf6cab43ee83b5625","source":{"kind":"arxiv","id":"1007.5346","version":1},"attestation_state":"computed","paper":{"title":"Radio numbers for generalized prism graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cindy Wyels, Juan Ortiz, Maggy Tomova, Paul Martinez","submitted_at":"2010-07-29T22:53:08Z","abstract_excerpt":"A radio labeling is an assignment $c:V(G) \\rightarrow \\textbf{N}$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|\\geq \\diam(G)+1$. The span of a radio labeling is the maximum value. The radio number of $G$, $rn(G)$, is the minimum span over all radio labelings of $G$. Generalized prism graphs, denoted $Z_{n,s}$, $s \\geq 1$, $n\\geq s$, have vertex set $\\{(i,j)\\,|\\, i=1,2 \\text{and} j=1,...,n\\}$ and edge set $\\{((i,j),(i,j \\pm 1))\\} \\cup \\{((1,i),(2,i+\\sigma))\\,|\\,\\sigma=-\\left\\lfloor\\frac{s-1}{2}\\right\\rfloor\\,\\ldots,0,\\ldots,\\left\\lfloor\\frac{s}{2}\\"},"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.5346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-29T22:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"bc5159d1a724512fcfd762a9bb1bce4613dc9bea16f62295780bad9eaaab3cf9","abstract_canon_sha256":"cfb905f6703d4e3ad3c23d56d18af88148e9cc5bab77e17e6f8ae15b392f2dcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.377225Z","signature_b64":"k8vNUyy3uIDQgqY9FRciPQYbE9/te9mCCYu5SMKQSZfvheZ2/TFpH5fKIt3wPm21iZ88mExWQMGvQXXy3OUkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4cb09ea4a1dd7eb9b6036379d5cbc0d0926235b2daf15ddf6cab43ee83b5625","last_reissued_at":"2026-05-18T04:42:45.376610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.376610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Radio numbers for generalized prism graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cindy Wyels, Juan Ortiz, Maggy Tomova, Paul Martinez","submitted_at":"2010-07-29T22:53:08Z","abstract_excerpt":"A radio labeling is an assignment $c:V(G) \\rightarrow \\textbf{N}$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|\\geq \\diam(G)+1$. The span of a radio labeling is the maximum value. The radio number of $G$, $rn(G)$, is the minimum span over all radio labelings of $G$. Generalized prism graphs, denoted $Z_{n,s}$, $s \\geq 1$, $n\\geq s$, have vertex set $\\{(i,j)\\,|\\, i=1,2 \\text{and} j=1,...,n\\}$ and edge set $\\{((i,j),(i,j \\pm 1))\\} \\cup \\{((1,i),(2,i+\\sigma))\\,|\\,\\sigma=-\\left\\lfloor\\frac{s-1}{2}\\right\\rfloor\\,\\ldots,0,\\ldots,\\left\\lfloor\\frac{s}{2}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5346","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.5346","created_at":"2026-05-18T04:42:45.376706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.5346v1","created_at":"2026-05-18T04:42:45.376706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5346","created_at":"2026-05-18T04:42:45.376706+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TFQT2SKDXL6","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TFQT2SKDXL6XG3A","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TFQT2SK","created_at":"2026-05-18T12:26:04.259169+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/4TFQT2SKDXL6XG3AGY3Z2XF4BU","json":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU.json","graph_json":"https://pith.science/api/pith-number/4TFQT2SKDXL6XG3AGY3Z2XF4BU/graph.json","events_json":"https://pith.science/api/pith-number/4TFQT2SKDXL6XG3AGY3Z2XF4BU/events.json","paper":"https://pith.science/paper/4TFQT2SK"},"agent_actions":{"view_html":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU","download_json":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU.json","view_paper":"https://pith.science/paper/4TFQT2SK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.5346&json=true","fetch_graph":"https://pith.science/api/pith-number/4TFQT2SKDXL6XG3AGY3Z2XF4BU/graph.json","fetch_events":"https://pith.science/api/pith-number/4TFQT2SKDXL6XG3AGY3Z2XF4BU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU/action/storage_attestation","attest_author":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU/action/author_attestation","sign_citation":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU/action/citation_signature","submit_replication":"https://pith.science/pith/4TFQT2SKDXL6XG3AGY3Z2XF4BU/action/replication_record"}},"created_at":"2026-05-18T04:42:45.376706+00:00","updated_at":"2026-05-18T04:42:45.376706+00:00"}