{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F6TG7GN2NGMDR66BKYJGB5EP6F","short_pith_number":"pith:F6TG7GN2","schema_version":"1.0","canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","source":{"kind":"arxiv","id":"1907.01249","version":1},"attestation_state":"computed","paper":{"title":"Elegant vertex labelings with prime numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thierry Gensane","submitted_at":"2019-07-02T09:20:36Z","abstract_excerpt":"We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the first even numbers. The labels of an elegant tree with $n$ vertices are the first $n$ odd prime numbers and we want that the resulting edge labels are exactly the first even numbers up to $2n-2$. We conjecture that each path is elegant and we give the algorithm with which we got elegant paths of $n$ primes for all $n$ up to $n=3500$."},"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":"1907.01249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T09:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"edb94f673d5f35e3b9e36062f01c6726e55bc210ce39ac66a52ea444c18b9199","abstract_canon_sha256":"263fbd55f08d5c73025c3a2da4b8d8bfc1323816c5e96d9ac0b43f3e57ca68ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.852207Z","signature_b64":"HGjU+fCLovevb2zWIx82VX9BsDXLGAgatY+AYYcmuS07Bs2tZFDeC0rpXcvbTW5a+QlTRxjiI4dI3p6jYpSPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","last_reissued_at":"2026-05-17T23:41:40.851749Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.851749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elegant vertex labelings with prime numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thierry Gensane","submitted_at":"2019-07-02T09:20:36Z","abstract_excerpt":"We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the first even numbers. The labels of an elegant tree with $n$ vertices are the first $n$ odd prime numbers and we want that the resulting edge labels are exactly the first even numbers up to $2n-2$. We conjecture that each path is elegant and we give the algorithm with which we got elegant paths of $n$ primes for all $n$ up to $n=3500$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01249","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":"1907.01249","created_at":"2026-05-17T23:41:40.851816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01249v1","created_at":"2026-05-17T23:41:40.851816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01249","created_at":"2026-05-17T23:41:40.851816+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6TG7GN2NGMD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6TG7GN2NGMDR66B","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6TG7GN2","created_at":"2026-05-18T12:33:15.570797+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/F6TG7GN2NGMDR66BKYJGB5EP6F","json":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F.json","graph_json":"https://pith.science/api/pith-number/F6TG7GN2NGMDR66BKYJGB5EP6F/graph.json","events_json":"https://pith.science/api/pith-number/F6TG7GN2NGMDR66BKYJGB5EP6F/events.json","paper":"https://pith.science/paper/F6TG7GN2"},"agent_actions":{"view_html":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F","download_json":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F.json","view_paper":"https://pith.science/paper/F6TG7GN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01249&json=true","fetch_graph":"https://pith.science/api/pith-number/F6TG7GN2NGMDR66BKYJGB5EP6F/graph.json","fetch_events":"https://pith.science/api/pith-number/F6TG7GN2NGMDR66BKYJGB5EP6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/action/storage_attestation","attest_author":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/action/author_attestation","sign_citation":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/action/citation_signature","submit_replication":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/action/replication_record"}},"created_at":"2026-05-17T23:41:40.851816+00:00","updated_at":"2026-05-17T23:41:40.851816+00:00"}