{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PMHDAYDAJW6KY2T2USJZ22S2FN","short_pith_number":"pith:PMHDAYDA","schema_version":"1.0","canonical_sha256":"7b0e3060604dbcac6a7aa4939d6a5a2b6be3c487a5a5db8a0ebef934cd6912e1","source":{"kind":"arxiv","id":"1602.03072","version":1},"attestation_state":"computed","paper":{"title":"Big Graph Mining: Frameworks and Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Engelbert Mephu Nguifo, Sabeur Aridhi","submitted_at":"2016-02-09T16:53:08Z","abstract_excerpt":"Big graph mining is an important research area and it has attracted considerable attention. It allows to process, analyze, and extract meaningful information from large amounts of graph data. Big graph mining has been highly motivated not only by the tremendously increasing size of graphs but also by its huge number of applications. Such applications include bioinformatics, chemoinformatics and social networks. One of the most challenging tasks in big graph mining is pattern mining in big graphs. This task consists on using data mining algorithms to discover interesting, unexpected and useful "},"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":"1602.03072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-09T16:53:08Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e21cf07e6644df915da051cf7d4320695d8c1c3df7c8aa56f7f9e2e91659a6df","abstract_canon_sha256":"90d7d1f62ecf108e9446734e7b082f34bff115f1020f67dd401fb6d18567b8f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.965159Z","signature_b64":"HRxQmpDt7JkoMymCPmZe5Ou2f2x1gzYHVI7E1wEdJURfTo9IlQrj7flE68ZC8jUPscUCPyhg2mBt5PhDlV55BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b0e3060604dbcac6a7aa4939d6a5a2b6be3c487a5a5db8a0ebef934cd6912e1","last_reissued_at":"2026-05-18T00:16:50.964428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.964428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Big Graph Mining: Frameworks and Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Engelbert Mephu Nguifo, Sabeur Aridhi","submitted_at":"2016-02-09T16:53:08Z","abstract_excerpt":"Big graph mining is an important research area and it has attracted considerable attention. It allows to process, analyze, and extract meaningful information from large amounts of graph data. Big graph mining has been highly motivated not only by the tremendously increasing size of graphs but also by its huge number of applications. Such applications include bioinformatics, chemoinformatics and social networks. One of the most challenging tasks in big graph mining is pattern mining in big graphs. This task consists on using data mining algorithms to discover interesting, unexpected and useful "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03072","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.03072","created_at":"2026-05-18T00:16:50.964547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03072v1","created_at":"2026-05-18T00:16:50.964547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03072","created_at":"2026-05-18T00:16:50.964547+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMHDAYDAJW6K","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMHDAYDAJW6KY2T2","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMHDAYDA","created_at":"2026-05-18T12:30:39.010887+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/PMHDAYDAJW6KY2T2USJZ22S2FN","json":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN.json","graph_json":"https://pith.science/api/pith-number/PMHDAYDAJW6KY2T2USJZ22S2FN/graph.json","events_json":"https://pith.science/api/pith-number/PMHDAYDAJW6KY2T2USJZ22S2FN/events.json","paper":"https://pith.science/paper/PMHDAYDA"},"agent_actions":{"view_html":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN","download_json":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN.json","view_paper":"https://pith.science/paper/PMHDAYDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03072&json=true","fetch_graph":"https://pith.science/api/pith-number/PMHDAYDAJW6KY2T2USJZ22S2FN/graph.json","fetch_events":"https://pith.science/api/pith-number/PMHDAYDAJW6KY2T2USJZ22S2FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN/action/storage_attestation","attest_author":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN/action/author_attestation","sign_citation":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN/action/citation_signature","submit_replication":"https://pith.science/pith/PMHDAYDAJW6KY2T2USJZ22S2FN/action/replication_record"}},"created_at":"2026-05-18T00:16:50.964547+00:00","updated_at":"2026-05-18T00:16:50.964547+00:00"}