{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FJBKNMTFEJZSI6VAHZ65WHXRI3","short_pith_number":"pith:FJBKNMTF","canonical_record":{"source":{"id":"1601.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-03T07:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"e22b96c0e32bf187aaa93ee60dc396bf5c90e1e83cf6e51d0403071c8b328691","abstract_canon_sha256":"5a9e7be4e84c14dab03bdf09b262d89b4a0ddcd0c58a04f0392b9949c82b63f9"},"schema_version":"1.0"},"canonical_sha256":"2a42a6b2652273247aa03e7ddb1ef146ecb31301b0261035493781a90963c511","source":{"kind":"arxiv","id":"1601.00252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00252","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00252v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00252","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"FJBKNMTFEJZS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJBKNMTFEJZSI6VA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJBKNMTF","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FJBKNMTFEJZSI6VAHZ65WHXRI3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-03T07:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"e22b96c0e32bf187aaa93ee60dc396bf5c90e1e83cf6e51d0403071c8b328691","abstract_canon_sha256":"5a9e7be4e84c14dab03bdf09b262d89b4a0ddcd0c58a04f0392b9949c82b63f9"},"schema_version":"1.0"},"canonical_sha256":"2a42a6b2652273247aa03e7ddb1ef146ecb31301b0261035493781a90963c511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:28.049190Z","signature_b64":"UGz+4fgCsr4OLZ0obK3Z9tnZhueo0y4anX5BkrRJu77Nt6F30JtsfE4U4eIsr1y4mN+t6XZ1J3eeCg+VL/LtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a42a6b2652273247aa03e7ddb1ef146ecb31301b0261035493781a90963c511","last_reissued_at":"2026-05-18T01:23:28.048491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:28.048491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00252","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-18T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkgZVjMbY83u8l2b3U/JnGActuzLoKFcGG7nmFDlWi5dre5gRr2cK18nc0ScFvRbo2zdNb8H3OR7/Qm08jelBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:31:23.177860Z"},"content_sha256":"ca692380e0835ed401f655650fcb9b6aa6d33239a744b28815965280f408e272","schema_version":"1.0","event_id":"sha256:ca692380e0835ed401f655650fcb9b6aa6d33239a744b28815965280f408e272"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FJBKNMTFEJZSI6VAHZ65WHXRI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy online colouring with buffering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anna {\\L}yczkowska-Han\\'ckowiak, Wojciech Kordecki","submitted_at":"2016-01-03T07:06:23Z","abstract_excerpt":"We consider the problem of online graph colouring. Whenever a node is requested, a colour must be assigned to the node, and this colour must be different from the colours of any of its neighbours. According to the greedy algorithm the node is coloured by the colour with the smallest possible $k$.\n  The goal is to use as few colours as possible. We propose an algorithm, where the node is coloured not immediately, but only after the collection of next requests stored in the buffer of size $j$. In other words, the first node in the buffer is coloured definitively taking into account all possible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00252","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-18T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h97ZZn9Ol9/f8TypsgGYA2eTwZNZq8VgV9ze9rYdpp/nH0FSnZ7fZ9WXArhqazE1yVxLdzErrR5kI1+ofMUMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:31:23.178195Z"},"content_sha256":"feffd528d68eb1580069656dd880020af0c59fbf850b01dc779c9f25fc8d2707","schema_version":"1.0","event_id":"sha256:feffd528d68eb1580069656dd880020af0c59fbf850b01dc779c9f25fc8d2707"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/bundle.json","state_url":"https://pith.science/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/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-28T11:31:23Z","links":{"resolver":"https://pith.science/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3","bundle":"https://pith.science/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/bundle.json","state":"https://pith.science/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJBKNMTFEJZSI6VAHZ65WHXRI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FJBKNMTFEJZSI6VAHZ65WHXRI3","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":"5a9e7be4e84c14dab03bdf09b262d89b4a0ddcd0c58a04f0392b9949c82b63f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-03T07:06:23Z","title_canon_sha256":"e22b96c0e32bf187aaa93ee60dc396bf5c90e1e83cf6e51d0403071c8b328691"},"schema_version":"1.0","source":{"id":"1601.00252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00252","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00252v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00252","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"FJBKNMTFEJZS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJBKNMTFEJZSI6VA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJBKNMTF","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:feffd528d68eb1580069656dd880020af0c59fbf850b01dc779c9f25fc8d2707","target":"graph","created_at":"2026-05-18T01:23:28Z","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 online graph colouring. Whenever a node is requested, a colour must be assigned to the node, and this colour must be different from the colours of any of its neighbours. According to the greedy algorithm the node is coloured by the colour with the smallest possible $k$.\n  The goal is to use as few colours as possible. We propose an algorithm, where the node is coloured not immediately, but only after the collection of next requests stored in the buffer of size $j$. In other words, the first node in the buffer is coloured definitively taking into account all possible ","authors_text":"Anna {\\L}yczkowska-Han\\'ckowiak, Wojciech Kordecki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-03T07:06:23Z","title":"Greedy online colouring with buffering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00252","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:ca692380e0835ed401f655650fcb9b6aa6d33239a744b28815965280f408e272","target":"record","created_at":"2026-05-18T01:23:28Z","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":"5a9e7be4e84c14dab03bdf09b262d89b4a0ddcd0c58a04f0392b9949c82b63f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-03T07:06:23Z","title_canon_sha256":"e22b96c0e32bf187aaa93ee60dc396bf5c90e1e83cf6e51d0403071c8b328691"},"schema_version":"1.0","source":{"id":"1601.00252","kind":"arxiv","version":1}},"canonical_sha256":"2a42a6b2652273247aa03e7ddb1ef146ecb31301b0261035493781a90963c511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a42a6b2652273247aa03e7ddb1ef146ecb31301b0261035493781a90963c511","first_computed_at":"2026-05-18T01:23:28.048491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:28.048491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UGz+4fgCsr4OLZ0obK3Z9tnZhueo0y4anX5BkrRJu77Nt6F30JtsfE4U4eIsr1y4mN+t6XZ1J3eeCg+VL/LtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:28.049190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca692380e0835ed401f655650fcb9b6aa6d33239a744b28815965280f408e272","sha256:feffd528d68eb1580069656dd880020af0c59fbf850b01dc779c9f25fc8d2707"],"state_sha256":"b590a95aac45a272c67428cc349b0abaf78f5eed88dccabf44fe4ff6b4aed4fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aO+umWnRBfYIHeijGzDg5S7PJxsUi7F90tRaf1jykKV1b6PZdMcFUjRuCpWnVoLsfS5IdNWDbJ1SCH/i/Lf5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:31:23.180035Z","bundle_sha256":"f619c4bd4e4ab7f2803ad71872180aa1b101904174fb67adf1cb6bc1dee9ed79"}}