{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BA4CSCI7CQIEFRTEAYRKUDOWWH","short_pith_number":"pith:BA4CSCI7","schema_version":"1.0","canonical_sha256":"083829091f141042c6640622aa0dd6b1eb72b0f5f03a2ec25cf2c1ef839bb594","source":{"kind":"arxiv","id":"1208.2315","version":1},"attestation_state":"computed","paper":{"title":"An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ko-Wei Lih, Lianzhu Zhang, Weifan Wang","submitted_at":"2012-08-11T07:10:07Z","abstract_excerpt":"An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing coloring of G is denoted by $\\chi'_a(G)$. In this paper, we prove that $\\chi_a'(G)$ <= 5($\\Delta+2$)/2 for any graph G having maximum degree $\\Delta$ and no isolated edges. This improves a result in [S. Akbari, H. Bidkhori, N. Nosrati, r-Strong edge colorings of graphs, Discrete Math. 306 (2006), 3005-3010], which states that $\\chi_a'(G)$ <= 3$\\Delta$ fo"},"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":"1208.2315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-11T07:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"1159c6a5d35b629e1e20ed52ad48d9e3ae0cf16d0316929658cfdf819ff331d7","abstract_canon_sha256":"0d0d986fb774d9176f3012694040bd3e3ac18217c1c72eb6693f536c6cfb35b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:58.212614Z","signature_b64":"GLiWd3YybLqTqNaccM+bxDu8UaXq/obTaLbCSM4YwhW04UPWe9bEC2ZFbxptraguXsM6gyqPrf71L8+LHb0UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"083829091f141042c6640622aa0dd6b1eb72b0f5f03a2ec25cf2c1ef839bb594","last_reissued_at":"2026-05-18T03:48:58.212066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:58.212066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ko-Wei Lih, Lianzhu Zhang, Weifan Wang","submitted_at":"2012-08-11T07:10:07Z","abstract_excerpt":"An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing coloring of G is denoted by $\\chi'_a(G)$. In this paper, we prove that $\\chi_a'(G)$ <= 5($\\Delta+2$)/2 for any graph G having maximum degree $\\Delta$ and no isolated edges. This improves a result in [S. Akbari, H. Bidkhori, N. Nosrati, r-Strong edge colorings of graphs, Discrete Math. 306 (2006), 3005-3010], which states that $\\chi_a'(G)$ <= 3$\\Delta$ fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2315","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":"1208.2315","created_at":"2026-05-18T03:48:58.212139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2315v1","created_at":"2026-05-18T03:48:58.212139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2315","created_at":"2026-05-18T03:48:58.212139+00:00"},{"alias_kind":"pith_short_12","alias_value":"BA4CSCI7CQIE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BA4CSCI7CQIEFRTE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BA4CSCI7","created_at":"2026-05-18T12:26:58.693483+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/BA4CSCI7CQIEFRTEAYRKUDOWWH","json":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH.json","graph_json":"https://pith.science/api/pith-number/BA4CSCI7CQIEFRTEAYRKUDOWWH/graph.json","events_json":"https://pith.science/api/pith-number/BA4CSCI7CQIEFRTEAYRKUDOWWH/events.json","paper":"https://pith.science/paper/BA4CSCI7"},"agent_actions":{"view_html":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH","download_json":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH.json","view_paper":"https://pith.science/paper/BA4CSCI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2315&json=true","fetch_graph":"https://pith.science/api/pith-number/BA4CSCI7CQIEFRTEAYRKUDOWWH/graph.json","fetch_events":"https://pith.science/api/pith-number/BA4CSCI7CQIEFRTEAYRKUDOWWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH/action/storage_attestation","attest_author":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH/action/author_attestation","sign_citation":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH/action/citation_signature","submit_replication":"https://pith.science/pith/BA4CSCI7CQIEFRTEAYRKUDOWWH/action/replication_record"}},"created_at":"2026-05-18T03:48:58.212139+00:00","updated_at":"2026-05-18T03:48:58.212139+00:00"}