{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G6ZCEIVO557J6E3ZFNKNTS7NJX","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":"7d3444844f1a8a80c61f5ed5d6c530e0f333b72be2b4023ef513e34e4d907f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T22:33:00Z","title_canon_sha256":"edf0b40c9a03c9bd3d7ce85436d5affee6116d1f20fb187cf26bbde28b43906d"},"schema_version":"1.0","source":{"id":"1411.6673","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6673","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6673v2","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6673","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"G6ZCEIVO557J","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G6ZCEIVO557J6E3Z","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G6ZCEIVO","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:100b6862076d58a2b64791480eb8e26fe3d4a68f721f70b4888a5a57adf87358","target":"graph","created_at":"2026-05-18T02:25: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 study the problem of counting the number of {\\em isomorphic} copies of a given {\\em template} graph, say $H$, in the input {\\em base} graph, say $G$. In general, it is believed that polynomial time algorithms that solve this problem exactly are unlikely to exist. So, a lot of work has gone into designing efficient {\\em approximation schemes}, especially, when $H$ is a perfect matching.\n  In this work, we present efficient approximation schemes to count $k$-Cliques, $k$-Independent sets and $k$-Clique covers in random graphs. We present {\\em fully polynomial time randomized approximation sch","authors_text":"Kashyap Dixit, Martin F\\\"urer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T22:33:00Z","title":"Counting cliques and clique covers in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6673","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:845e3b15a902eb93a8828be7a973bb743b5d129367b253670f33a8adf442ea1e","target":"record","created_at":"2026-05-18T02:25: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":"7d3444844f1a8a80c61f5ed5d6c530e0f333b72be2b4023ef513e34e4d907f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T22:33:00Z","title_canon_sha256":"edf0b40c9a03c9bd3d7ce85436d5affee6116d1f20fb187cf26bbde28b43906d"},"schema_version":"1.0","source":{"id":"1411.6673","kind":"arxiv","version":2}},"canonical_sha256":"37b22222aeef7e9f13792b54d9cbed4dfabc791ca90b08d35ac3d043fbc9fcdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37b22222aeef7e9f13792b54d9cbed4dfabc791ca90b08d35ac3d043fbc9fcdf","first_computed_at":"2026-05-18T02:25:55.757589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:55.757589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qO9W7iR3pOVw/pITUxEAlCgqCxQpXTFN4/0ZdGYkfn/tK2YIhsZTNuJOWi0Seo49UTbxM7WGk8vcVo6V51dvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:55.757960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6673","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:845e3b15a902eb93a8828be7a973bb743b5d129367b253670f33a8adf442ea1e","sha256:100b6862076d58a2b64791480eb8e26fe3d4a68f721f70b4888a5a57adf87358"],"state_sha256":"a5f2588e1e5805fcd803e0d0c50d9bbedec05728c5aad411f3c0626e845a42ce"}