{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I7ID454WE4MUDGB6V2EEMFWPGQ","short_pith_number":"pith:I7ID454W","canonical_record":{"source":{"id":"1811.04753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-12T14:51:54Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"46454dfbae4ab6ff73ca559e5ea53ebb5f87aa90d06f7b7c2979fd5c1b1d19bb","abstract_canon_sha256":"1bfb841151a0cc4c2c2d0a005fbb66ee42a0f5f6cc60ce50de166b92bc9ad00c"},"schema_version":"1.0"},"canonical_sha256":"47d03e7796271941983eae884616cf3409698d21181da738eebc8361fa1695fd","source":{"kind":"arxiv","id":"1811.04753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04753","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04753v2","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04753","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"I7ID454WE4MU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7ID454WE4MUDGB6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7ID454W","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I7ID454WE4MUDGB6V2EEMFWPGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-12T14:51:54Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"46454dfbae4ab6ff73ca559e5ea53ebb5f87aa90d06f7b7c2979fd5c1b1d19bb","abstract_canon_sha256":"1bfb841151a0cc4c2c2d0a005fbb66ee42a0f5f6cc60ce50de166b92bc9ad00c"},"schema_version":"1.0"},"canonical_sha256":"47d03e7796271941983eae884616cf3409698d21181da738eebc8361fa1695fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:37.789633Z","signature_b64":"ZemveqmsiuaqOMDLGG7SosFS3pOwgwpPNbiZgDJaq6W7DCl8gx/d+BDO9xLmLkH+yE35qRjScRgdjr6+0yFnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d03e7796271941983eae884616cf3409698d21181da738eebc8361fa1695fd","last_reissued_at":"2026-05-17T23:43:37.788899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:37.788899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04753","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-17T23:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGfZPzBtiaSN/5Q6dL3lTCAPhLtn0rKuC2pMnNFkopvaZE+iG6fe10Dyi8n+ZMLNCJ5hmvM1fjdbo1PjKnesCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:20:39.334651Z"},"content_sha256":"06ae901d51811f953cdd7036cdaf332518e8c6f493c9cb1fc145eae911b3fe63","schema_version":"1.0","event_id":"sha256:06ae901d51811f953cdd7036cdaf332518e8c6f493c9cb1fc145eae911b3fe63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I7ID454WE4MUDGB6V2EEMFWPGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sliding Window Temporal Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"George B. Mertzios, Hendrik Molter, Viktor Zamaraev","submitted_at":"2018-11-12T14:51:54Z","abstract_excerpt":"Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static graphs, which often stand in stark contrast to practice where data is inherently dynamic and subject to discrete changes over time. A temporal graph is a graph whose edges are assigned a set of integer time labels, indicating at which discrete time steps the edge is active. In this paper we present a natural temporal extension of the classical graph coloring pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04753","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-17T23:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/81wqkgwlEmOgk3IMPeLcSM7SxMngWNtjovA7pmIDVz/+zr9dklZpga9o6BNa2HN9mHTyTLYgBYszxBe0jCPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:20:39.335005Z"},"content_sha256":"6a096891e2bb7fbc7e3b9f36e298df620229cd8fe6b257b1aaabf23fa6b522f0","schema_version":"1.0","event_id":"sha256:6a096891e2bb7fbc7e3b9f36e298df620229cd8fe6b257b1aaabf23fa6b522f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/bundle.json","state_url":"https://pith.science/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/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-03T22:20:39Z","links":{"resolver":"https://pith.science/pith/I7ID454WE4MUDGB6V2EEMFWPGQ","bundle":"https://pith.science/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/bundle.json","state":"https://pith.science/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7ID454WE4MUDGB6V2EEMFWPGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I7ID454WE4MUDGB6V2EEMFWPGQ","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":"1bfb841151a0cc4c2c2d0a005fbb66ee42a0f5f6cc60ce50de166b92bc9ad00c","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-12T14:51:54Z","title_canon_sha256":"46454dfbae4ab6ff73ca559e5ea53ebb5f87aa90d06f7b7c2979fd5c1b1d19bb"},"schema_version":"1.0","source":{"id":"1811.04753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04753","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04753v2","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04753","created_at":"2026-05-17T23:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"I7ID454WE4MU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7ID454WE4MUDGB6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7ID454W","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:6a096891e2bb7fbc7e3b9f36e298df620229cd8fe6b257b1aaabf23fa6b522f0","target":"graph","created_at":"2026-05-17T23:43:37Z","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":"Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static graphs, which often stand in stark contrast to practice where data is inherently dynamic and subject to discrete changes over time. A temporal graph is a graph whose edges are assigned a set of integer time labels, indicating at which discrete time steps the edge is active. In this paper we present a natural temporal extension of the classical graph coloring pr","authors_text":"George B. Mertzios, Hendrik Molter, Viktor Zamaraev","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-12T14:51:54Z","title":"Sliding Window Temporal Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04753","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:06ae901d51811f953cdd7036cdaf332518e8c6f493c9cb1fc145eae911b3fe63","target":"record","created_at":"2026-05-17T23:43:37Z","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":"1bfb841151a0cc4c2c2d0a005fbb66ee42a0f5f6cc60ce50de166b92bc9ad00c","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-12T14:51:54Z","title_canon_sha256":"46454dfbae4ab6ff73ca559e5ea53ebb5f87aa90d06f7b7c2979fd5c1b1d19bb"},"schema_version":"1.0","source":{"id":"1811.04753","kind":"arxiv","version":2}},"canonical_sha256":"47d03e7796271941983eae884616cf3409698d21181da738eebc8361fa1695fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47d03e7796271941983eae884616cf3409698d21181da738eebc8361fa1695fd","first_computed_at":"2026-05-17T23:43:37.788899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:37.788899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZemveqmsiuaqOMDLGG7SosFS3pOwgwpPNbiZgDJaq6W7DCl8gx/d+BDO9xLmLkH+yE35qRjScRgdjr6+0yFnDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:37.789633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06ae901d51811f953cdd7036cdaf332518e8c6f493c9cb1fc145eae911b3fe63","sha256:6a096891e2bb7fbc7e3b9f36e298df620229cd8fe6b257b1aaabf23fa6b522f0"],"state_sha256":"6d53e18a5f5a740949f7bc1787eeb158fd7490c25c342220f7ca84eb9038d2bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvQxRum6CV0GuZMEEoZYFchbqmQ7C4K2zo/QL35/PPRSRIAUMhGddOK0oSr5/gT7kvIP+PyM1R+47pYmEZLDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:20:39.336967Z","bundle_sha256":"abcbbe1456c5b32e3f665873c1cb5f97124e834ffbb04a89d23b0ea6a8f78ccb"}}