{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GKZ7BW2CF7G4Z4QZOY5IL7AKJF","short_pith_number":"pith:GKZ7BW2C","schema_version":"1.0","canonical_sha256":"32b3f0db422fcdccf219763a85fc0a4977be33125dfd75f689e4fa458ee81e8c","source":{"kind":"arxiv","id":"1604.07698","version":2},"attestation_state":"computed","paper":{"title":"Coprime and prime labelings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aba Mbirika, Adam H. Berliner, Alison Marr, Cayla D. McBee, Jonelle Hook, Nathaniel Dean","submitted_at":"2016-04-26T14:45:12Z","abstract_excerpt":"A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs."},"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":"1604.07698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-26T14:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"c36eb06d92104f084171b924ba2a5f76d796f106d1ce6edd29003a8d70e00d68","abstract_canon_sha256":"6529bb5c5be4f0cd0515d87278636896856cd010fe5d5083b4b93d704e1f3d47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.724532Z","signature_b64":"WN/pdF11Jar0ZkmD0PMfFevhc/q88hNVhclmpBL126S3dsT6w4qXktkAZMccmGGWWuRYZsDhwJVsbRoJHIkxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32b3f0db422fcdccf219763a85fc0a4977be33125dfd75f689e4fa458ee81e8c","last_reissued_at":"2026-05-18T00:37:58.723956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.723956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coprime and prime labelings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aba Mbirika, Adam H. Berliner, Alison Marr, Cayla D. McBee, Jonelle Hook, Nathaniel Dean","submitted_at":"2016-04-26T14:45:12Z","abstract_excerpt":"A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07698","kind":"arxiv","version":2},"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":"1604.07698","created_at":"2026-05-18T00:37:58.724041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07698v2","created_at":"2026-05-18T00:37:58.724041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07698","created_at":"2026-05-18T00:37:58.724041+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKZ7BW2CF7G4","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKZ7BW2CF7G4Z4QZ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKZ7BW2C","created_at":"2026-05-18T12:30:19.053100+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/GKZ7BW2CF7G4Z4QZOY5IL7AKJF","json":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF.json","graph_json":"https://pith.science/api/pith-number/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/graph.json","events_json":"https://pith.science/api/pith-number/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/events.json","paper":"https://pith.science/paper/GKZ7BW2C"},"agent_actions":{"view_html":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF","download_json":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF.json","view_paper":"https://pith.science/paper/GKZ7BW2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07698&json=true","fetch_graph":"https://pith.science/api/pith-number/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/graph.json","fetch_events":"https://pith.science/api/pith-number/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/action/storage_attestation","attest_author":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/action/author_attestation","sign_citation":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/action/citation_signature","submit_replication":"https://pith.science/pith/GKZ7BW2CF7G4Z4QZOY5IL7AKJF/action/replication_record"}},"created_at":"2026-05-18T00:37:58.724041+00:00","updated_at":"2026-05-18T00:37:58.724041+00:00"}