{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UKEIVQWRR3CP3ORPPXRLARBHGP","short_pith_number":"pith:UKEIVQWR","canonical_record":{"source":{"id":"1210.6965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T19:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"ba61a67e2ae77a3dfe5652638e8c4bfa364592ccfdc5bad2d6b76c441d26ff8a","abstract_canon_sha256":"0ed00c43d135208cfbd7f6b83e0330bf691e94fb719a843f525422ccdb6960de"},"schema_version":"1.0"},"canonical_sha256":"a2888ac2d18ec4fdba2f7de2b0442733f1524dabdc76d89cab8fd428555345b4","source":{"kind":"arxiv","id":"1210.6965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6965","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6965v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6965","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"UKEIVQWRR3CP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UKEIVQWRR3CP3ORP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UKEIVQWR","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UKEIVQWRR3CP3ORPPXRLARBHGP","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T19:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"ba61a67e2ae77a3dfe5652638e8c4bfa364592ccfdc5bad2d6b76c441d26ff8a","abstract_canon_sha256":"0ed00c43d135208cfbd7f6b83e0330bf691e94fb719a843f525422ccdb6960de"},"schema_version":"1.0"},"canonical_sha256":"a2888ac2d18ec4fdba2f7de2b0442733f1524dabdc76d89cab8fd428555345b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.670954Z","signature_b64":"iHvbk2Za9Hd8w/XSvaWD9GkJGMqDqTy4mmyA2ZYnWIUJhUzyj+SSedcssrEbMwgXiYaDl/ceo+5qO38ErEDMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2888ac2d18ec4fdba2f7de2b0442733f1524dabdc76d89cab8fd428555345b4","last_reissued_at":"2026-05-18T03:42:22.670197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.670197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6965","source_version":1,"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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JoJUx7k3KEUjTb65xj688jWA2vFXffQ0555l8PeTbliH1AcJ6et3KDetnou37R+CmqbmA75o1SrR5YYjHchDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:19:52.675713Z"},"content_sha256":"1f952ed470ac30ee1dbe6c23356190a89be59a8b2ce64abe3a60fdf261ec2400","schema_version":"1.0","event_id":"sha256:1f952ed470ac30ee1dbe6c23356190a89be59a8b2ce64abe3a60fdf261ec2400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UKEIVQWRR3CP3ORPPXRLARBHGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Clique Covering of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Ramin Javadi, Zeinab Maleki","submitted_at":"2012-10-25T19:43:16Z","abstract_excerpt":"A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called local clique cover number of G and is denoted by $lcc(G)$. Local clique cover number can be viewed as the local counterpart of the clique cover number which is equal to the minimum total number of cliques covering all edges. In this paper, several aspects of the problem are studied and its relationships to other well-known problems are discussed. Moreover, the local clique cover number of claw-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6965","kind":"arxiv","version":1},"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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jfzD0Pv5+9f5GHHJRmIiCe1HnCvVEn/IJRUyQHOxLTCp6W6RCMXFAnOqTaaGBFDeiNT9d0+DJQutUC23RjPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:19:52.676353Z"},"content_sha256":"cbfc9ae9ed6df49c35addafc2e37e0fc132fa9ad2bdb427e674d56d35bc74a48","schema_version":"1.0","event_id":"sha256:cbfc9ae9ed6df49c35addafc2e37e0fc132fa9ad2bdb427e674d56d35bc74a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/bundle.json","state_url":"https://pith.science/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/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-02T14:19:52Z","links":{"resolver":"https://pith.science/pith/UKEIVQWRR3CP3ORPPXRLARBHGP","bundle":"https://pith.science/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/bundle.json","state":"https://pith.science/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKEIVQWRR3CP3ORPPXRLARBHGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UKEIVQWRR3CP3ORPPXRLARBHGP","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":"0ed00c43d135208cfbd7f6b83e0330bf691e94fb719a843f525422ccdb6960de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T19:43:16Z","title_canon_sha256":"ba61a67e2ae77a3dfe5652638e8c4bfa364592ccfdc5bad2d6b76c441d26ff8a"},"schema_version":"1.0","source":{"id":"1210.6965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6965","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6965v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6965","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"UKEIVQWRR3CP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UKEIVQWRR3CP3ORP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UKEIVQWR","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:cbfc9ae9ed6df49c35addafc2e37e0fc132fa9ad2bdb427e674d56d35bc74a48","target":"graph","created_at":"2026-05-18T03:42:22Z","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":"A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called local clique cover number of G and is denoted by $lcc(G)$. Local clique cover number can be viewed as the local counterpart of the clique cover number which is equal to the minimum total number of cliques covering all edges. In this paper, several aspects of the problem are studied and its relationships to other well-known problems are discussed. Moreover, the local clique cover number of claw-f","authors_text":"Behnaz Omoomi, Ramin Javadi, Zeinab Maleki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T19:43:16Z","title":"Local Clique Covering of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6965","kind":"arxiv","version":1},"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:1f952ed470ac30ee1dbe6c23356190a89be59a8b2ce64abe3a60fdf261ec2400","target":"record","created_at":"2026-05-18T03:42:22Z","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":"0ed00c43d135208cfbd7f6b83e0330bf691e94fb719a843f525422ccdb6960de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T19:43:16Z","title_canon_sha256":"ba61a67e2ae77a3dfe5652638e8c4bfa364592ccfdc5bad2d6b76c441d26ff8a"},"schema_version":"1.0","source":{"id":"1210.6965","kind":"arxiv","version":1}},"canonical_sha256":"a2888ac2d18ec4fdba2f7de2b0442733f1524dabdc76d89cab8fd428555345b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2888ac2d18ec4fdba2f7de2b0442733f1524dabdc76d89cab8fd428555345b4","first_computed_at":"2026-05-18T03:42:22.670197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:22.670197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHvbk2Za9Hd8w/XSvaWD9GkJGMqDqTy4mmyA2ZYnWIUJhUzyj+SSedcssrEbMwgXiYaDl/ceo+5qO38ErEDMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:22.670954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f952ed470ac30ee1dbe6c23356190a89be59a8b2ce64abe3a60fdf261ec2400","sha256:cbfc9ae9ed6df49c35addafc2e37e0fc132fa9ad2bdb427e674d56d35bc74a48"],"state_sha256":"a006f096abd565723ebfb53af35fcc35b943f12d437ecc9c5aafb28228cca40f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1wp1QZ7kRLiYG7bT8fzi//bWRhMYdzEKMJe20NR2smu24458RmEf+si71265sFVze3AOhVDErV+koNkDoOqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:19:52.679474Z","bundle_sha256":"748b01c613de10da0d5739df5898fc134c902f92103ccbf61a182fea1c76bc7e"}}