{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RXFGTGOSOIP2MHUUMKLKEB32J5","short_pith_number":"pith:RXFGTGOS","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"},"canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","source":{"kind":"arxiv","id":"1412.6803","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6803","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6803v2","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6803","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"RXFGTGOSOIP2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXFGTGOSOIP2MHUU","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXFGTGOS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RXFGTGOSOIP2MHUUMKLKEB32J5","target":"record","payload":{"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"},"canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","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"},"source_kind":"arxiv","source_id":"1412.6803","source_version":2,"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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isNKXMFu3qjtp+KUj7fdeemdjpBN5hgAR73/rRPWxvfNak6suFIzAcTH1jrY+KaGCFdwZzsAcV17/y1CLsD9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:04:43.135649Z"},"content_sha256":"de1903622dd4fff4211d8913f5f990b11c411223e460567851a9d377aae0ef1b","schema_version":"1.0","event_id":"sha256:de1903622dd4fff4211d8913f5f990b11c411223e460567851a9d377aae0ef1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RXFGTGOSOIP2MHUUMKLKEB32J5","target":"graph","payload":{"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"},"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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhfxW+uhcaj+m233ci/aVV3KJoU5549pggH5dky5sqBVIGDUlpkR0pKj5DRMbmQH87S3KA+u/UurzLjyIeEqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:04:43.135992Z"},"content_sha256":"7b621202eb4634e7886fd6b631d286239dfd995393875045feba49f30b364b8a","schema_version":"1.0","event_id":"sha256:7b621202eb4634e7886fd6b631d286239dfd995393875045feba49f30b364b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/bundle.json","state_url":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/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-05-28T11:04:43Z","links":{"resolver":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5","bundle":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/bundle.json","state":"https://pith.science/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXFGTGOSOIP2MHUUMKLKEB32J5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RXFGTGOSOIP2MHUUMKLKEB32J5","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":"9e6684e06e5663bec33a52fec6781575ae55d845afd8123e956888954796c057","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2014-12-21T16:01:36Z","title_canon_sha256":"ecd4356505eae0c4eb6f379fbcd138044ff5ed6001b79bd1e93c52fa6cd1f22f"},"schema_version":"1.0","source":{"id":"1412.6803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6803","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6803v2","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6803","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"RXFGTGOSOIP2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXFGTGOSOIP2MHUU","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXFGTGOS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:7b621202eb4634e7886fd6b631d286239dfd995393875045feba49f30b364b8a","target":"graph","created_at":"2026-05-18T02:28:39Z","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":"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","authors_text":"Andr\\'e Raspaud, Herv\\'e Hocquard, Marthe Bonamy, Samia Kerdjoudj","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2014-12-21T16:01:36Z","title":"Incidence coloring of graphs with high maximum average degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6803","kind":"arxiv","version":2},"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:de1903622dd4fff4211d8913f5f990b11c411223e460567851a9d377aae0ef1b","target":"record","created_at":"2026-05-18T02:28:39Z","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":"9e6684e06e5663bec33a52fec6781575ae55d845afd8123e956888954796c057","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2014-12-21T16:01:36Z","title_canon_sha256":"ecd4356505eae0c4eb6f379fbcd138044ff5ed6001b79bd1e93c52fa6cd1f22f"},"schema_version":"1.0","source":{"id":"1412.6803","kind":"arxiv","version":2}},"canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dca6999d2721fa61e946296a2077a4f52cb59d5cb6f48e9091f45c1deb6e6c1","first_computed_at":"2026-05-18T02:28:39.739692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:39.739692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ox8LjmIbWVjh77aiFye8SYts8TzrFgZLSzcjfRUyWqLPkwwnSMHCYreKCgzHoirVclEU+RW93RJ70nGfq6GpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:39.740190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de1903622dd4fff4211d8913f5f990b11c411223e460567851a9d377aae0ef1b","sha256:7b621202eb4634e7886fd6b631d286239dfd995393875045feba49f30b364b8a"],"state_sha256":"4cc73370213b8fc68730396b3421ec08bcf93febce5b173060b70fcb25d12297"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSaxxJ0HLJU0PzGVFHnVcEEvAoPgaZsH68e7m4raUGdd/9fqy10P/pEHb4ziMaFtlsQ9W/6vQUSO261DAeytAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:04:43.138075Z","bundle_sha256":"9793ac110f1b2a2408585b9be882682666f39d0793b3e985929ff7e1382e2fe9"}}