{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N2TGOQDF5UZSWY5Q4T7GGKDKQW","short_pith_number":"pith:N2TGOQDF","schema_version":"1.0","canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","source":{"kind":"arxiv","id":"1510.04233","version":1},"attestation_state":"computed","paper":{"title":"Arabesque: A System for Distributed Graph Mining - Extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre J. Fonseca, Ashraf Aboulnaga, Carlos H. C. Teixeira, Georgos Siganos, Marco Serafini, Mohammed J. Zaki","submitted_at":"2015-10-14T18:37:30Z","abstract_excerpt":"Distributed data processing platforms such as MapReduce and Pregel have substantially simplified the design and deployment of certain classes of distributed graph analytics algorithms. However, these platforms do not represent a good match for distributed graph mining problems, as for example finding frequent subgraphs in a graph. Given an input graph, these problems require exploring a very large number of subgraphs and finding patterns that match some \"interestingness\" criteria desired by the user. These algorithms are very important for areas such as social net- works, semantic web, and bio"},"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":"1510.04233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-14T18:37:30Z","cross_cats_sorted":[],"title_canon_sha256":"ed782fa46804a78c13a8af22705f5bea1cd4d471d36daa6158c4fc8de178afaf","abstract_canon_sha256":"857d6b1a599dadb7613ec529f6b871e2efcdd95f9b3b9c6ad9e53696f7799d93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:08.838894Z","signature_b64":"H6wk9XpzzRUpLTVi4fJnddapxodFcF/YHjqOnTHbWQWzQ1jRlj0QUG8vyYwTshw0w3XzHtcQQ+6aLEpEkxC1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","last_reissued_at":"2026-05-18T01:30:08.838272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:08.838272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arabesque: A System for Distributed Graph Mining - Extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre J. Fonseca, Ashraf Aboulnaga, Carlos H. C. Teixeira, Georgos Siganos, Marco Serafini, Mohammed J. Zaki","submitted_at":"2015-10-14T18:37:30Z","abstract_excerpt":"Distributed data processing platforms such as MapReduce and Pregel have substantially simplified the design and deployment of certain classes of distributed graph analytics algorithms. However, these platforms do not represent a good match for distributed graph mining problems, as for example finding frequent subgraphs in a graph. Given an input graph, these problems require exploring a very large number of subgraphs and finding patterns that match some \"interestingness\" criteria desired by the user. These algorithms are very important for areas such as social net- works, semantic web, and bio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04233","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":"1510.04233","created_at":"2026-05-18T01:30:08.838363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04233v1","created_at":"2026-05-18T01:30:08.838363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04233","created_at":"2026-05-18T01:30:08.838363+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2TGOQDF5UZS","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2TGOQDF5UZSWY5Q","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2TGOQDF","created_at":"2026-05-18T12:29:32.376354+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/N2TGOQDF5UZSWY5Q4T7GGKDKQW","json":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW.json","graph_json":"https://pith.science/api/pith-number/N2TGOQDF5UZSWY5Q4T7GGKDKQW/graph.json","events_json":"https://pith.science/api/pith-number/N2TGOQDF5UZSWY5Q4T7GGKDKQW/events.json","paper":"https://pith.science/paper/N2TGOQDF"},"agent_actions":{"view_html":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW","download_json":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW.json","view_paper":"https://pith.science/paper/N2TGOQDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04233&json=true","fetch_graph":"https://pith.science/api/pith-number/N2TGOQDF5UZSWY5Q4T7GGKDKQW/graph.json","fetch_events":"https://pith.science/api/pith-number/N2TGOQDF5UZSWY5Q4T7GGKDKQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/action/storage_attestation","attest_author":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/action/author_attestation","sign_citation":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/action/citation_signature","submit_replication":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/action/replication_record"}},"created_at":"2026-05-18T01:30:08.838363+00:00","updated_at":"2026-05-18T01:30:08.838363+00:00"}