{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AY3CUCC2EHIO2JA5HHCFEZMXDF","short_pith_number":"pith:AY3CUCC2","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"},"canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","source":{"kind":"arxiv","id":"1403.0734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0734","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0734v2","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0734","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"AY3CUCC2EHIO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AY3CUCC2EHIO2JA5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AY3CUCC2","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AY3CUCC2EHIO2JA5HHCFEZMXDF","target":"record","payload":{"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"},"canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","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"},"source_kind":"arxiv","source_id":"1403.0734","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-18T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GhrA38hNkqABLQvVfD80ef+oMFLdN2LHma+NsmpAHiWT3OiT/OY9QwjDpcJ7R78ULEsSKlI21QvVyseTIKoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:49:49.855440Z"},"content_sha256":"16c586b6c9adc44883991c55302d6dc0c53f435ea1a781ad8b9da503be78c5a9","schema_version":"1.0","event_id":"sha256:16c586b6c9adc44883991c55302d6dc0c53f435ea1a781ad8b9da503be78c5a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AY3CUCC2EHIO2JA5HHCFEZMXDF","target":"graph","payload":{"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"},"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-18T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsQVbzdlcHtXcK5pcE0OPxMwd3mqILBUOTtZ+SuoaHqvuSscL1iKEIjPMclZeH26aXQxxADxu3y3xFLE0tP4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:49:49.855790Z"},"content_sha256":"6ce7b59bf485bf6182dd01a6114a50e4d1f35821d298aab557c24c4743cb6525","schema_version":"1.0","event_id":"sha256:6ce7b59bf485bf6182dd01a6114a50e4d1f35821d298aab557c24c4743cb6525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/bundle.json","state_url":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/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-02T21:49:49Z","links":{"resolver":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF","bundle":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/bundle.json","state":"https://pith.science/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AY3CUCC2EHIO2JA5HHCFEZMXDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AY3CUCC2EHIO2JA5HHCFEZMXDF","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":"e739150fa88d2b218f9d85d8c1ff081552021a5b57fea12122486c3236e82367","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-04T10:36:35Z","title_canon_sha256":"88f1616ac365763e971b455e3e6c622838d5ba5a01b13b54c4f45a3c2d7a300d"},"schema_version":"1.0","source":{"id":"1403.0734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0734","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0734v2","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0734","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"AY3CUCC2EHIO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AY3CUCC2EHIO2JA5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AY3CUCC2","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:6ce7b59bf485bf6182dd01a6114a50e4d1f35821d298aab557c24c4743cb6525","target":"graph","created_at":"2026-05-18T00:18:41Z","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 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","authors_text":"Emanuele G. Fusco, Irene Finocchi, Marco Finocchi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-04T10:36:35Z","title":"Clique counting in MapReduce: theory and experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0734","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:16c586b6c9adc44883991c55302d6dc0c53f435ea1a781ad8b9da503be78c5a9","target":"record","created_at":"2026-05-18T00:18:41Z","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":"e739150fa88d2b218f9d85d8c1ff081552021a5b57fea12122486c3236e82367","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-04T10:36:35Z","title_canon_sha256":"88f1616ac365763e971b455e3e6c622838d5ba5a01b13b54c4f45a3c2d7a300d"},"schema_version":"1.0","source":{"id":"1403.0734","kind":"arxiv","version":2}},"canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06362a085a21d0ed241d39c452659719689e0d16207a7aed9a4530fa8c0e2ee0","first_computed_at":"2026-05-18T00:18:41.940847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:41.940847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lt/tQrcOxSQXGOd7mQ6AkcFxeq/mcjup264ukZ9pkZW4BmosKSOpIdLOI0fhrfZGeiNk80QFM3Er2nFl8xTdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:41.942047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c586b6c9adc44883991c55302d6dc0c53f435ea1a781ad8b9da503be78c5a9","sha256:6ce7b59bf485bf6182dd01a6114a50e4d1f35821d298aab557c24c4743cb6525"],"state_sha256":"65b6057190c9b56c13dae5fd5143eaf684c6c8a8733ab4caaeb983b54ac31ef7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/BAaRrAKvlPcwM07fqCrFBLbnEyS9sdL0po6YfOhJYa5PqfNeVcyebJacucqI3lKyUwbotA2ptQr2B4zZnQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:49:49.857718Z","bundle_sha256":"9fce6a495eed714195198dbfc2e7c76779144b4b7d43945552c1d4195451cfcf"}}