{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:OGYXAUO4J5FLSXYE43NHDYHTED","short_pith_number":"pith:OGYXAUO4","canonical_record":{"source":{"id":"2011.03135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-05T23:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"b40c7c6db6824f55c7b2966f8b03794e41bd41cd6ba340ade001cab466419322","abstract_canon_sha256":"4400fdc4067fafee6b3c3bdf64f83399c24558617db848ed4a75126d0f6b85dc"},"schema_version":"1.0"},"canonical_sha256":"71b17051dc4f4ab95f04e6da71e0f320d575d0dd015641a8bb021051eb4a8d83","source":{"kind":"arxiv","id":"2011.03135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03135","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03135v1","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03135","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"OGYXAUO4J5FL","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"OGYXAUO4J5FLSXYE","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"OGYXAUO4","created_at":"2026-07-05T01:49:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:OGYXAUO4J5FLSXYE43NHDYHTED","target":"record","payload":{"canonical_record":{"source":{"id":"2011.03135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-05T23:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"b40c7c6db6824f55c7b2966f8b03794e41bd41cd6ba340ade001cab466419322","abstract_canon_sha256":"4400fdc4067fafee6b3c3bdf64f83399c24558617db848ed4a75126d0f6b85dc"},"schema_version":"1.0"},"canonical_sha256":"71b17051dc4f4ab95f04e6da71e0f320d575d0dd015641a8bb021051eb4a8d83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:40.355415Z","signature_b64":"4htutZT3yJ6uBRZmugf9PBFOO7/HjIi+rfh9UrhpaK7Kdp6IaUN21mO4E6fIl0hdeagk/MK5Fo+t/gdDTuAqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b17051dc4f4ab95f04e6da71e0f320d575d0dd015641a8bb021051eb4a8d83","last_reissued_at":"2026-07-05T01:49:40.354993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:40.354993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.03135","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-07-05T01:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXbKSBDVBr0PIsZwoMWEZqJFekQmQKTpRprxAGo1f5lDq7s0E1e1RD2JUZImmyibqnYtwQpqCgipEBeLMgrRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:00:36.280601Z"},"content_sha256":"63c5b0192d0f5eabf33db453c0eeff1fe6e53a929feaaf861872afc958154d66","schema_version":"1.0","event_id":"sha256:63c5b0192d0f5eabf33db453c0eeff1fe6e53a929feaaf861872afc958154d66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:OGYXAUO4J5FLSXYE43NHDYHTED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sandslash: A Two-Level Framework for Efficient Graph Pattern Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gurbinder Gill, Keshav Pingali, Loc Hoang, Roshan Dathathri, Xuhao Chen","submitted_at":"2020-11-05T23:13:29Z","abstract_excerpt":"Graph pattern mining (GPM) is used in diverse application areas including social network analysis, bioinformatics, and chemical engineering. Existing GPM frameworks either provide high-level interfaces for productivity at the cost of expressiveness or provide low-level interfaces that can express a wide variety of GPM algorithms at the cost of increased programming complexity. Moreover, existing systems lack the flexibility to explore combinations of optimizations to achieve performance competitive with hand-optimized applications.\n  We present Sandslash, an in-memory Graph Pattern Mining (GPM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03135","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03135/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBlArSuGIZGTHqnDCjteGXbkecXuLaei/daOCbjC23yxAAz1IhNT9NPn169RTONnQVUTzMIsS9KMtE0W31LxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:00:36.283659Z"},"content_sha256":"857f253f06b7de578be959d83f4b0c976956e2861c5ce7770fe24b90a0da75a8","schema_version":"1.0","event_id":"sha256:857f253f06b7de578be959d83f4b0c976956e2861c5ce7770fe24b90a0da75a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGYXAUO4J5FLSXYE43NHDYHTED/bundle.json","state_url":"https://pith.science/pith/OGYXAUO4J5FLSXYE43NHDYHTED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGYXAUO4J5FLSXYE43NHDYHTED/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-08-17T14:00:36Z","links":{"resolver":"https://pith.science/pith/OGYXAUO4J5FLSXYE43NHDYHTED","bundle":"https://pith.science/pith/OGYXAUO4J5FLSXYE43NHDYHTED/bundle.json","state":"https://pith.science/pith/OGYXAUO4J5FLSXYE43NHDYHTED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGYXAUO4J5FLSXYE43NHDYHTED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OGYXAUO4J5FLSXYE43NHDYHTED","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":"4400fdc4067fafee6b3c3bdf64f83399c24558617db848ed4a75126d0f6b85dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-05T23:13:29Z","title_canon_sha256":"b40c7c6db6824f55c7b2966f8b03794e41bd41cd6ba340ade001cab466419322"},"schema_version":"1.0","source":{"id":"2011.03135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03135","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03135v1","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03135","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"OGYXAUO4J5FL","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"OGYXAUO4J5FLSXYE","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"OGYXAUO4","created_at":"2026-07-05T01:49:40Z"}],"graph_snapshots":[{"event_id":"sha256:857f253f06b7de578be959d83f4b0c976956e2861c5ce7770fe24b90a0da75a8","target":"graph","created_at":"2026-07-05T01:49:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.03135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph pattern mining (GPM) is used in diverse application areas including social network analysis, bioinformatics, and chemical engineering. Existing GPM frameworks either provide high-level interfaces for productivity at the cost of expressiveness or provide low-level interfaces that can express a wide variety of GPM algorithms at the cost of increased programming complexity. Moreover, existing systems lack the flexibility to explore combinations of optimizations to achieve performance competitive with hand-optimized applications.\n  We present Sandslash, an in-memory Graph Pattern Mining (GPM","authors_text":"Gurbinder Gill, Keshav Pingali, Loc Hoang, Roshan Dathathri, Xuhao Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-05T23:13:29Z","title":"Sandslash: A Two-Level Framework for Efficient Graph Pattern Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03135","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:63c5b0192d0f5eabf33db453c0eeff1fe6e53a929feaaf861872afc958154d66","target":"record","created_at":"2026-07-05T01:49:40Z","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":"4400fdc4067fafee6b3c3bdf64f83399c24558617db848ed4a75126d0f6b85dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-05T23:13:29Z","title_canon_sha256":"b40c7c6db6824f55c7b2966f8b03794e41bd41cd6ba340ade001cab466419322"},"schema_version":"1.0","source":{"id":"2011.03135","kind":"arxiv","version":1}},"canonical_sha256":"71b17051dc4f4ab95f04e6da71e0f320d575d0dd015641a8bb021051eb4a8d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71b17051dc4f4ab95f04e6da71e0f320d575d0dd015641a8bb021051eb4a8d83","first_computed_at":"2026-07-05T01:49:40.354993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:49:40.354993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4htutZT3yJ6uBRZmugf9PBFOO7/HjIi+rfh9UrhpaK7Kdp6IaUN21mO4E6fIl0hdeagk/MK5Fo+t/gdDTuAqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:49:40.355415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63c5b0192d0f5eabf33db453c0eeff1fe6e53a929feaaf861872afc958154d66","sha256:857f253f06b7de578be959d83f4b0c976956e2861c5ce7770fe24b90a0da75a8"],"state_sha256":"1741212842755f8244312610be9727c3ded34ae57b370968bf9e6a63f9fca3ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mXnjXWb017+naHj/OvNRSHbqVY/L+NX8VoVFozXA9Lk6Q4ajik6IETN0azo+Nl3TbkknSqpoVbaG3lvi1sxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T14:00:36.364454Z","bundle_sha256":"a9c4cd8f7f184b87628e0a5f0684397ef7e414ff47acaaa3687d31a18bc62024"}}