{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G6ZCEIVO557J6E3ZFNKNTS7NJX","short_pith_number":"pith:G6ZCEIVO","schema_version":"1.0","canonical_sha256":"37b22222aeef7e9f13792b54d9cbed4dfabc791ca90b08d35ac3d043fbc9fcdf","source":{"kind":"arxiv","id":"1411.6673","version":2},"attestation_state":"computed","paper":{"title":"Counting cliques and clique covers in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kashyap Dixit, Martin F\\\"urer","submitted_at":"2014-11-24T22:33:00Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.6673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T22:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"edf0b40c9a03c9bd3d7ce85436d5affee6116d1f20fb187cf26bbde28b43906d","abstract_canon_sha256":"7d3444844f1a8a80c61f5ed5d6c530e0f333b72be2b4023ef513e34e4d907f15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:55.757960Z","signature_b64":"qO9W7iR3pOVw/pITUxEAlCgqCxQpXTFN4/0ZdGYkfn/tK2YIhsZTNuJOWi0Seo49UTbxM7WGk8vcVo6V51dvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b22222aeef7e9f13792b54d9cbed4dfabc791ca90b08d35ac3d043fbc9fcdf","last_reissued_at":"2026-05-18T02:25:55.757589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:55.757589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting cliques and clique covers in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kashyap Dixit, Martin F\\\"urer","submitted_at":"2014-11-24T22:33:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6673","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6673","created_at":"2026-05-18T02:25:55.757643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6673v2","created_at":"2026-05-18T02:25:55.757643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6673","created_at":"2026-05-18T02:25:55.757643+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6ZCEIVO557J","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6ZCEIVO557J6E3Z","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6ZCEIVO","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX","json":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX.json","graph_json":"https://pith.science/api/pith-number/G6ZCEIVO557J6E3ZFNKNTS7NJX/graph.json","events_json":"https://pith.science/api/pith-number/G6ZCEIVO557J6E3ZFNKNTS7NJX/events.json","paper":"https://pith.science/paper/G6ZCEIVO"},"agent_actions":{"view_html":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX","download_json":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX.json","view_paper":"https://pith.science/paper/G6ZCEIVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6673&json=true","fetch_graph":"https://pith.science/api/pith-number/G6ZCEIVO557J6E3ZFNKNTS7NJX/graph.json","fetch_events":"https://pith.science/api/pith-number/G6ZCEIVO557J6E3ZFNKNTS7NJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX/action/storage_attestation","attest_author":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX/action/author_attestation","sign_citation":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX/action/citation_signature","submit_replication":"https://pith.science/pith/G6ZCEIVO557J6E3ZFNKNTS7NJX/action/replication_record"}},"created_at":"2026-05-18T02:25:55.757643+00:00","updated_at":"2026-05-18T02:25:55.757643+00:00"}