{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RXFGTGOSOIP2MHUUMKLKEB32J5","short_pith_number":"pith:RXFGTGOS","schema_version":"1.0","canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","source":{"kind":"arxiv","id":"1412.6803","version":2},"attestation_state":"computed","paper":{"title":"Incidence coloring of graphs with high maximum average degree","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'e Raspaud, Herv\\'e Hocquard, Marthe Bonamy, Samia Kerdjoudj","submitted_at":"2014-12-21T16:01:36Z","abstract_excerpt":"An incidence of an undirected graph G is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge of $G$ incident with $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent if one of the following holds: (i) $v = w$, (ii) $e = f$ or (iii) $vw = e$ or $f$. An incidence coloring of $G$ assigns a color to each incidence of $G$ in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama \\emph{et al.}~\\citep{ds05} proved that every graph with maximum average degree strictly less than $3$ can be incidence colored with $\\Delta+3$ colors. Recently, Bonamy \\emph{et al.}~\\cite"},"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":"1412.6803","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2014-12-21T16:01:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ecd4356505eae0c4eb6f379fbcd138044ff5ed6001b79bd1e93c52fa6cd1f22f","abstract_canon_sha256":"9e6684e06e5663bec33a52fec6781575ae55d845afd8123e956888954796c057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.740190Z","signature_b64":"ox8LjmIbWVjh77aiFye8SYts8TzrFgZLSzcjfRUyWqLPkwwnSMHCYreKCgzHoirVclEU+RW93RJ70nGfq6GpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","last_reissued_at":"2026-05-18T02:28:39.739692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.739692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incidence coloring of graphs with high maximum average degree","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'e Raspaud, Herv\\'e Hocquard, Marthe Bonamy, Samia Kerdjoudj","submitted_at":"2014-12-21T16:01:36Z","abstract_excerpt":"An incidence of an undirected graph G is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge of $G$ incident with $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent if one of the following holds: (i) $v = w$, (ii) $e = f$ or (iii) $vw = e$ or $f$. An incidence coloring of $G$ assigns a color to each incidence of $G$ in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama \\emph{et al.}~\\citep{ds05} proved that every graph with maximum average degree strictly less than $3$ can be incidence colored with $\\Delta+3$ colors. Recently, Bonamy \\emph{et al.}~\\cite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6803","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":"1412.6803","created_at":"2026-05-18T02:28:39.739780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6803v2","created_at":"2026-05-18T02:28:39.739780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6803","created_at":"2026-05-18T02:28:39.739780+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXFGTGOSOIP2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXFGTGOSOIP2MHUU","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXFGTGOS","created_at":"2026-05-18T12:28:46.137349+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/RXFGTGOSOIP2MHUUMKLKEB32J5","json":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5.json","graph_json":"https://pith.science/api/pith-number/RXFGTGOSOIP2MHUUMKLKEB32J5/graph.json","events_json":"https://pith.science/api/pith-number/RXFGTGOSOIP2MHUUMKLKEB32J5/events.json","paper":"https://pith.science/paper/RXFGTGOS"},"agent_actions":{"view_html":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5","download_json":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5.json","view_paper":"https://pith.science/paper/RXFGTGOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6803&json=true","fetch_graph":"https://pith.science/api/pith-number/RXFGTGOSOIP2MHUUMKLKEB32J5/graph.json","fetch_events":"https://pith.science/api/pith-number/RXFGTGOSOIP2MHUUMKLKEB32J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/action/storage_attestation","attest_author":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/action/author_attestation","sign_citation":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/action/citation_signature","submit_replication":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/action/replication_record"}},"created_at":"2026-05-18T02:28:39.739780+00:00","updated_at":"2026-05-18T02:28:39.739780+00:00"}