{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CIKSEA2RYD73NSUZZAC3YCALHR","short_pith_number":"pith:CIKSEA2R","schema_version":"1.0","canonical_sha256":"1215220351c0ffb6ca99c805bc080b3c6595af4fdefae1bf09aee3eb092799e8","source":{"kind":"arxiv","id":"1306.0182","version":2},"attestation_state":"computed","paper":{"title":"The inapproximability for the (0,1)-additive number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi","submitted_at":"2013-06-02T07:56:50Z","abstract_excerpt":"An\n  {\\it additive labeling} of a graph $G$ is a function $ \\ell :V(G) \\rightarrow\\mathbb{N}$, such that for every two adjacent vertices $ v $ and $ u$ of $ G $, $ \\sum_{w \\sim v}\\ell(w)\\neq \\sum_{w \\sim u}\\ell(w) $ ($ x \\sim y $ means that $ x $ is joined to $y$). The {\\it additive number} of $ G $, denoted by $\\eta(G)$, is the minimum number $k $ such that $ G $ has a additive labeling $ \\ell :V(G) \\rightarrow \\mathbb{N}_k$. The {\\it additive choosability} of a graph $G$, denoted by $\\eta_{\\ell}(G) $, is the smallest number $k$ such that $G$ has an additive labeling for any assignment of lis"},"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":"1306.0182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-02T07:56:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"65c45c304dd966dd2a14b255e44b50fceadd894d1019ba5ef60f1d88efb31f59","abstract_canon_sha256":"a9bd7239cd4c36c85586e3539e87d44946aadba2ad4b36c1bffe8fed35422f19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:08.817614Z","signature_b64":"wRoxYAp0jZdhQQrgW/bWp+CEJo9w6NUvuxUUocG8N5WZeqBfxPkaLdwkv4++js4iKP/+VHSwG9aIbplfjqk+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1215220351c0ffb6ca99c805bc080b3c6595af4fdefae1bf09aee3eb092799e8","last_reissued_at":"2026-05-18T01:11:08.817156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:08.817156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The inapproximability for the (0,1)-additive number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi","submitted_at":"2013-06-02T07:56:50Z","abstract_excerpt":"An\n  {\\it additive labeling} of a graph $G$ is a function $ \\ell :V(G) \\rightarrow\\mathbb{N}$, such that for every two adjacent vertices $ v $ and $ u$ of $ G $, $ \\sum_{w \\sim v}\\ell(w)\\neq \\sum_{w \\sim u}\\ell(w) $ ($ x \\sim y $ means that $ x $ is joined to $y$). The {\\it additive number} of $ G $, denoted by $\\eta(G)$, is the minimum number $k $ such that $ G $ has a additive labeling $ \\ell :V(G) \\rightarrow \\mathbb{N}_k$. The {\\it additive choosability} of a graph $G$, denoted by $\\eta_{\\ell}(G) $, is the smallest number $k$ such that $G$ has an additive labeling for any assignment of lis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0182","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":"1306.0182","created_at":"2026-05-18T01:11:08.817221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0182v2","created_at":"2026-05-18T01:11:08.817221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0182","created_at":"2026-05-18T01:11:08.817221+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIKSEA2RYD73","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIKSEA2RYD73NSUZ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIKSEA2R","created_at":"2026-05-18T12:27:40.988391+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/CIKSEA2RYD73NSUZZAC3YCALHR","json":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR.json","graph_json":"https://pith.science/api/pith-number/CIKSEA2RYD73NSUZZAC3YCALHR/graph.json","events_json":"https://pith.science/api/pith-number/CIKSEA2RYD73NSUZZAC3YCALHR/events.json","paper":"https://pith.science/paper/CIKSEA2R"},"agent_actions":{"view_html":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR","download_json":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR.json","view_paper":"https://pith.science/paper/CIKSEA2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0182&json=true","fetch_graph":"https://pith.science/api/pith-number/CIKSEA2RYD73NSUZZAC3YCALHR/graph.json","fetch_events":"https://pith.science/api/pith-number/CIKSEA2RYD73NSUZZAC3YCALHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR/action/storage_attestation","attest_author":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR/action/author_attestation","sign_citation":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR/action/citation_signature","submit_replication":"https://pith.science/pith/CIKSEA2RYD73NSUZZAC3YCALHR/action/replication_record"}},"created_at":"2026-05-18T01:11:08.817221+00:00","updated_at":"2026-05-18T01:11:08.817221+00:00"}