{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2AQJ45D6KSR62E2FSCI2XDA4DD","short_pith_number":"pith:2AQJ45D6","canonical_record":{"source":{"id":"1610.02997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T17:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"de16f20be83b27875d3b8550af0f653bff9e386bf7caee45f062ffdb6d4eea8a","abstract_canon_sha256":"bd40541190723f2741ba8a4b24a6a95155e762677fd6239f535201f4a4c76408"},"schema_version":"1.0"},"canonical_sha256":"d0209e747e54a3ed13459091ab8c1c18ec67892669b73e2c05ce0bf1f81853ee","source":{"kind":"arxiv","id":"1610.02997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02997","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02997v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02997","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"2AQJ45D6KSR6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2AQJ45D6KSR62E2F","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2AQJ45D6","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2AQJ45D6KSR62E2FSCI2XDA4DD","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T17:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"de16f20be83b27875d3b8550af0f653bff9e386bf7caee45f062ffdb6d4eea8a","abstract_canon_sha256":"bd40541190723f2741ba8a4b24a6a95155e762677fd6239f535201f4a4c76408"},"schema_version":"1.0"},"canonical_sha256":"d0209e747e54a3ed13459091ab8c1c18ec67892669b73e2c05ce0bf1f81853ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.244303Z","signature_b64":"PG/rJdjtx6RViNAp0exD8pPAt+U48pcN4Te++OE7U2PbaXktBxbx2MupMaPtnaKBE9d4cvcPjV+lEkKwVuGoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0209e747e54a3ed13459091ab8c1c18ec67892669b73e2c05ce0bf1f81853ee","last_reissued_at":"2026-05-18T01:02:50.243665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.243665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02997","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Erw/h/pofb/l/li8LtbM+dziu/lfNESPdDqT2+xMG8vrdqqArpjdYK6Lsvzu2motFiEGNfb7MYE87PqKqnKeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:49:04.450283Z"},"content_sha256":"59faf7abecccaad86d2fd48fe15a2b996b598f44f06b590147ab0ab62ee6efec","schema_version":"1.0","event_id":"sha256:59faf7abecccaad86d2fd48fe15a2b996b598f44f06b590147ab0ab62ee6efec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2AQJ45D6KSR62E2FSCI2XDA4DD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batch Coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Joan Boyar, Kim S. Larsen, Leah Epstein, Lene M. Favrholdt","submitted_at":"2016-10-10T17:00:39Z","abstract_excerpt":"In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, one vertex is presented for coloring at each time, and the only information is the identity of its neighbors among previously known vertices. In batche"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02997","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJv4nfX/FGjrK7Zpr8JDzUgEG/U9RXO2T0z1ENVDdhFgo/UEJky/dJQ+S+1uMQZZKiz3baaRGS5VZYEqB977BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:49:04.450642Z"},"content_sha256":"b44f9a5156f454816139354004d383f43d5aead83509ff6eb8223aa6c7d04b5c","schema_version":"1.0","event_id":"sha256:b44f9a5156f454816139354004d383f43d5aead83509ff6eb8223aa6c7d04b5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/bundle.json","state_url":"https://pith.science/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/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-22T13:49:04Z","links":{"resolver":"https://pith.science/pith/2AQJ45D6KSR62E2FSCI2XDA4DD","bundle":"https://pith.science/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/bundle.json","state":"https://pith.science/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2AQJ45D6KSR62E2FSCI2XDA4DD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2AQJ45D6KSR62E2FSCI2XDA4DD","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":"bd40541190723f2741ba8a4b24a6a95155e762677fd6239f535201f4a4c76408","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T17:00:39Z","title_canon_sha256":"de16f20be83b27875d3b8550af0f653bff9e386bf7caee45f062ffdb6d4eea8a"},"schema_version":"1.0","source":{"id":"1610.02997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02997","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02997v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02997","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"2AQJ45D6KSR6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2AQJ45D6KSR62E2F","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2AQJ45D6","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:b44f9a5156f454816139354004d383f43d5aead83509ff6eb8223aa6c7d04b5c","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, one vertex is presented for coloring at each time, and the only information is the identity of its neighbors among previously known vertices. In batche","authors_text":"Asaf Levin, Joan Boyar, Kim S. Larsen, Leah Epstein, Lene M. Favrholdt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T17:00:39Z","title":"Batch Coloring of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02997","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:59faf7abecccaad86d2fd48fe15a2b996b598f44f06b590147ab0ab62ee6efec","target":"record","created_at":"2026-05-18T01:02:50Z","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":"bd40541190723f2741ba8a4b24a6a95155e762677fd6239f535201f4a4c76408","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T17:00:39Z","title_canon_sha256":"de16f20be83b27875d3b8550af0f653bff9e386bf7caee45f062ffdb6d4eea8a"},"schema_version":"1.0","source":{"id":"1610.02997","kind":"arxiv","version":1}},"canonical_sha256":"d0209e747e54a3ed13459091ab8c1c18ec67892669b73e2c05ce0bf1f81853ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0209e747e54a3ed13459091ab8c1c18ec67892669b73e2c05ce0bf1f81853ee","first_computed_at":"2026-05-18T01:02:50.243665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.243665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PG/rJdjtx6RViNAp0exD8pPAt+U48pcN4Te++OE7U2PbaXktBxbx2MupMaPtnaKBE9d4cvcPjV+lEkKwVuGoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.244303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59faf7abecccaad86d2fd48fe15a2b996b598f44f06b590147ab0ab62ee6efec","sha256:b44f9a5156f454816139354004d383f43d5aead83509ff6eb8223aa6c7d04b5c"],"state_sha256":"ad31dee61847594038b093a06a184abf83779e83c603d25007bd3533cab437f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06Yo8ouOie+0JmqgLpcu3R+Vp5Riwvb7NyctpxQT2OPq+46QpsWJcXNLp8jHzMfZAH4i77oaMjzfjCKMmdaTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:49:04.452642Z","bundle_sha256":"ec74cfa95a1e031cf880bb6d935aac63a2279cdd3617e68a4074813165246198"}}