{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VAGN6QUJAPV2G5OESTFLDJQYZU","short_pith_number":"pith:VAGN6QUJ","canonical_record":{"source":{"id":"1008.2814","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-17T04:07:22Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"4a247de352d105542403c6da4eebffd0085d650f50365ad46c2d7ff40a501236","abstract_canon_sha256":"417f5610fb0e821f1d0b030831c0781e3d0a72284af4a5ad9ea720383d944417"},"schema_version":"1.0"},"canonical_sha256":"a80cdf428903eba375c494cab1a618cd39cbfad55f968e99eb48f123b5f6efe3","source":{"kind":"arxiv","id":"1008.2814","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2814","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2814v4","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2814","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"VAGN6QUJAPV2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VAGN6QUJAPV2G5OE","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VAGN6QUJ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VAGN6QUJAPV2G5OESTFLDJQYZU","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2814","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-17T04:07:22Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"4a247de352d105542403c6da4eebffd0085d650f50365ad46c2d7ff40a501236","abstract_canon_sha256":"417f5610fb0e821f1d0b030831c0781e3d0a72284af4a5ad9ea720383d944417"},"schema_version":"1.0"},"canonical_sha256":"a80cdf428903eba375c494cab1a618cd39cbfad55f968e99eb48f123b5f6efe3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.345789Z","signature_b64":"3NJfowy8KeDYaBYz3itSEveIcvRkaHYaUh4WLlwjeu4BLpI9fRxkSlvLaDUNZH2ASgCfPWbq7ElJf+AHkcbQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a80cdf428903eba375c494cab1a618cd39cbfad55f968e99eb48f123b5f6efe3","last_reissued_at":"2026-05-18T03:05:55.345044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.345044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2814","source_version":4,"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPsvpOejabmtTDMq5ZmeQujCzIs4BNvlfLEfGPuPQwqQ6F6U1zYcJEfOcctN4wfCFoRIGSbj5yTQ25yLhZ6FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:59:56.333404Z"},"content_sha256":"0b4bc79d97cea4fcb1fcdcb66565148797aca63b3c9bacbfd25e55fd076d430f","schema_version":"1.0","event_id":"sha256:0b4bc79d97cea4fcb1fcdcb66565148797aca63b3c9bacbfd25e55fd076d430f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VAGN6QUJAPV2G5OESTFLDJQYZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex optimization for the planted k-disjoint-clique problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.OC","authors_text":"Brendan P.W. Ames, Stephen A. Vavasis","submitted_at":"2010-08-17T04:07:22Z","abstract_excerpt":"We consider the k-disjoint-clique problem. The input is an undirected graph G in which the nodes represent data items, and edges indicate a similarity between the corresponding items. The problem is to find within the graph k disjoint cliques that cover the maximum number of nodes of G. This problem may be understood as a general way to pose the classical `clustering' problem. In clustering, one is given data items and a distance function, and one wishes to partition the data into disjoint clusters of data items, such that the items in each cluster are close to each other. Our formulation addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2814","kind":"arxiv","version":4},"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSgJ4DUxbhmElHEi33H25HH0Q2CHR2Tt4p50+BhjVhnCfV4DVYHroY4foWlTOiFqfDSwXNYNMemCzLuNKmYgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:59:56.333989Z"},"content_sha256":"2bd52694183c12ca8a30e69961947a3b08d999fb65310ae152bfc65b0e42698f","schema_version":"1.0","event_id":"sha256:2bd52694183c12ca8a30e69961947a3b08d999fb65310ae152bfc65b0e42698f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/bundle.json","state_url":"https://pith.science/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/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-27T00:59:56Z","links":{"resolver":"https://pith.science/pith/VAGN6QUJAPV2G5OESTFLDJQYZU","bundle":"https://pith.science/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/bundle.json","state":"https://pith.science/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAGN6QUJAPV2G5OESTFLDJQYZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VAGN6QUJAPV2G5OESTFLDJQYZU","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":"417f5610fb0e821f1d0b030831c0781e3d0a72284af4a5ad9ea720383d944417","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-17T04:07:22Z","title_canon_sha256":"4a247de352d105542403c6da4eebffd0085d650f50365ad46c2d7ff40a501236"},"schema_version":"1.0","source":{"id":"1008.2814","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2814","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2814v4","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2814","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"VAGN6QUJAPV2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VAGN6QUJAPV2G5OE","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VAGN6QUJ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:2bd52694183c12ca8a30e69961947a3b08d999fb65310ae152bfc65b0e42698f","target":"graph","created_at":"2026-05-18T03:05:55Z","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 k-disjoint-clique problem. The input is an undirected graph G in which the nodes represent data items, and edges indicate a similarity between the corresponding items. The problem is to find within the graph k disjoint cliques that cover the maximum number of nodes of G. This problem may be understood as a general way to pose the classical `clustering' problem. In clustering, one is given data items and a distance function, and one wishes to partition the data into disjoint clusters of data items, such that the items in each cluster are close to each other. Our formulation addi","authors_text":"Brendan P.W. Ames, Stephen A. Vavasis","cross_cats":["cs.DS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-17T04:07:22Z","title":"Convex optimization for the planted k-disjoint-clique problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2814","kind":"arxiv","version":4},"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:0b4bc79d97cea4fcb1fcdcb66565148797aca63b3c9bacbfd25e55fd076d430f","target":"record","created_at":"2026-05-18T03:05:55Z","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":"417f5610fb0e821f1d0b030831c0781e3d0a72284af4a5ad9ea720383d944417","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-17T04:07:22Z","title_canon_sha256":"4a247de352d105542403c6da4eebffd0085d650f50365ad46c2d7ff40a501236"},"schema_version":"1.0","source":{"id":"1008.2814","kind":"arxiv","version":4}},"canonical_sha256":"a80cdf428903eba375c494cab1a618cd39cbfad55f968e99eb48f123b5f6efe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a80cdf428903eba375c494cab1a618cd39cbfad55f968e99eb48f123b5f6efe3","first_computed_at":"2026-05-18T03:05:55.345044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:55.345044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3NJfowy8KeDYaBYz3itSEveIcvRkaHYaUh4WLlwjeu4BLpI9fRxkSlvLaDUNZH2ASgCfPWbq7ElJf+AHkcbQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:55.345789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2814","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b4bc79d97cea4fcb1fcdcb66565148797aca63b3c9bacbfd25e55fd076d430f","sha256:2bd52694183c12ca8a30e69961947a3b08d999fb65310ae152bfc65b0e42698f"],"state_sha256":"ea3e035b60b127b03778798bc96f9c87dd6cfd22b3d667a7bbfbe0afcfd79811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TBgyE42hcVMEUBQl8ZxJIBOXsyTcjryvShuejgZ5ZvC+st3uY0aMWSU/VHpWMpyWWTG3gG+wkiGIkyCDJk3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:59:56.337246Z","bundle_sha256":"957215d98d61f332fbdd03a39a2f0cbb99c2a5f866cb4fb92dd0311ca04659bb"}}