{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VRXPV7PWJZIF2XZJN6VA2F275P","short_pith_number":"pith:VRXPV7PW","canonical_record":{"source":{"id":"1301.1992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T21:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"34a499afb1fcbee0f58def338b3c2856a1582b047b75b0a68e161d89561161ad","abstract_canon_sha256":"fe10caaf46fd369348aec161f4f558b58ae2dbf6ff8a2e1816c426c100b061a7"},"schema_version":"1.0"},"canonical_sha256":"ac6efafdf64e505d5f296faa0d175febd11a86d6b6ff8d4204ca7dd156c33b6f","source":{"kind":"arxiv","id":"1301.1992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1992","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1992v1","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1992","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"VRXPV7PWJZIF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VRXPV7PWJZIF2XZJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VRXPV7PW","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VRXPV7PWJZIF2XZJN6VA2F275P","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T21:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"34a499afb1fcbee0f58def338b3c2856a1582b047b75b0a68e161d89561161ad","abstract_canon_sha256":"fe10caaf46fd369348aec161f4f558b58ae2dbf6ff8a2e1816c426c100b061a7"},"schema_version":"1.0"},"canonical_sha256":"ac6efafdf64e505d5f296faa0d175febd11a86d6b6ff8d4204ca7dd156c33b6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:33.254522Z","signature_b64":"kcE7KPN4GlZHuc6UIea9PHTGWnAtuOXJAlhCgybhO+xUpl6IBXjylxue/euHsMWQ8BT0ssw7+axa7HjvWggTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac6efafdf64e505d5f296faa0d175febd11a86d6b6ff8d4204ca7dd156c33b6f","last_reissued_at":"2026-05-18T01:09:33.254075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:33.254075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1992","source_version":1,"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-18T01:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5F9J9CEPKrWKemHeg+cJ3lJ28Z7sr3R4wjvBqGjcHmNMkTer0bTWHinydFU2xPdyQravLtWYkLgUE091PGFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:39.999518Z"},"content_sha256":"5ba74b9ef9fd27da15dd91c0cb8dab216c993ef2b6cc55c942c968491181479e","schema_version":"1.0","event_id":"sha256:5ba74b9ef9fd27da15dd91c0cb8dab216c993ef2b6cc55c942c968491181479e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VRXPV7PWJZIF2XZJN6VA2F275P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong chromatic index of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaros{\\l}aw Grytczuk, Ma{\\l}gorzata \\'Sleszy\\'nska-Nowak, Micha{\\l} D\\k{e}bski","submitted_at":"2013-01-09T21:50:54Z","abstract_excerpt":"A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\\chi_{s}^{\\prime}(G)$, is the least number of colors in a strong edge coloring of $G$. In this note we prove that $\\chi_{s}^{\\prime}(G)\\leq (4k-1)\\Delta (G)-k(2k+1)+1$ for every $k$-degenerate graph $G$. This confirms the strong version of conjecture stated recently by Chang and Narayanan [3]. Our approach allows also to improve the upper bound from [3] for chordless graphs. We get that $% \\chi_{s}^{\\prime}(G)\\leq 4\\Delta -3$ for any chordless graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1992","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"},"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-18T01:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDyCbsXA8h/c1ruLZ+EunPf/QmHVBYjQkG7Txj8mSzN142h/yQFu6Cy0zNAR4NcufZSASX2sOOUEI/7t6rv4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:39.999865Z"},"content_sha256":"1bad2ea1262248e66ab05f75ad916b22de8fd759e3e35752a4ddf78b946ecf19","schema_version":"1.0","event_id":"sha256:1bad2ea1262248e66ab05f75ad916b22de8fd759e3e35752a4ddf78b946ecf19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRXPV7PWJZIF2XZJN6VA2F275P/bundle.json","state_url":"https://pith.science/pith/VRXPV7PWJZIF2XZJN6VA2F275P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRXPV7PWJZIF2XZJN6VA2F275P/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-11T10:51:40Z","links":{"resolver":"https://pith.science/pith/VRXPV7PWJZIF2XZJN6VA2F275P","bundle":"https://pith.science/pith/VRXPV7PWJZIF2XZJN6VA2F275P/bundle.json","state":"https://pith.science/pith/VRXPV7PWJZIF2XZJN6VA2F275P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRXPV7PWJZIF2XZJN6VA2F275P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VRXPV7PWJZIF2XZJN6VA2F275P","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":"fe10caaf46fd369348aec161f4f558b58ae2dbf6ff8a2e1816c426c100b061a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T21:50:54Z","title_canon_sha256":"34a499afb1fcbee0f58def338b3c2856a1582b047b75b0a68e161d89561161ad"},"schema_version":"1.0","source":{"id":"1301.1992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1992","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1992v1","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1992","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"VRXPV7PWJZIF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VRXPV7PWJZIF2XZJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VRXPV7PW","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:1bad2ea1262248e66ab05f75ad916b22de8fd759e3e35752a4ddf78b946ecf19","target":"graph","created_at":"2026-05-18T01:09:33Z","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":"A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\\chi_{s}^{\\prime}(G)$, is the least number of colors in a strong edge coloring of $G$. In this note we prove that $\\chi_{s}^{\\prime}(G)\\leq (4k-1)\\Delta (G)-k(2k+1)+1$ for every $k$-degenerate graph $G$. This confirms the strong version of conjecture stated recently by Chang and Narayanan [3]. Our approach allows also to improve the upper bound from [3] for chordless graphs. We get that $% \\chi_{s}^{\\prime}(G)\\leq 4\\Delta -3$ for any chordless graph","authors_text":"Jaros{\\l}aw Grytczuk, Ma{\\l}gorzata \\'Sleszy\\'nska-Nowak, Micha{\\l} D\\k{e}bski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T21:50:54Z","title":"Strong chromatic index of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1992","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:5ba74b9ef9fd27da15dd91c0cb8dab216c993ef2b6cc55c942c968491181479e","target":"record","created_at":"2026-05-18T01:09:33Z","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":"fe10caaf46fd369348aec161f4f558b58ae2dbf6ff8a2e1816c426c100b061a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T21:50:54Z","title_canon_sha256":"34a499afb1fcbee0f58def338b3c2856a1582b047b75b0a68e161d89561161ad"},"schema_version":"1.0","source":{"id":"1301.1992","kind":"arxiv","version":1}},"canonical_sha256":"ac6efafdf64e505d5f296faa0d175febd11a86d6b6ff8d4204ca7dd156c33b6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac6efafdf64e505d5f296faa0d175febd11a86d6b6ff8d4204ca7dd156c33b6f","first_computed_at":"2026-05-18T01:09:33.254075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:33.254075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcE7KPN4GlZHuc6UIea9PHTGWnAtuOXJAlhCgybhO+xUpl6IBXjylxue/euHsMWQ8BT0ssw7+axa7HjvWggTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:33.254522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba74b9ef9fd27da15dd91c0cb8dab216c993ef2b6cc55c942c968491181479e","sha256:1bad2ea1262248e66ab05f75ad916b22de8fd759e3e35752a4ddf78b946ecf19"],"state_sha256":"4bcaa1f358056dc4d3774041de67321b6b72b7f024092ad4287bbd6b0d325c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/xPqYyXDNIzrn0ftN0rCoLFQQFTkJzaO/dRakntl3x+K2wEN/zWh3spwkvFHKi33x8zkDSDKRl9el5PgD0/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:51:40.002448Z","bundle_sha256":"ff78804a87524523322470193662551b233a98417f897acbdc80fc6faa30ee21"}}