{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DPDT37JCEEBWKQ5MIRFCK2KPLF","short_pith_number":"pith:DPDT37JC","canonical_record":{"source":{"id":"1709.09100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-26T15:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"07658d2e54d790f4cdb96e46ee550fc2b37f4db15cfe14cdd18e634765150eb9","abstract_canon_sha256":"4f226e62cd551ccf95dead48a8a4eab1d44b36cfb52ef1af1876ab46a0a6753f"},"schema_version":"1.0"},"canonical_sha256":"1bc73dfd2221036543ac444a25694f597a7753748c8923d7b37a5f5b6a39964d","source":{"kind":"arxiv","id":"1709.09100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09100","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09100v2","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09100","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"DPDT37JCEEBW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPDT37JCEEBWKQ5M","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPDT37JC","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DPDT37JCEEBWKQ5MIRFCK2KPLF","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-26T15:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"07658d2e54d790f4cdb96e46ee550fc2b37f4db15cfe14cdd18e634765150eb9","abstract_canon_sha256":"4f226e62cd551ccf95dead48a8a4eab1d44b36cfb52ef1af1876ab46a0a6753f"},"schema_version":"1.0"},"canonical_sha256":"1bc73dfd2221036543ac444a25694f597a7753748c8923d7b37a5f5b6a39964d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:25.208235Z","signature_b64":"KiDDz199OAjQ3K84Wj15wy9bCKF/LG94HS+L+XFOWBrohj+9qQdo4ee5kFYCYhSh6E53K/55sJmZSENLmuKNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc73dfd2221036543ac444a25694f597a7753748c8923d7b37a5f5b6a39964d","last_reissued_at":"2026-05-17T23:58:25.207564Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:25.207564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09100","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:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4g/YWJpnXsPbJQ5BEHTxTb3ieOJN2KfXuZidPoqspubs8S/64zkplfZSD9yzDtqHlFREKXejIqKlE9R9tH9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:26:11.899884Z"},"content_sha256":"357775e183da576b2a4727090ea8ffcc15819fc87c8585c04827a6c95d77b452","schema_version":"1.0","event_id":"sha256:357775e183da576b2a4727090ea8ffcc15819fc87c8585c04827a6c95d77b452"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DPDT37JCEEBWKQ5MIRFCK2KPLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cluster Editing for Multi-Layer and Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hendrik Molter, Jiehua Chen, Manuel Sorge, Ondrej Suchy","submitted_at":"2017-09-26T15:53:40Z","abstract_excerpt":"Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-Layer Cluster Editing we receive a set of graphs on the same vertex set, called layers and aim to transform all layers into cluster graphs (disjoint unions of cliques) that differ only slightly. More specifically, we want to mark at most $d$ vertices and to transform each layer into a cluster graph using at most $k$ edge additions or deletions per layer so that, if we remove the marked vertices, we obtain the same clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09100","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:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wi6lOg9KZVDadMUN7E5cGVVi/F3l/2GGtjxj/eDaAQC6O7QJiPlRudijpsBhTmq/hAd+PkK0IyX8IaF82+MKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:26:11.900229Z"},"content_sha256":"86be1640c961d3aab089c706046ea4c2d4dab05feb025e2df6c45e4d1a5ea33e","schema_version":"1.0","event_id":"sha256:86be1640c961d3aab089c706046ea4c2d4dab05feb025e2df6c45e4d1a5ea33e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/bundle.json","state_url":"https://pith.science/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/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-19T13:26:11Z","links":{"resolver":"https://pith.science/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF","bundle":"https://pith.science/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/bundle.json","state":"https://pith.science/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPDT37JCEEBWKQ5MIRFCK2KPLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DPDT37JCEEBWKQ5MIRFCK2KPLF","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":"4f226e62cd551ccf95dead48a8a4eab1d44b36cfb52ef1af1876ab46a0a6753f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-26T15:53:40Z","title_canon_sha256":"07658d2e54d790f4cdb96e46ee550fc2b37f4db15cfe14cdd18e634765150eb9"},"schema_version":"1.0","source":{"id":"1709.09100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09100","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09100v2","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09100","created_at":"2026-05-17T23:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"DPDT37JCEEBW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPDT37JCEEBWKQ5M","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPDT37JC","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:86be1640c961d3aab089c706046ea4c2d4dab05feb025e2df6c45e4d1a5ea33e","target":"graph","created_at":"2026-05-17T23:58:25Z","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":"Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-Layer Cluster Editing we receive a set of graphs on the same vertex set, called layers and aim to transform all layers into cluster graphs (disjoint unions of cliques) that differ only slightly. More specifically, we want to mark at most $d$ vertices and to transform each layer into a cluster graph using at most $k$ edge additions or deletions per layer so that, if we remove the marked vertices, we obtain the same clu","authors_text":"Hendrik Molter, Jiehua Chen, Manuel Sorge, Ondrej Suchy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-26T15:53:40Z","title":"Cluster Editing for Multi-Layer and Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09100","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:357775e183da576b2a4727090ea8ffcc15819fc87c8585c04827a6c95d77b452","target":"record","created_at":"2026-05-17T23:58:25Z","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":"4f226e62cd551ccf95dead48a8a4eab1d44b36cfb52ef1af1876ab46a0a6753f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-26T15:53:40Z","title_canon_sha256":"07658d2e54d790f4cdb96e46ee550fc2b37f4db15cfe14cdd18e634765150eb9"},"schema_version":"1.0","source":{"id":"1709.09100","kind":"arxiv","version":2}},"canonical_sha256":"1bc73dfd2221036543ac444a25694f597a7753748c8923d7b37a5f5b6a39964d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc73dfd2221036543ac444a25694f597a7753748c8923d7b37a5f5b6a39964d","first_computed_at":"2026-05-17T23:58:25.207564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:25.207564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiDDz199OAjQ3K84Wj15wy9bCKF/LG94HS+L+XFOWBrohj+9qQdo4ee5kFYCYhSh6E53K/55sJmZSENLmuKNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:25.208235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:357775e183da576b2a4727090ea8ffcc15819fc87c8585c04827a6c95d77b452","sha256:86be1640c961d3aab089c706046ea4c2d4dab05feb025e2df6c45e4d1a5ea33e"],"state_sha256":"91feacb83634b2c9b815c3b5c1501e5aa482a5eb612e6154dcfc7004dd844090"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+bPTJjSCIwNtDPamnBqY3ddpxXleonbbnliAqVOQZWIJV0E9X7AE3FHawzap5DmZghFMKcJV+UrCrwwlwcgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:26:11.901904Z","bundle_sha256":"030154fbd0d9761ccfe5c8ca047d437bcd5e53f1059ca517054aa479219dd1c0"}}