{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EJW5HBACEIYZW5I4FCKRHYUYU5","short_pith_number":"pith:EJW5HBAC","canonical_record":{"source":{"id":"1308.4197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-20T01:03:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0ee7c0b6c229f4217a3300823655581489ef560912fef238a45123b4eeff4405","abstract_canon_sha256":"cceeeca2491bb3eb52efa77a0f2ccb17e5616f76b6062fa30c40ef460537ce72"},"schema_version":"1.0"},"canonical_sha256":"226dd3840222319b751c289513e298a77b040de1c8ddd745d359432bfdfeb3dd","source":{"kind":"arxiv","id":"1308.4197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4197","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4197v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4197","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"EJW5HBACEIYZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJW5HBACEIYZW5I4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJW5HBAC","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EJW5HBACEIYZW5I4FCKRHYUYU5","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-20T01:03:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0ee7c0b6c229f4217a3300823655581489ef560912fef238a45123b4eeff4405","abstract_canon_sha256":"cceeeca2491bb3eb52efa77a0f2ccb17e5616f76b6062fa30c40ef460537ce72"},"schema_version":"1.0"},"canonical_sha256":"226dd3840222319b751c289513e298a77b040de1c8ddd745d359432bfdfeb3dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.475956Z","signature_b64":"2I0Jbs6Nm9No0U5D5uj/jVj53NldHX4IImV6/LvVpUSxhnpQxIJCPXPXp/rVhxP/XrJwPSpu5HZxTZ5uM/nqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226dd3840222319b751c289513e298a77b040de1c8ddd745d359432bfdfeb3dd","last_reissued_at":"2026-05-18T03:15:33.475175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.475175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4197","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lElLgyIFEU0qMpPuGUPvTUGMt9M2ueFRcc+id4co8KpdHDQielSTapvVpan5JzTJU8B0tXZAnszg4JpcSZfnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:06:28.469842Z"},"content_sha256":"57219e82de64f5ba506731701b96818b877174f7cdba0dc62970a137397752d6","schema_version":"1.0","event_id":"sha256:57219e82de64f5ba506731701b96818b877174f7cdba0dc62970a137397752d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EJW5HBACEIYZW5I4FCKRHYUYU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List coloring the square of sparse graphs with large degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Benjamin L\\'ev\\^eque, Marthe Bonamy","submitted_at":"2013-08-20T01:03:33Z","abstract_excerpt":"We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors.\n  Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree $\\Delta$ are list $(\\Delta+1)$-colorable, while the squares of some planar graphs of girth six and arbitrarily large maximum degree are not. By Euler's Formula, planar graphs of girth at least $6$ are of maximum average "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4197","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdnxei5SSgtk+q0+SZkB/gLSY67ktg9NqTnnPyzRgr0o+x7cNOPe0V8Y8eMFO1l/uL242ZlhNgr6mOfxUWnkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:06:28.470197Z"},"content_sha256":"841496e095bbbc8e0502ae8794a12583e634cc78b0221a30175e08f872b48e17","schema_version":"1.0","event_id":"sha256:841496e095bbbc8e0502ae8794a12583e634cc78b0221a30175e08f872b48e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/bundle.json","state_url":"https://pith.science/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/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-04T10:06:28Z","links":{"resolver":"https://pith.science/pith/EJW5HBACEIYZW5I4FCKRHYUYU5","bundle":"https://pith.science/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/bundle.json","state":"https://pith.science/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJW5HBACEIYZW5I4FCKRHYUYU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EJW5HBACEIYZW5I4FCKRHYUYU5","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":"cceeeca2491bb3eb52efa77a0f2ccb17e5616f76b6062fa30c40ef460537ce72","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-20T01:03:33Z","title_canon_sha256":"0ee7c0b6c229f4217a3300823655581489ef560912fef238a45123b4eeff4405"},"schema_version":"1.0","source":{"id":"1308.4197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4197","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4197v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4197","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"EJW5HBACEIYZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJW5HBACEIYZW5I4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJW5HBAC","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:841496e095bbbc8e0502ae8794a12583e634cc78b0221a30175e08f872b48e17","target":"graph","created_at":"2026-05-18T03:15: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":"We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors.\n  Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree $\\Delta$ are list $(\\Delta+1)$-colorable, while the squares of some planar graphs of girth six and arbitrarily large maximum degree are not. By Euler's Formula, planar graphs of girth at least $6$ are of maximum average ","authors_text":"Alexandre Pinlou, Benjamin L\\'ev\\^eque, Marthe Bonamy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-20T01:03:33Z","title":"List coloring the square of sparse graphs with large degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4197","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:57219e82de64f5ba506731701b96818b877174f7cdba0dc62970a137397752d6","target":"record","created_at":"2026-05-18T03:15: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":"cceeeca2491bb3eb52efa77a0f2ccb17e5616f76b6062fa30c40ef460537ce72","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-20T01:03:33Z","title_canon_sha256":"0ee7c0b6c229f4217a3300823655581489ef560912fef238a45123b4eeff4405"},"schema_version":"1.0","source":{"id":"1308.4197","kind":"arxiv","version":1}},"canonical_sha256":"226dd3840222319b751c289513e298a77b040de1c8ddd745d359432bfdfeb3dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226dd3840222319b751c289513e298a77b040de1c8ddd745d359432bfdfeb3dd","first_computed_at":"2026-05-18T03:15:33.475175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:33.475175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2I0Jbs6Nm9No0U5D5uj/jVj53NldHX4IImV6/LvVpUSxhnpQxIJCPXPXp/rVhxP/XrJwPSpu5HZxTZ5uM/nqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:33.475956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57219e82de64f5ba506731701b96818b877174f7cdba0dc62970a137397752d6","sha256:841496e095bbbc8e0502ae8794a12583e634cc78b0221a30175e08f872b48e17"],"state_sha256":"88b76a3e199421c7592f8513d1de7ebd4a1068c87beb9b14d2f85ea86d9b1e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uePpEFuMZzt2N+8VvNbo/bZ0F/vCu/RcTeGw59OmxAPhABKZHGru96pxemyVmnVZy+RXoqfh2xRIhCyJ+6bFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:06:28.472303Z","bundle_sha256":"37cce0e6c55655b7384b77bd6d7847dd729cf0a2d7fa012e58341baa9234b777"}}