{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CVS4TJEUDWJABGPVSGQPWRI3RP","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":"f010ec53799a42ae7c87e99be568d7259c02bc05826a0616a56f117425849cda","cross_cats_sorted":["cs.DC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-30T21:17:59Z","title_canon_sha256":"04902375044ed019f04cb6874a0e7f4d1c761722a517250587058b71ce18da85"},"schema_version":"1.0","source":{"id":"1212.0017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0017","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0017v2","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0017","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"CVS4TJEUDWJA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CVS4TJEUDWJABGPV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CVS4TJEU","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c2ea1b30941eaece2f88ee639c8a2a274548f1759e25a30b30f8d666e8d19c64","target":"graph","created_at":"2026-05-18T01:08:21Z","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":"Recently, graph mining approaches have become very popular, especially in domains such as bioinformatics, chemoinformatics and social networks. In this scope, one of the most challenging tasks is frequent subgraph discovery. This task has been motivated by the tremendously increasing size of existing graph databases. Since then, an important problem of designing efficient and scaling approaches for frequent subgraph discovery in large clusters, has taken place. However, failures are a norm rather than being an exception in large clusters. In this context, the MapReduce framework was designed s","authors_text":"Engelbert Mephu Nguifo, Laurent d'Orazio, Mondher Maddouri, Sabeur Aridhi","cross_cats":["cs.DC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-30T21:17:59Z","title":"A large-scale and fault-tolerant approach of subgraph mining using density-based partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0017","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:f12fb315aea6406bc3c12772bc05208e7c03b78eb11fafceaac7d1917db5db58","target":"record","created_at":"2026-05-18T01:08:21Z","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":"f010ec53799a42ae7c87e99be568d7259c02bc05826a0616a56f117425849cda","cross_cats_sorted":["cs.DC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-30T21:17:59Z","title_canon_sha256":"04902375044ed019f04cb6874a0e7f4d1c761722a517250587058b71ce18da85"},"schema_version":"1.0","source":{"id":"1212.0017","kind":"arxiv","version":2}},"canonical_sha256":"1565c9a4941d920099f591a0fb451b8bcce3816282a9095f7ab24526d13f40f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1565c9a4941d920099f591a0fb451b8bcce3816282a9095f7ab24526d13f40f4","first_computed_at":"2026-05-18T01:08:21.673272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:21.673272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L606sgXl6wx4ZhMGLaidHBKJ7vgLxXFeqd10/o443uyN7wqyJ20LTFePGxiX0Ev9LUWLQl1etFj1q/u8PGn8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:21.674061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f12fb315aea6406bc3c12772bc05208e7c03b78eb11fafceaac7d1917db5db58","sha256:c2ea1b30941eaece2f88ee639c8a2a274548f1759e25a30b30f8d666e8d19c64"],"state_sha256":"a39eee1aaee161862d49d2a90c6e7d92408eaa22a6a1e73831bead1b8b14fe91"}