{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N2TGOQDF5UZSWY5Q4T7GGKDKQW","short_pith_number":"pith:N2TGOQDF","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"},"canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","source":{"kind":"arxiv","id":"1510.04233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04233","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04233v1","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04233","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"N2TGOQDF5UZS","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2TGOQDF5UZSWY5Q","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2TGOQDF","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N2TGOQDF5UZSWY5Q4T7GGKDKQW","target":"record","payload":{"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"},"canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","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"},"source_kind":"arxiv","source_id":"1510.04233","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-18T01:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQ63BxONBiSqIIOFCK3ICX1Rosf9kCtqqRSaPT6sIOwzwf0ox6QAy5bkOgRJk3b1Qs1pNVvjGA/+fWIJULAECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:30:05.154719Z"},"content_sha256":"d38181973aa1fe485b4feabcb18434a4413458f60d3bfc4a05ef110b9002e9df","schema_version":"1.0","event_id":"sha256:d38181973aa1fe485b4feabcb18434a4413458f60d3bfc4a05ef110b9002e9df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N2TGOQDF5UZSWY5Q4T7GGKDKQW","target":"graph","payload":{"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"},"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-18T01:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uF1fbjaXGgxOgG8aimsIzf7vqZTdF0YbfOsh8P9C54JS4WOR94kCMdwozY4cWc5ZPYSFyNQPuuruCMCZjA05BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:30:05.155443Z"},"content_sha256":"5706e1583fec4458c7eba5e42b96711a04f387d27fc50f32c041f43f56a11b77","schema_version":"1.0","event_id":"sha256:5706e1583fec4458c7eba5e42b96711a04f387d27fc50f32c041f43f56a11b77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/bundle.json","state_url":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/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-05-30T22:30:05Z","links":{"resolver":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW","bundle":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/bundle.json","state":"https://pith.science/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2TGOQDF5UZSWY5Q4T7GGKDKQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N2TGOQDF5UZSWY5Q4T7GGKDKQW","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":"857d6b1a599dadb7613ec529f6b871e2efcdd95f9b3b9c6ad9e53696f7799d93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-14T18:37:30Z","title_canon_sha256":"ed782fa46804a78c13a8af22705f5bea1cd4d471d36daa6158c4fc8de178afaf"},"schema_version":"1.0","source":{"id":"1510.04233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04233","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04233v1","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04233","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"N2TGOQDF5UZS","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2TGOQDF5UZSWY5Q","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2TGOQDF","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:5706e1583fec4458c7eba5e42b96711a04f387d27fc50f32c041f43f56a11b77","target":"graph","created_at":"2026-05-18T01:30:08Z","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":"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","authors_text":"Alexandre J. Fonseca, Ashraf Aboulnaga, Carlos H. C. Teixeira, Georgos Siganos, Marco Serafini, Mohammed J. Zaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-14T18:37:30Z","title":"Arabesque: A System for Distributed Graph Mining - Extended version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04233","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:d38181973aa1fe485b4feabcb18434a4413458f60d3bfc4a05ef110b9002e9df","target":"record","created_at":"2026-05-18T01:30:08Z","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":"857d6b1a599dadb7613ec529f6b871e2efcdd95f9b3b9c6ad9e53696f7799d93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-14T18:37:30Z","title_canon_sha256":"ed782fa46804a78c13a8af22705f5bea1cd4d471d36daa6158c4fc8de178afaf"},"schema_version":"1.0","source":{"id":"1510.04233","kind":"arxiv","version":1}},"canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ea6674065ed332b63b0e4fe63286a85a953767f800da5ad7d788b95d31ef74c","first_computed_at":"2026-05-18T01:30:08.838272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:08.838272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H6wk9XpzzRUpLTVi4fJnddapxodFcF/YHjqOnTHbWQWzQ1jRlj0QUG8vyYwTshw0w3XzHtcQQ+6aLEpEkxC1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:08.838894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d38181973aa1fe485b4feabcb18434a4413458f60d3bfc4a05ef110b9002e9df","sha256:5706e1583fec4458c7eba5e42b96711a04f387d27fc50f32c041f43f56a11b77"],"state_sha256":"f1a4e768a5b17275c082894930d6e4053f026c67ded162f4e6f2f6ca4c970c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRqyAVp0pZSoHzvYTiEkXyuJ+wUBwi/QN19kDAUHFSfVyF2xZ7acwRCLo74DyX4V2syCdMLi4tN6IIhBnQs5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:30:05.159071Z","bundle_sha256":"263cac478c6946e2527abdb238e630fd5c0ab0e7a60b986761a5ba70ac462704"}}