{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F6TG7GN2NGMDR66BKYJGB5EP6F","short_pith_number":"pith:F6TG7GN2","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"},"canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","source":{"kind":"arxiv","id":"1907.01249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01249","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01249v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01249","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"F6TG7GN2NGMD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6TG7GN2NGMDR66B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6TG7GN2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F6TG7GN2NGMDR66BKYJGB5EP6F","target":"record","payload":{"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"},"canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","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"},"source_kind":"arxiv","source_id":"1907.01249","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqQnBR4Rpc2o5Va2wZ2duG69xyaeZFZR/rttypKH24p2vx11fzvSQFi2jqRRR/D6DZ+2U+mRGhWGBlOSYFw6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:38:03.836999Z"},"content_sha256":"f7467f70f8aca560ca86f366e03cb81b24b93bcda06b101da48e9c1eafdb8fa8","schema_version":"1.0","event_id":"sha256:f7467f70f8aca560ca86f366e03cb81b24b93bcda06b101da48e9c1eafdb8fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F6TG7GN2NGMDR66BKYJGB5EP6F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFxxNwk0b3PFuiIlH2O1OHlqDgHvFi0tH1DSVMbwr8xU3JRDVLhcACwK/YvA2Dg7CDLZtvPfznNfXgraGlVOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:38:03.837345Z"},"content_sha256":"03ed1866b448826c44fce5c173de54cd8cda4145fe889034dc099a9f1698acd2","schema_version":"1.0","event_id":"sha256:03ed1866b448826c44fce5c173de54cd8cda4145fe889034dc099a9f1698acd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/bundle.json","state_url":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T10:38:03Z","links":{"resolver":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F","bundle":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/bundle.json","state":"https://pith.science/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6TG7GN2NGMDR66BKYJGB5EP6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F6TG7GN2NGMDR66BKYJGB5EP6F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"263fbd55f08d5c73025c3a2da4b8d8bfc1323816c5e96d9ac0b43f3e57ca68ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T09:20:36Z","title_canon_sha256":"edb94f673d5f35e3b9e36062f01c6726e55bc210ce39ac66a52ea444c18b9199"},"schema_version":"1.0","source":{"id":"1907.01249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01249","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01249v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01249","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"F6TG7GN2NGMD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6TG7GN2NGMDR66B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6TG7GN2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:03ed1866b448826c44fce5c173de54cd8cda4145fe889034dc099a9f1698acd2","target":"graph","created_at":"2026-05-17T23:41:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Thierry Gensane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T09:20:36Z","title":"Elegant vertex labelings with prime numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01249","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7467f70f8aca560ca86f366e03cb81b24b93bcda06b101da48e9c1eafdb8fa8","target":"record","created_at":"2026-05-17T23:41:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"263fbd55f08d5c73025c3a2da4b8d8bfc1323816c5e96d9ac0b43f3e57ca68ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T09:20:36Z","title_canon_sha256":"edb94f673d5f35e3b9e36062f01c6726e55bc210ce39ac66a52ea444c18b9199"},"schema_version":"1.0","source":{"id":"1907.01249","kind":"arxiv","version":1}},"canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fa66f99ba699838fbc1561260f48ff16af13e9d9e3e4747b078f31a2e0bd58d","first_computed_at":"2026-05-17T23:41:40.851749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.851749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGjU+fCLovevb2zWIx82VX9BsDXLGAgatY+AYYcmuS07Bs2tZFDeC0rpXcvbTW5a+QlTRxjiI4dI3p6jYpSPBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.852207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7467f70f8aca560ca86f366e03cb81b24b93bcda06b101da48e9c1eafdb8fa8","sha256:03ed1866b448826c44fce5c173de54cd8cda4145fe889034dc099a9f1698acd2"],"state_sha256":"ddb8c8709f9ffcf8e96fe7c7ea70981ba6256e6b8b19b1aa50a9fe5739378ff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFWI8jCAwA9jVxNLT3lJve7S+J/24R5EMqv6Y38vxSVn8TRqZ6wz96cWTwYz6YF2zDhOLQiC+cF/jcXs8R6zCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:38:03.839158Z","bundle_sha256":"1fed619392b567218dc6354713ac874c796ccf6b3fb68fc42588a181004c8610"}}