{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3A35LMRVIBPPCODJES32T64HH6","short_pith_number":"pith:3A35LMRV","canonical_record":{"source":{"id":"1401.8023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-30T23:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"f11ba13eafc93a3bbf055ac634e976359c30ccb046a2e37c7bbecd8529df5d71","abstract_canon_sha256":"8a52afd854b8ca3dcee300e15010e91e392431acf966ab7a9a533e1cac66fb42"},"schema_version":"1.0"},"canonical_sha256":"d837d5b235405ef1386924b7a9fb873fbbabe0bcbf1850f62a46b8f13759296b","source":{"kind":"arxiv","id":"1401.8023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8023","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8023v1","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8023","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"3A35LMRVIBPP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3A35LMRVIBPPCODJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3A35LMRV","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3A35LMRVIBPPCODJES32T64HH6","target":"record","payload":{"canonical_record":{"source":{"id":"1401.8023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-30T23:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"f11ba13eafc93a3bbf055ac634e976359c30ccb046a2e37c7bbecd8529df5d71","abstract_canon_sha256":"8a52afd854b8ca3dcee300e15010e91e392431acf966ab7a9a533e1cac66fb42"},"schema_version":"1.0"},"canonical_sha256":"d837d5b235405ef1386924b7a9fb873fbbabe0bcbf1850f62a46b8f13759296b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:36.452809Z","signature_b64":"fWR0hNvwN+cQu6RxqhyZOiH6wjK2T93k2RkthrMEsqexD8Abk3yUVBPvlBIpywPmmjm04O2i1mO2ytpu6+X1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d837d5b235405ef1386924b7a9fb873fbbabe0bcbf1850f62a46b8f13759296b","last_reissued_at":"2026-05-18T03:00:36.451943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:36.451943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.8023","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:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/UCR76yxPtkljwgf+OCtuDVl0RmqH9P0h2HtKFu1oOhuT/xLVwjN+a92qlaopnsWY4bMxnY2a5wXxqgg4LbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:28:10.285947Z"},"content_sha256":"11ae1b1a905a067fadc125356f18cff6ac6b11afebe304a2a337c895bc4938ec","schema_version":"1.0","event_id":"sha256:11ae1b1a905a067fadc125356f18cff6ac6b11afebe304a2a337c895bc4938ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3A35LMRVIBPPCODJES32T64HH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Brooks' Vertex-Colouring Theorem in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Bradley Baetz, David R. Wood","submitted_at":"2014-01-30T23:11:08Z","abstract_excerpt":"Brooks' Theorem [R. L. Brooks, On Colouring the Nodes of a Network, Proc. Cambridge Philos. Soc.} 37:194-197, 1941] states that every graph $G$ with maximum degree $\\Delta$, has a vertex-colouring with $\\Delta$ colours, unless $G$ is a complete graph or an odd cycle, in which case $\\Delta+1$ colours are required. Lov\\'asz [L. Lov\\'asz, Three short proofs in graph theory, J. Combin. Theory Ser. 19:269-271, 1975] gives an algorithmic proof of Brooks' Theorem. Unfortunately this proof is missing important details and it is thus unclear whether it leads to a linear time algorithm. In this paper we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8023","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:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aLbHf+UjSa/tGawetBgm+YhfVuP5K56V564FhM9Un8M0kDs8OohO3N3jHDUX/ewyg4ikGFKDIKYCY1JHYDaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:28:10.286664Z"},"content_sha256":"a650b992c31c52f150a49e1eee6a0153d9879dcf9ade28158a55ca21cf73cc53","schema_version":"1.0","event_id":"sha256:a650b992c31c52f150a49e1eee6a0153d9879dcf9ade28158a55ca21cf73cc53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A35LMRVIBPPCODJES32T64HH6/bundle.json","state_url":"https://pith.science/pith/3A35LMRVIBPPCODJES32T64HH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A35LMRVIBPPCODJES32T64HH6/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-29T15:28:10Z","links":{"resolver":"https://pith.science/pith/3A35LMRVIBPPCODJES32T64HH6","bundle":"https://pith.science/pith/3A35LMRVIBPPCODJES32T64HH6/bundle.json","state":"https://pith.science/pith/3A35LMRVIBPPCODJES32T64HH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A35LMRVIBPPCODJES32T64HH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3A35LMRVIBPPCODJES32T64HH6","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":"8a52afd854b8ca3dcee300e15010e91e392431acf966ab7a9a533e1cac66fb42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-30T23:11:08Z","title_canon_sha256":"f11ba13eafc93a3bbf055ac634e976359c30ccb046a2e37c7bbecd8529df5d71"},"schema_version":"1.0","source":{"id":"1401.8023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8023","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8023v1","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8023","created_at":"2026-05-18T03:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"3A35LMRVIBPP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3A35LMRVIBPPCODJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3A35LMRV","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:a650b992c31c52f150a49e1eee6a0153d9879dcf9ade28158a55ca21cf73cc53","target":"graph","created_at":"2026-05-18T03:00:36Z","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":"Brooks' Theorem [R. L. Brooks, On Colouring the Nodes of a Network, Proc. Cambridge Philos. Soc.} 37:194-197, 1941] states that every graph $G$ with maximum degree $\\Delta$, has a vertex-colouring with $\\Delta$ colours, unless $G$ is a complete graph or an odd cycle, in which case $\\Delta+1$ colours are required. Lov\\'asz [L. Lov\\'asz, Three short proofs in graph theory, J. Combin. Theory Ser. 19:269-271, 1975] gives an algorithmic proof of Brooks' Theorem. Unfortunately this proof is missing important details and it is thus unclear whether it leads to a linear time algorithm. In this paper we","authors_text":"Bradley Baetz, David R. Wood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-30T23:11:08Z","title":"Brooks' Vertex-Colouring Theorem in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8023","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:11ae1b1a905a067fadc125356f18cff6ac6b11afebe304a2a337c895bc4938ec","target":"record","created_at":"2026-05-18T03:00:36Z","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":"8a52afd854b8ca3dcee300e15010e91e392431acf966ab7a9a533e1cac66fb42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-30T23:11:08Z","title_canon_sha256":"f11ba13eafc93a3bbf055ac634e976359c30ccb046a2e37c7bbecd8529df5d71"},"schema_version":"1.0","source":{"id":"1401.8023","kind":"arxiv","version":1}},"canonical_sha256":"d837d5b235405ef1386924b7a9fb873fbbabe0bcbf1850f62a46b8f13759296b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d837d5b235405ef1386924b7a9fb873fbbabe0bcbf1850f62a46b8f13759296b","first_computed_at":"2026-05-18T03:00:36.451943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:36.451943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWR0hNvwN+cQu6RxqhyZOiH6wjK2T93k2RkthrMEsqexD8Abk3yUVBPvlBIpywPmmjm04O2i1mO2ytpu6+X1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:36.452809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.8023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11ae1b1a905a067fadc125356f18cff6ac6b11afebe304a2a337c895bc4938ec","sha256:a650b992c31c52f150a49e1eee6a0153d9879dcf9ade28158a55ca21cf73cc53"],"state_sha256":"1119a4b1e41e30c87866cc7c3f9186f53c686b9873a828681d5d1d69a250267a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grPEZiFR1hrPPmgb0OCnvNsUydzfc9B2xTbXAChjJcF0R73wnq2KTbj56BMEz5qszpMrtjGJcGBpEGJOpnWkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:28:10.290162Z","bundle_sha256":"7afe12543720b4fdc6e00515e95ef61ec3fadef0aa523d133a1ac1a0c4a682a5"}}