{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VNY4SDUEH3SPFTJSTD7A7MHSO2","short_pith_number":"pith:VNY4SDUE","schema_version":"1.0","canonical_sha256":"ab71c90e843ee4f2cd3298fe0fb0f2769e7c90392584e069532ef9c4994459a1","source":{"kind":"arxiv","id":"1804.02473","version":1},"attestation_state":"computed","paper":{"title":"New Perspectives on Neighborhood-Prime Labelings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, John Asplund, N. Bradley Fox","submitted_at":"2018-04-06T22:15:27Z","abstract_excerpt":"Neighborhood-prime labeling is a variation of prime labeling. A labeling $f:V(G) \\to [|V(G)|]$ is a neighborhood-prime labeling if for each vertex $v\\in V(G)$ with degree greater than $1$, the greatest common divisor of the set of labels in the neighborhood of $v$ is $1$. In this paper, we introduce techniques for finding neighborhood-prime labelings based on the Hamiltonicity of the graph, by using conditions on possible degrees of vertices, and by examining a neighborhood graph. In particular, classes of graphs shown to be neighborhood-prime include all generalized Petersen graphs, grid grap"},"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":"1804.02473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-06T22:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"669bf87b759c042fa4e7cdfa7d7472045ec4a3d334c520c2401c9a0a63ee7e87","abstract_canon_sha256":"998a585e11385afda183830a25802baab4af005dc56fe1197befcd585f3487c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:59.376059Z","signature_b64":"j3Z789cnxIv6e/rT6lxcFLlg1OadLevCX2kKP4KWV0sVAa7AdfdX48b95tUzAmiRpnVPQpyJf6TDAcM+sL1uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab71c90e843ee4f2cd3298fe0fb0f2769e7c90392584e069532ef9c4994459a1","last_reissued_at":"2026-05-18T00:18:59.375545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:59.375545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Perspectives on Neighborhood-Prime Labelings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, John Asplund, N. Bradley Fox","submitted_at":"2018-04-06T22:15:27Z","abstract_excerpt":"Neighborhood-prime labeling is a variation of prime labeling. A labeling $f:V(G) \\to [|V(G)|]$ is a neighborhood-prime labeling if for each vertex $v\\in V(G)$ with degree greater than $1$, the greatest common divisor of the set of labels in the neighborhood of $v$ is $1$. In this paper, we introduce techniques for finding neighborhood-prime labelings based on the Hamiltonicity of the graph, by using conditions on possible degrees of vertices, and by examining a neighborhood graph. In particular, classes of graphs shown to be neighborhood-prime include all generalized Petersen graphs, grid grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02473","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":"1804.02473","created_at":"2026-05-18T00:18:59.375635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02473v1","created_at":"2026-05-18T00:18:59.375635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02473","created_at":"2026-05-18T00:18:59.375635+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNY4SDUEH3SP","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNY4SDUEH3SPFTJS","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNY4SDUE","created_at":"2026-05-18T12:32:59.047623+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/VNY4SDUEH3SPFTJSTD7A7MHSO2","json":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2.json","graph_json":"https://pith.science/api/pith-number/VNY4SDUEH3SPFTJSTD7A7MHSO2/graph.json","events_json":"https://pith.science/api/pith-number/VNY4SDUEH3SPFTJSTD7A7MHSO2/events.json","paper":"https://pith.science/paper/VNY4SDUE"},"agent_actions":{"view_html":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2","download_json":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2.json","view_paper":"https://pith.science/paper/VNY4SDUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02473&json=true","fetch_graph":"https://pith.science/api/pith-number/VNY4SDUEH3SPFTJSTD7A7MHSO2/graph.json","fetch_events":"https://pith.science/api/pith-number/VNY4SDUEH3SPFTJSTD7A7MHSO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2/action/storage_attestation","attest_author":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2/action/author_attestation","sign_citation":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2/action/citation_signature","submit_replication":"https://pith.science/pith/VNY4SDUEH3SPFTJSTD7A7MHSO2/action/replication_record"}},"created_at":"2026-05-18T00:18:59.375635+00:00","updated_at":"2026-05-18T00:18:59.375635+00:00"}