{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BA4CSCI7CQIEFRTEAYRKUDOWWH","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":"0d0d986fb774d9176f3012694040bd3e3ac18217c1c72eb6693f536c6cfb35b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-11T07:10:07Z","title_canon_sha256":"1159c6a5d35b629e1e20ed52ad48d9e3ae0cf16d0316929658cfdf819ff331d7"},"schema_version":"1.0","source":{"id":"1208.2315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2315","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2315v1","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2315","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"BA4CSCI7CQIE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BA4CSCI7CQIEFRTE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BA4CSCI7","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:81224a53fc8c41f22dba1fce8a79268bfacfc4a9f07cf0fa14de931ed1fe32bf","target":"graph","created_at":"2026-05-18T03:48:58Z","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":"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","authors_text":"Ko-Wei Lih, Lianzhu Zhang, Weifan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-11T07:10:07Z","title":"An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2315","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:dfe8c757ec6fbc3148f776cf2ff47ce1da2eb3f4b2cd7d33c3ce8d5ad202ff23","target":"record","created_at":"2026-05-18T03:48:58Z","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":"0d0d986fb774d9176f3012694040bd3e3ac18217c1c72eb6693f536c6cfb35b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-11T07:10:07Z","title_canon_sha256":"1159c6a5d35b629e1e20ed52ad48d9e3ae0cf16d0316929658cfdf819ff331d7"},"schema_version":"1.0","source":{"id":"1208.2315","kind":"arxiv","version":1}},"canonical_sha256":"083829091f141042c6640622aa0dd6b1eb72b0f5f03a2ec25cf2c1ef839bb594","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"083829091f141042c6640622aa0dd6b1eb72b0f5f03a2ec25cf2c1ef839bb594","first_computed_at":"2026-05-18T03:48:58.212066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:58.212066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLiWd3YybLqTqNaccM+bxDu8UaXq/obTaLbCSM4YwhW04UPWe9bEC2ZFbxptraguXsM6gyqPrf71L8+LHb0UBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:58.212614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfe8c757ec6fbc3148f776cf2ff47ce1da2eb3f4b2cd7d33c3ce8d5ad202ff23","sha256:81224a53fc8c41f22dba1fce8a79268bfacfc4a9f07cf0fa14de931ed1fe32bf"],"state_sha256":"246f317337a4fd075e2135b0e3a044a4b63bfee192b580ed35ba1a27deb0b6fc"}