{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SAET4QABVCTSVKATG4SASNXX2T","short_pith_number":"pith:SAET4QAB","schema_version":"1.0","canonical_sha256":"90093e4001a8a72aa81337240936f7d4e949324bbe8f18a153973a7411bb3788","source":{"kind":"arxiv","id":"1309.6069","version":1},"attestation_state":"computed","paper":{"title":"Beyond the Shannon's Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, {\\L}ukasz Kowalik, Micha{\\l} Farnik","submitted_at":"2013-09-24T07:51:56Z","abstract_excerpt":"Let $G=(V,E)$ be a multigraph of maximum degree $\\Delta$. The edges of $G$ can be colored with at most $\\frac{3}{2}\\Delta$ colors by Shannon's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\\Delta$ colors.\n  Shannon's Theorem gives a bound of $\\frac{\\Delta}{\\lfloor\\frac{3}{2}\\Delta\\rfloor}|E|$. However, for $\\Delta=3$, Kami\\'{n}ski and Kowalik [SWAT'10] showed that there is a 3-edge-colorable subgraph of size at least $\\frac{7}{9}|E|$, unless $G$ has a connected component isomorphic to $K_3+e$ (a $K_3$ with an arbitrary edge doubled). Here we extend th"},"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":"1309.6069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T07:51:56Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"683032992ae4f10270d1aeb31d774e8d92897910efe9c90fa5122c3ac007be0d","abstract_canon_sha256":"22414df5fe84ab976e9e028973ec1a93563d3555ebf50b0e6ba882748d4d0ccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:24.122838Z","signature_b64":"QXjFrNPYkMohv+0dtRQhStSlDSRPKjf4b0QGPmGAZkolmYFnlxNk1XkZrp2rr9ujZKewb+eT6vUNmSuE8dHaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90093e4001a8a72aa81337240936f7d4e949324bbe8f18a153973a7411bb3788","last_reissued_at":"2026-05-18T03:12:24.122072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:24.122072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond the Shannon's Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, {\\L}ukasz Kowalik, Micha{\\l} Farnik","submitted_at":"2013-09-24T07:51:56Z","abstract_excerpt":"Let $G=(V,E)$ be a multigraph of maximum degree $\\Delta$. The edges of $G$ can be colored with at most $\\frac{3}{2}\\Delta$ colors by Shannon's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\\Delta$ colors.\n  Shannon's Theorem gives a bound of $\\frac{\\Delta}{\\lfloor\\frac{3}{2}\\Delta\\rfloor}|E|$. However, for $\\Delta=3$, Kami\\'{n}ski and Kowalik [SWAT'10] showed that there is a 3-edge-colorable subgraph of size at least $\\frac{7}{9}|E|$, unless $G$ has a connected component isomorphic to $K_3+e$ (a $K_3$ with an arbitrary edge doubled). Here we extend th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6069","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":"1309.6069","created_at":"2026-05-18T03:12:24.122217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6069v1","created_at":"2026-05-18T03:12:24.122217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6069","created_at":"2026-05-18T03:12:24.122217+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAET4QABVCTS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAET4QABVCTSVKAT","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAET4QAB","created_at":"2026-05-18T12:27:59.945178+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/SAET4QABVCTSVKATG4SASNXX2T","json":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T.json","graph_json":"https://pith.science/api/pith-number/SAET4QABVCTSVKATG4SASNXX2T/graph.json","events_json":"https://pith.science/api/pith-number/SAET4QABVCTSVKATG4SASNXX2T/events.json","paper":"https://pith.science/paper/SAET4QAB"},"agent_actions":{"view_html":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T","download_json":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T.json","view_paper":"https://pith.science/paper/SAET4QAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6069&json=true","fetch_graph":"https://pith.science/api/pith-number/SAET4QABVCTSVKATG4SASNXX2T/graph.json","fetch_events":"https://pith.science/api/pith-number/SAET4QABVCTSVKATG4SASNXX2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T/action/storage_attestation","attest_author":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T/action/author_attestation","sign_citation":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T/action/citation_signature","submit_replication":"https://pith.science/pith/SAET4QABVCTSVKATG4SASNXX2T/action/replication_record"}},"created_at":"2026-05-18T03:12:24.122217+00:00","updated_at":"2026-05-18T03:12:24.122217+00:00"}