{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3WSVB53NFVLRPFL2T356CLQRUI","short_pith_number":"pith:3WSVB53N","schema_version":"1.0","canonical_sha256":"dda550f76d2d5717957a9efbe12e11a2340543d8bbec0ac5fae8032a8fce61f7","source":{"kind":"arxiv","id":"1504.02583","version":1},"attestation_state":"computed","paper":{"title":"A stronger bound for the strong chromatic index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Felix Joos, Henning Bruhn","submitted_at":"2015-04-10T08:23:31Z","abstract_excerpt":"We prove $\\chi_s'(G)\\leq 1.93 \\Delta(G)^2$ for graphs of sufficiently large maximum degree where $\\chi_s'(G)$ is the strong chromatic index of $G$. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where it is allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable."},"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":"1504.02583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T08:23:31Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"ddea428875216d6f26e70d23e92ee66744ad7bd092897a87924d5fd4b095a099","abstract_canon_sha256":"b5a90cdefd28ff4e12a6a20f86dec0137188e7495ca88427953cba14f86fc792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.302157Z","signature_b64":"r3XlOH0G4Y1VWO9XFn5ft/luEEPy0xiSbXmx5Vy5yL2/sGBaLtuFboaczdJv0Jcg2TUEIniP6NYDM8G1KQo8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dda550f76d2d5717957a9efbe12e11a2340543d8bbec0ac5fae8032a8fce61f7","last_reissued_at":"2026-05-18T02:19:07.301522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.301522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A stronger bound for the strong chromatic index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Felix Joos, Henning Bruhn","submitted_at":"2015-04-10T08:23:31Z","abstract_excerpt":"We prove $\\chi_s'(G)\\leq 1.93 \\Delta(G)^2$ for graphs of sufficiently large maximum degree where $\\chi_s'(G)$ is the strong chromatic index of $G$. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where it is allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02583","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":"1504.02583","created_at":"2026-05-18T02:19:07.301629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02583v1","created_at":"2026-05-18T02:19:07.301629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02583","created_at":"2026-05-18T02:19:07.301629+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WSVB53NFVLR","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WSVB53NFVLRPFL2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WSVB53N","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI","json":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI.json","graph_json":"https://pith.science/api/pith-number/3WSVB53NFVLRPFL2T356CLQRUI/graph.json","events_json":"https://pith.science/api/pith-number/3WSVB53NFVLRPFL2T356CLQRUI/events.json","paper":"https://pith.science/paper/3WSVB53N"},"agent_actions":{"view_html":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI","download_json":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI.json","view_paper":"https://pith.science/paper/3WSVB53N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02583&json=true","fetch_graph":"https://pith.science/api/pith-number/3WSVB53NFVLRPFL2T356CLQRUI/graph.json","fetch_events":"https://pith.science/api/pith-number/3WSVB53NFVLRPFL2T356CLQRUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI/action/storage_attestation","attest_author":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI/action/author_attestation","sign_citation":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI/action/citation_signature","submit_replication":"https://pith.science/pith/3WSVB53NFVLRPFL2T356CLQRUI/action/replication_record"}},"created_at":"2026-05-18T02:19:07.301629+00:00","updated_at":"2026-05-18T02:19:07.301629+00:00"}