{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YOHCAY2BMLTNA34JVV24PGMPL6","short_pith_number":"pith:YOHCAY2B","canonical_record":{"source":{"id":"1007.2480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-15T05:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"d06f74482fea209c7cebf6e9e3bb9aa76915f26ae14d1cbeecf9f3d9e1653139","abstract_canon_sha256":"f7a49f5f4c68d8132c43bb13797e0f0869ac08c8806a6d6c89f9cc2f8ee61691"},"schema_version":"1.0"},"canonical_sha256":"c38e20634162e6d06f89ad75c7998f5f8f3e7ef3cfd41123518a336840ab253b","source":{"kind":"arxiv","id":"1007.2480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2480","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2480v2","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2480","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"YOHCAY2BMLTN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YOHCAY2BMLTNA34J","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YOHCAY2B","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YOHCAY2BMLTNA34JVV24PGMPL6","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-15T05:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"d06f74482fea209c7cebf6e9e3bb9aa76915f26ae14d1cbeecf9f3d9e1653139","abstract_canon_sha256":"f7a49f5f4c68d8132c43bb13797e0f0869ac08c8806a6d6c89f9cc2f8ee61691"},"schema_version":"1.0"},"canonical_sha256":"c38e20634162e6d06f89ad75c7998f5f8f3e7ef3cfd41123518a336840ab253b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:50.341410Z","signature_b64":"PC4lVuj2s+k5IIFDKyA58975akagM2ZRmDV1My0z6R3/+m+5rTunJxFBg1Py9HkpkIcKR1eMj6lxhJPCjSXPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c38e20634162e6d06f89ad75c7998f5f8f3e7ef3cfd41123518a336840ab253b","last_reissued_at":"2026-05-18T04:38:50.340936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:50.340936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2480","source_version":2,"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-18T04:38:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qb3Wk3zzQPay1DvO0xT6Jv7gqNenClvgRFQoF/6tStrZrYcUAp0vsvo/lTuXeLJix+E6Dq3TGOldJncujBvsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:26:37.830028Z"},"content_sha256":"cd4aed6f614a4614c7eb1c00c5b0554314fdcf8e27d87186ff67b119e8f3d1b1","schema_version":"1.0","event_id":"sha256:cd4aed6f614a4614c7eb1c00c5b0554314fdcf8e27d87186ff67b119e8f3d1b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YOHCAY2BMLTNA34JVV24PGMPL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Lucky labeling of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi, Esmael Mollaahmadi","submitted_at":"2010-07-15T05:56:55Z","abstract_excerpt":"Suppose the vertices of a graph $G$ were labeled arbitrarily by positive integers, and let $Sum(v)$ denote the sum of labels over all neighbors of vertex $v$. A labeling is lucky if the function $Sum$ is a proper coloring of $G$, that is, if we have $Sum(u) \\neq Sum(v)$ whenever $u$ and $v$ are adjacent. The least integer $k$ for which a graph $G$ has a lucky labeling from the set $\\lbrace 1, 2, ...,k\\rbrace$ is the lucky number of $G$, denoted by $\\eta(G)$. We will prove, for every graph $G$ other than $ K_{2} $, $\\frac{w}{n-w+1}\\leq\\eta (G) \\leq \\Delta^{2} $ and we present an algorithm for l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2480","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"},"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-18T04:38:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqd5XySb4/Xhl4jnShiCjrAO6rqqBy6rWSJO8P0Iis+YsiedhBs5xqfDeR2ksvI+sDGeJ6vqaDr3ZT5OePVgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:26:37.830380Z"},"content_sha256":"4c8d435e36cb3a54abbc1e9d7220a9a04f0bdda18639a3037b41cca2b64f8a18","schema_version":"1.0","event_id":"sha256:4c8d435e36cb3a54abbc1e9d7220a9a04f0bdda18639a3037b41cca2b64f8a18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOHCAY2BMLTNA34JVV24PGMPL6/bundle.json","state_url":"https://pith.science/pith/YOHCAY2BMLTNA34JVV24PGMPL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOHCAY2BMLTNA34JVV24PGMPL6/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-02T01:26:37Z","links":{"resolver":"https://pith.science/pith/YOHCAY2BMLTNA34JVV24PGMPL6","bundle":"https://pith.science/pith/YOHCAY2BMLTNA34JVV24PGMPL6/bundle.json","state":"https://pith.science/pith/YOHCAY2BMLTNA34JVV24PGMPL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOHCAY2BMLTNA34JVV24PGMPL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YOHCAY2BMLTNA34JVV24PGMPL6","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":"f7a49f5f4c68d8132c43bb13797e0f0869ac08c8806a6d6c89f9cc2f8ee61691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-15T05:56:55Z","title_canon_sha256":"d06f74482fea209c7cebf6e9e3bb9aa76915f26ae14d1cbeecf9f3d9e1653139"},"schema_version":"1.0","source":{"id":"1007.2480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2480","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2480v2","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2480","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"YOHCAY2BMLTN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YOHCAY2BMLTNA34J","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YOHCAY2B","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:4c8d435e36cb3a54abbc1e9d7220a9a04f0bdda18639a3037b41cca2b64f8a18","target":"graph","created_at":"2026-05-18T04:38:50Z","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":"Suppose the vertices of a graph $G$ were labeled arbitrarily by positive integers, and let $Sum(v)$ denote the sum of labels over all neighbors of vertex $v$. A labeling is lucky if the function $Sum$ is a proper coloring of $G$, that is, if we have $Sum(u) \\neq Sum(v)$ whenever $u$ and $v$ are adjacent. The least integer $k$ for which a graph $G$ has a lucky labeling from the set $\\lbrace 1, 2, ...,k\\rbrace$ is the lucky number of $G$, denoted by $\\eta(G)$. We will prove, for every graph $G$ other than $ K_{2} $, $\\frac{w}{n-w+1}\\leq\\eta (G) \\leq \\Delta^{2} $ and we present an algorithm for l","authors_text":"Ali Dehghan, Arash Ahadi, Esmael Mollaahmadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-15T05:56:55Z","title":"On the Lucky labeling of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2480","kind":"arxiv","version":2},"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:cd4aed6f614a4614c7eb1c00c5b0554314fdcf8e27d87186ff67b119e8f3d1b1","target":"record","created_at":"2026-05-18T04:38:50Z","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":"f7a49f5f4c68d8132c43bb13797e0f0869ac08c8806a6d6c89f9cc2f8ee61691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-15T05:56:55Z","title_canon_sha256":"d06f74482fea209c7cebf6e9e3bb9aa76915f26ae14d1cbeecf9f3d9e1653139"},"schema_version":"1.0","source":{"id":"1007.2480","kind":"arxiv","version":2}},"canonical_sha256":"c38e20634162e6d06f89ad75c7998f5f8f3e7ef3cfd41123518a336840ab253b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c38e20634162e6d06f89ad75c7998f5f8f3e7ef3cfd41123518a336840ab253b","first_computed_at":"2026-05-18T04:38:50.340936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:50.340936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PC4lVuj2s+k5IIFDKyA58975akagM2ZRmDV1My0z6R3/+m+5rTunJxFBg1Py9HkpkIcKR1eMj6lxhJPCjSXPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:50.341410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd4aed6f614a4614c7eb1c00c5b0554314fdcf8e27d87186ff67b119e8f3d1b1","sha256:4c8d435e36cb3a54abbc1e9d7220a9a04f0bdda18639a3037b41cca2b64f8a18"],"state_sha256":"8a54857588ad13ddb94d96c2529d37453621a103dbcf419345840065dfafcc6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mabuANCLj3Fhl3f+r3llP79CzjaSAIp0N1ChSN9648F6TPkz7tv2z080oyawwZ6gIMi+tJbFLQckse7cSHQSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:26:37.832332Z","bundle_sha256":"1d0024066db52ce6c33ef6fd8cee4e057351e81f71a0271c1df9fc099f43c6c5"}}