{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EFFEGQQ5I4ZG5UIGTUVIVPGP65","short_pith_number":"pith:EFFEGQQ5","canonical_record":{"source":{"id":"1203.1754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T11:19:09Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"9a99d226c68329c5fe741f01135eb4e1d878eb57990c235339fa033c9e3c11fd","abstract_canon_sha256":"9f35bc45d26a6af7dcb8f336bd0c176119bab4365df576903eb05550604b68ff"},"schema_version":"1.0"},"canonical_sha256":"214a43421d47326ed1069d2a8abccff743c68119d1bdcb4bebbd252b44438a2a","source":{"kind":"arxiv","id":"1203.1754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1754","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1754v2","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1754","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFFEGQQ5I4ZG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFFEGQQ5I4ZG5UIG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFFEGQQ5","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EFFEGQQ5I4ZG5UIGTUVIVPGP65","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T11:19:09Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"9a99d226c68329c5fe741f01135eb4e1d878eb57990c235339fa033c9e3c11fd","abstract_canon_sha256":"9f35bc45d26a6af7dcb8f336bd0c176119bab4365df576903eb05550604b68ff"},"schema_version":"1.0"},"canonical_sha256":"214a43421d47326ed1069d2a8abccff743c68119d1bdcb4bebbd252b44438a2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:47.222093Z","signature_b64":"TmsP4N7m0LM2xHhbdRHQKfYud8vVebSyT3at25MgGB6Z85cpXs0sFRxjtH2b10jwvCg8ttlKQvNxlPu3KbMBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"214a43421d47326ed1069d2a8abccff743c68119d1bdcb4bebbd252b44438a2a","last_reissued_at":"2026-05-18T03:44:47.221591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:47.221591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1754","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-18T03:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqRm6bbQaB6hwl0h4SHwf+7aKrjGNGwtffuHEvPkYj4eEXpYSeqqgJsb5F61jnKvPHrW5vcvu/jYO+B3NVyuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:48:10.093728Z"},"content_sha256":"de967793871ea26ed0a399235d1fdfbb4aad42e2903bc2585383e782464aa73d","schema_version":"1.0","event_id":"sha256:de967793871ea26ed0a399235d1fdfbb4aad42e2903bc2585383e782464aa73d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EFFEGQQ5I4ZG5UIGTUVIVPGP65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Known algorithms for EDGE CLIQUE COVER are probably optimal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2012-03-08T11:19:09Z","abstract_excerpt":"In the EDGE CLIQUE COVER (ECC) problem, given a graph G and an integer k, we ask whether the edges of G can be covered with k complete subgraphs of G or, equivalently, whether G admits an intersection model on k-element universe. Gramm et al. [JEA 2008] have shown a set of simple rules that reduce the number of vertices of G to 2^k, and no algorithm is known with significantly better running time bound than a brute-force search on this reduced instance. In this paper we show that the approach of Gramm et al. is essentially optimal: we present a polynomial time algorithm that reduces an arbitra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1754","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-18T03:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwxIE6vuTl2VWH+zfTbI9WWsbPPDxDeoxus3fFCSe30r+l3ppscOwnXxtxrsSvyXHjoh/BjI+QSYWKwq+TpWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:48:10.094364Z"},"content_sha256":"79c44b4bdbc707947c7d999318ab8c33402e7c53ac2eb0e0e25f0309c7ff9afc","schema_version":"1.0","event_id":"sha256:79c44b4bdbc707947c7d999318ab8c33402e7c53ac2eb0e0e25f0309c7ff9afc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/bundle.json","state_url":"https://pith.science/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/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-30T19:48:10Z","links":{"resolver":"https://pith.science/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65","bundle":"https://pith.science/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/bundle.json","state":"https://pith.science/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFFEGQQ5I4ZG5UIGTUVIVPGP65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EFFEGQQ5I4ZG5UIGTUVIVPGP65","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":"9f35bc45d26a6af7dcb8f336bd0c176119bab4365df576903eb05550604b68ff","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T11:19:09Z","title_canon_sha256":"9a99d226c68329c5fe741f01135eb4e1d878eb57990c235339fa033c9e3c11fd"},"schema_version":"1.0","source":{"id":"1203.1754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1754","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1754v2","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1754","created_at":"2026-05-18T03:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFFEGQQ5I4ZG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFFEGQQ5I4ZG5UIG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFFEGQQ5","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:79c44b4bdbc707947c7d999318ab8c33402e7c53ac2eb0e0e25f0309c7ff9afc","target":"graph","created_at":"2026-05-18T03:44:47Z","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 the EDGE CLIQUE COVER (ECC) problem, given a graph G and an integer k, we ask whether the edges of G can be covered with k complete subgraphs of G or, equivalently, whether G admits an intersection model on k-element universe. Gramm et al. [JEA 2008] have shown a set of simple rules that reduce the number of vertices of G to 2^k, and no algorithm is known with significantly better running time bound than a brute-force search on this reduced instance. In this paper we show that the approach of Gramm et al. is essentially optimal: we present a polynomial time algorithm that reduces an arbitra","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T11:19:09Z","title":"Known algorithms for EDGE CLIQUE COVER are probably optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1754","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:de967793871ea26ed0a399235d1fdfbb4aad42e2903bc2585383e782464aa73d","target":"record","created_at":"2026-05-18T03:44:47Z","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":"9f35bc45d26a6af7dcb8f336bd0c176119bab4365df576903eb05550604b68ff","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T11:19:09Z","title_canon_sha256":"9a99d226c68329c5fe741f01135eb4e1d878eb57990c235339fa033c9e3c11fd"},"schema_version":"1.0","source":{"id":"1203.1754","kind":"arxiv","version":2}},"canonical_sha256":"214a43421d47326ed1069d2a8abccff743c68119d1bdcb4bebbd252b44438a2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"214a43421d47326ed1069d2a8abccff743c68119d1bdcb4bebbd252b44438a2a","first_computed_at":"2026-05-18T03:44:47.221591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:47.221591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmsP4N7m0LM2xHhbdRHQKfYud8vVebSyT3at25MgGB6Z85cpXs0sFRxjtH2b10jwvCg8ttlKQvNxlPu3KbMBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:47.222093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de967793871ea26ed0a399235d1fdfbb4aad42e2903bc2585383e782464aa73d","sha256:79c44b4bdbc707947c7d999318ab8c33402e7c53ac2eb0e0e25f0309c7ff9afc"],"state_sha256":"4b751aae5d6cbbd42ccd792a8ff08e58cb0b3961a60cb31a73299112cbcfa9ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOOy97x8E0OQjcgCxpnBCuVhDwgt9lF7SM7gTbe6lwuGAOBdxrAAr32gzKsohZzIJ6nt6OC5d5luNZ9QGfkIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:48:10.097880Z","bundle_sha256":"fdb5ed01f92de2c55be7b8ece1699b9f6b537f7053e3eab05071106c669f87b5"}}