{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N2ER6DUOAWNYAGUBA7ZRHQ2ZYT","short_pith_number":"pith:N2ER6DUO","canonical_record":{"source":{"id":"1411.7460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T03:40:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"fdfe13b91ead89e57996d06f9cc71c9416c3e50a3489716fc2da0100f5735585","abstract_canon_sha256":"d64e0ecf58825eef2a728286e9d7e827a87c35063823d93676ee5903c3d3c240"},"schema_version":"1.0"},"canonical_sha256":"6e891f0e8e059b801a8107f313c359c4ec14184d9abeaeb3e92e0ddb0e81eae1","source":{"kind":"arxiv","id":"1411.7460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7460","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7460v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7460","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"N2ER6DUOAWNY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N2ER6DUOAWNYAGUB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N2ER6DUO","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N2ER6DUOAWNYAGUBA7ZRHQ2ZYT","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T03:40:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"fdfe13b91ead89e57996d06f9cc71c9416c3e50a3489716fc2da0100f5735585","abstract_canon_sha256":"d64e0ecf58825eef2a728286e9d7e827a87c35063823d93676ee5903c3d3c240"},"schema_version":"1.0"},"canonical_sha256":"6e891f0e8e059b801a8107f313c359c4ec14184d9abeaeb3e92e0ddb0e81eae1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:37.946895Z","signature_b64":"GqLg00OURTt1pmq4tE0+VDdGc8n7aSWkXqRQ2K9+aEUm5WUCWqKB43dA77a2xSHyN6ZbSxSOZm8PmSjFZaYHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e891f0e8e059b801a8107f313c359c4ec14184d9abeaeb3e92e0ddb0e81eae1","last_reissued_at":"2026-05-18T02:32:37.946464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:37.946464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7460","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-18T02:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xw+BILffHdfa0OP3opk0Nj9nLnreB0BMXJffL3aalqM5hTvGhXHXbMVN5JOpngJ1aARax6C2AFWNk6//5kUODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:11:51.078262Z"},"content_sha256":"5e09cf18f96cde97abde94c5f637740d99d0ae6214e0b21d9b0c12d7956ac289","schema_version":"1.0","event_id":"sha256:5e09cf18f96cde97abde94c5f637740d99d0ae6214e0b21d9b0c12d7956ac289"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N2ER6DUOAWNYAGUBA7ZRHQ2ZYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Alok Choudhary, Assefaw H. Gebremedhin, Bharath Pattabiraman, Md. Mostofa Ali Patwary, Wei-keng Liao","submitted_at":"2014-11-27T03:40:06Z","abstract_excerpt":"The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with acceptable runtimes for certain classes of graphs, but many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques and is able to find maximum cliques in very large, sparse graphs quickly. Extensive experiments on different kinds of synthetic and real-world graphs show that our new algorithm can be orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7460","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-18T02:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE7/OVZnCzgtZnIwbwYyFEoXS7guUwxeiPc01l9WyLwUTQjbE2JBWQ3bqBDk0OaKq9uF6CJVBKRR1WDELw+vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:11:51.078626Z"},"content_sha256":"72a444831390d5095cbf4c1e8c8e246b18c319c84e31e3f563aa24f9195ef17c","schema_version":"1.0","event_id":"sha256:72a444831390d5095cbf4c1e8c8e246b18c319c84e31e3f563aa24f9195ef17c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/bundle.json","state_url":"https://pith.science/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/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-04T11:11:51Z","links":{"resolver":"https://pith.science/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT","bundle":"https://pith.science/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/bundle.json","state":"https://pith.science/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2ER6DUOAWNYAGUBA7ZRHQ2ZYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N2ER6DUOAWNYAGUBA7ZRHQ2ZYT","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":"d64e0ecf58825eef2a728286e9d7e827a87c35063823d93676ee5903c3d3c240","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T03:40:06Z","title_canon_sha256":"fdfe13b91ead89e57996d06f9cc71c9416c3e50a3489716fc2da0100f5735585"},"schema_version":"1.0","source":{"id":"1411.7460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7460","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7460v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7460","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"N2ER6DUOAWNY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N2ER6DUOAWNYAGUB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N2ER6DUO","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:72a444831390d5095cbf4c1e8c8e246b18c319c84e31e3f563aa24f9195ef17c","target":"graph","created_at":"2026-05-18T02:32:37Z","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":"The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with acceptable runtimes for certain classes of graphs, but many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques and is able to find maximum cliques in very large, sparse graphs quickly. Extensive experiments on different kinds of synthetic and real-world graphs show that our new algorithm can be orde","authors_text":"Alok Choudhary, Assefaw H. Gebremedhin, Bharath Pattabiraman, Md. Mostofa Ali Patwary, Wei-keng Liao","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T03:40:06Z","title":"Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7460","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:5e09cf18f96cde97abde94c5f637740d99d0ae6214e0b21d9b0c12d7956ac289","target":"record","created_at":"2026-05-18T02:32:37Z","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":"d64e0ecf58825eef2a728286e9d7e827a87c35063823d93676ee5903c3d3c240","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T03:40:06Z","title_canon_sha256":"fdfe13b91ead89e57996d06f9cc71c9416c3e50a3489716fc2da0100f5735585"},"schema_version":"1.0","source":{"id":"1411.7460","kind":"arxiv","version":1}},"canonical_sha256":"6e891f0e8e059b801a8107f313c359c4ec14184d9abeaeb3e92e0ddb0e81eae1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e891f0e8e059b801a8107f313c359c4ec14184d9abeaeb3e92e0ddb0e81eae1","first_computed_at":"2026-05-18T02:32:37.946464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:37.946464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GqLg00OURTt1pmq4tE0+VDdGc8n7aSWkXqRQ2K9+aEUm5WUCWqKB43dA77a2xSHyN6ZbSxSOZm8PmSjFZaYHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:37.946895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e09cf18f96cde97abde94c5f637740d99d0ae6214e0b21d9b0c12d7956ac289","sha256:72a444831390d5095cbf4c1e8c8e246b18c319c84e31e3f563aa24f9195ef17c"],"state_sha256":"045fbf64d3a30447d8a71c0a6d0abad3d4f091edb7116dd8de7169a1c8910807"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6+dXEaev9ZvfamyCtMW7p0f1IcSnLIaHM8j8VmVC1Nk+dPK5/jhFizUk4toF8kLAIqLtwUTBkBNO8QcMVaMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:11:51.080670Z","bundle_sha256":"471dd6edbeb9c13f308f354a72615a8ce2fd2c43baea8b28405ddc03ebada4eb"}}