{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WQ4XVQ6ZEWJYICKADQ3HR76UFY","short_pith_number":"pith:WQ4XVQ6Z","schema_version":"1.0","canonical_sha256":"b4397ac3d925938409401c3678ffd42e285f1d0098c72524b87960badaeb1a4f","source":{"kind":"arxiv","id":"1611.02341","version":2},"attestation_state":"computed","paper":{"title":"New bounds for locally irregular chromatic index of bipartite and subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Jakub Przyby{\\l}o, Roman Sot\\'ak","submitted_at":"2016-11-07T23:34:05Z","abstract_excerpt":"A graph is \\textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \\textit{locally irregular edge-coloring} of a graph $G$ is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that $3$ colors suffice for a locally irregular edge-coloring. Recently, Bensmail et al. (Bensmail, Merker, Thomassen: Decomposing graphs into a constant number of locally irregular subgraphs, {\\em European J. Combin.}, 60:124--134, 2017) settled the first constant upper bound for the proble"},"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":"1611.02341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T23:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"41e5277e3fd533ae6df578d7959d1c4cdf17878d85c0c0a2ad7e4503e8b00bfe","abstract_canon_sha256":"cc0461600d600e488b94d3c1b3e923e48a3def92dd18b21957b64378fa612190"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.506815Z","signature_b64":"RMPudqP3kRw/UVFTc/Q+aYGp1iFmsLF/8oQMwmfnEnUijCvy7rE+UVnHnzk7ClvyziHvCNUmYdH15pM6Ur5QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4397ac3d925938409401c3678ffd42e285f1d0098c72524b87960badaeb1a4f","last_reissued_at":"2026-05-18T00:12:11.506134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.506134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for locally irregular chromatic index of bipartite and subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Jakub Przyby{\\l}o, Roman Sot\\'ak","submitted_at":"2016-11-07T23:34:05Z","abstract_excerpt":"A graph is \\textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \\textit{locally irregular edge-coloring} of a graph $G$ is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that $3$ colors suffice for a locally irregular edge-coloring. Recently, Bensmail et al. (Bensmail, Merker, Thomassen: Decomposing graphs into a constant number of locally irregular subgraphs, {\\em European J. Combin.}, 60:124--134, 2017) settled the first constant upper bound for the proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02341","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":"1611.02341","created_at":"2026-05-18T00:12:11.506236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02341v2","created_at":"2026-05-18T00:12:11.506236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02341","created_at":"2026-05-18T00:12:11.506236+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ4XVQ6ZEWJY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ4XVQ6ZEWJYICKA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ4XVQ6Z","created_at":"2026-05-18T12:30:51.357362+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/WQ4XVQ6ZEWJYICKADQ3HR76UFY","json":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY.json","graph_json":"https://pith.science/api/pith-number/WQ4XVQ6ZEWJYICKADQ3HR76UFY/graph.json","events_json":"https://pith.science/api/pith-number/WQ4XVQ6ZEWJYICKADQ3HR76UFY/events.json","paper":"https://pith.science/paper/WQ4XVQ6Z"},"agent_actions":{"view_html":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY","download_json":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY.json","view_paper":"https://pith.science/paper/WQ4XVQ6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02341&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ4XVQ6ZEWJYICKADQ3HR76UFY/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ4XVQ6ZEWJYICKADQ3HR76UFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY/action/storage_attestation","attest_author":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY/action/author_attestation","sign_citation":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY/action/citation_signature","submit_replication":"https://pith.science/pith/WQ4XVQ6ZEWJYICKADQ3HR76UFY/action/replication_record"}},"created_at":"2026-05-18T00:12:11.506236+00:00","updated_at":"2026-05-18T00:12:11.506236+00:00"}