{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AY3CUCC2EHIO2JA5HHCFEZMXDF","short_pith_number":"pith:AY3CUCC2","schema_version":"1.0","canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","source":{"kind":"arxiv","id":"1403.0734","version":2},"attestation_state":"computed","paper":{"title":"Clique counting in MapReduce: theory and experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Emanuele G. Fusco, Irene Finocchi, Marco Finocchi","submitted_at":"2014-03-04T10:36:35Z","abstract_excerpt":"We tackle the problem of counting the number of $k$-cliques in large-scale graphs, for any constant $k \\ge 3$. Clique counting is essential in a variety of applications, among which social network analysis. Due to its computationally intensive nature, we settle for parallel solutions in the MapReduce framework, which has become in the last few years a {\\em de facto} standard for batch processing of massive data sets. We give both theoretical and experimental contributions.\n  On the theory side, we design the first exact scalable algorithm for counting (and listing) $k$-cliques. Our algorithm u"},"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":"1403.0734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-04T10:36:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"88f1616ac365763e971b455e3e6c622838d5ba5a01b13b54c4f45a3c2d7a300d","abstract_canon_sha256":"e739150fa88d2b218f9d85d8c1ff081552021a5b57fea12122486c3236e82367"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:41.942047Z","signature_b64":"lt/tQrcOxSQXGOd7mQ6AkcFxeq/mcjup264ukZ9pkZW4BmosKSOpIdLOI0fhrfZGeiNk80QFM3Er2nFl8xTdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","last_reissued_at":"2026-05-18T00:18:41.940847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:41.940847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique counting in MapReduce: theory and experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Emanuele G. Fusco, Irene Finocchi, Marco Finocchi","submitted_at":"2014-03-04T10:36:35Z","abstract_excerpt":"We tackle the problem of counting the number of $k$-cliques in large-scale graphs, for any constant $k \\ge 3$. Clique counting is essential in a variety of applications, among which social network analysis. Due to its computationally intensive nature, we settle for parallel solutions in the MapReduce framework, which has become in the last few years a {\\em de facto} standard for batch processing of massive data sets. We give both theoretical and experimental contributions.\n  On the theory side, we design the first exact scalable algorithm for counting (and listing) $k$-cliques. Our algorithm u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0734","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":"1403.0734","created_at":"2026-05-18T00:18:41.940927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0734v2","created_at":"2026-05-18T00:18:41.940927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0734","created_at":"2026-05-18T00:18:41.940927+00:00"},{"alias_kind":"pith_short_12","alias_value":"AY3CUCC2EHIO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AY3CUCC2EHIO2JA5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AY3CUCC2","created_at":"2026-05-18T12:28:19.803747+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/AY3CUCC2EHIO2JA5HHCFEZMXDF","json":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF.json","graph_json":"https://pith.science/api/pith-number/AY3CUCC2EHIO2JA5HHCFEZMXDF/graph.json","events_json":"https://pith.science/api/pith-number/AY3CUCC2EHIO2JA5HHCFEZMXDF/events.json","paper":"https://pith.science/paper/AY3CUCC2"},"agent_actions":{"view_html":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF","download_json":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF.json","view_paper":"https://pith.science/paper/AY3CUCC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0734&json=true","fetch_graph":"https://pith.science/api/pith-number/AY3CUCC2EHIO2JA5HHCFEZMXDF/graph.json","fetch_events":"https://pith.science/api/pith-number/AY3CUCC2EHIO2JA5HHCFEZMXDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/action/storage_attestation","attest_author":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/action/author_attestation","sign_citation":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/action/citation_signature","submit_replication":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/action/replication_record"}},"created_at":"2026-05-18T00:18:41.940927+00:00","updated_at":"2026-05-18T00:18:41.940927+00:00"}