{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q75TCQVZIKKFJ2YMQW5SQYNBJ3","short_pith_number":"pith:Q75TCQVZ","canonical_record":{"source":{"id":"1411.4274","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-16T16:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"0d8c84cdaf6495d0de6fd74a450426a4ec5fc07de52ba60e944420502bbbb730","abstract_canon_sha256":"6f0276871fd2fc064d1a939cbcd4fafb942794685821f917a80a94fb7e319d7c"},"schema_version":"1.0"},"canonical_sha256":"87fb3142b9429454eb0c85bb2861a14ecaf0779008593dfedcba62e2abaa7320","source":{"kind":"arxiv","id":"1411.4274","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4274","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4274v3","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4274","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"Q75TCQVZIKKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q75TCQVZIKKFJ2YM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q75TCQVZ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q75TCQVZIKKFJ2YMQW5SQYNBJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4274","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-16T16:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"0d8c84cdaf6495d0de6fd74a450426a4ec5fc07de52ba60e944420502bbbb730","abstract_canon_sha256":"6f0276871fd2fc064d1a939cbcd4fafb942794685821f917a80a94fb7e319d7c"},"schema_version":"1.0"},"canonical_sha256":"87fb3142b9429454eb0c85bb2861a14ecaf0779008593dfedcba62e2abaa7320","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.125626Z","signature_b64":"ZLfmn7HsihPH/S/eyP0X3bdv0M2viL4yJevfiNg65f+bk1cugTFKAExv6EQSAnB2X0kOcSO9TZKOw97byPkRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87fb3142b9429454eb0c85bb2861a14ecaf0779008593dfedcba62e2abaa7320","last_reissued_at":"2026-05-18T01:02:14.124684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.124684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4274","source_version":3,"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:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k55GZNPMZZexxD0JY6r7sHUHZW5xBncrUfHFhckDyL7YXcgjJu/VVUDAs0TRryphDlwDd8gXBDbdmTMvsyKiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:42:38.835356Z"},"content_sha256":"656c982861f470da24f6734769d39830f0420d4a344e46a5193ffc8bf7921a33","schema_version":"1.0","event_id":"sha256:656c982861f470da24f6734769d39830f0420d4a344e46a5193ffc8bf7921a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q75TCQVZIKKFJ2YMQW5SQYNBJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Clique Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Fabijan, Bengt Nilsson, Christoph Durr, Marek Chrobak","submitted_at":"2014-11-16T16:17:49Z","abstract_excerpt":"Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of edges in the clusters, we propose an online strategy based on the doubling technique. It has an asymp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4274","kind":"arxiv","version":3},"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:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bH0qofYGUeDs0zD+4GhP6efmU0uBP4GehpX0ei/pm5+kRd1GIUsYoyoQ1O7wpQ9HGdUtZD1AQ5DOxjckH4M0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:42:38.835694Z"},"content_sha256":"1b13fca88a7d331e129311055c35bd39f3ed9d4a7deb961958b61ba89ff62fc0","schema_version":"1.0","event_id":"sha256:1b13fca88a7d331e129311055c35bd39f3ed9d4a7deb961958b61ba89ff62fc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/bundle.json","state_url":"https://pith.science/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/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-23T15:42:38Z","links":{"resolver":"https://pith.science/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3","bundle":"https://pith.science/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/bundle.json","state":"https://pith.science/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q75TCQVZIKKFJ2YMQW5SQYNBJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q75TCQVZIKKFJ2YMQW5SQYNBJ3","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":"6f0276871fd2fc064d1a939cbcd4fafb942794685821f917a80a94fb7e319d7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-16T16:17:49Z","title_canon_sha256":"0d8c84cdaf6495d0de6fd74a450426a4ec5fc07de52ba60e944420502bbbb730"},"schema_version":"1.0","source":{"id":"1411.4274","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4274","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4274v3","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4274","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"Q75TCQVZIKKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q75TCQVZIKKFJ2YM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q75TCQVZ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:1b13fca88a7d331e129311055c35bd39f3ed9d4a7deb961958b61ba89ff62fc0","target":"graph","created_at":"2026-05-18T01:02:14Z","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":"Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of edges in the clusters, we propose an online strategy based on the doubling technique. It has an asymp","authors_text":"Aleksander Fabijan, Bengt Nilsson, Christoph Durr, Marek Chrobak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-16T16:17:49Z","title":"Online Clique Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4274","kind":"arxiv","version":3},"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:656c982861f470da24f6734769d39830f0420d4a344e46a5193ffc8bf7921a33","target":"record","created_at":"2026-05-18T01:02:14Z","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":"6f0276871fd2fc064d1a939cbcd4fafb942794685821f917a80a94fb7e319d7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-16T16:17:49Z","title_canon_sha256":"0d8c84cdaf6495d0de6fd74a450426a4ec5fc07de52ba60e944420502bbbb730"},"schema_version":"1.0","source":{"id":"1411.4274","kind":"arxiv","version":3}},"canonical_sha256":"87fb3142b9429454eb0c85bb2861a14ecaf0779008593dfedcba62e2abaa7320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87fb3142b9429454eb0c85bb2861a14ecaf0779008593dfedcba62e2abaa7320","first_computed_at":"2026-05-18T01:02:14.124684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:14.124684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLfmn7HsihPH/S/eyP0X3bdv0M2viL4yJevfiNg65f+bk1cugTFKAExv6EQSAnB2X0kOcSO9TZKOw97byPkRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:14.125626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4274","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:656c982861f470da24f6734769d39830f0420d4a344e46a5193ffc8bf7921a33","sha256:1b13fca88a7d331e129311055c35bd39f3ed9d4a7deb961958b61ba89ff62fc0"],"state_sha256":"7def835ac8f92e8def9bead5f15cfcabd505a0ed6778b7967599ef7fb3e03eb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzaVJ9AZ8o1c95GtMyxBKbUr7RBMCPZ029r/8i8xgwh08ufmYBhd7i4jfLkcmfbBZZJRgf7L/adApyuM29QRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:42:38.837596Z","bundle_sha256":"5015265a0b771511b30344271c1a2ae44655a41e3fcb63b6a6c7b4ffbf8594b4"}}