{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SP5UABYA7ZQBJBL2WRBRCUAAP4","short_pith_number":"pith:SP5UABYA","canonical_record":{"source":{"id":"2101.07690","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-01-19T15:35:24Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"283ab082917d8d35edbfd1e72646d9ca30259c4bde24427af88a48f93c3f8986","abstract_canon_sha256":"5ad4cab1c553fb9f5649e63c33413d0bcbd646522dcebc6ca8c881564c1683c4"},"schema_version":"1.0"},"canonical_sha256":"93fb400700fe6014857ab4431150007f37e2de53256ae56e92dd28b3ac1fd388","source":{"kind":"arxiv","id":"2101.07690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07690","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07690v2","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07690","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"SP5UABYA7ZQB","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"SP5UABYA7ZQBJBL2","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"SP5UABYA","created_at":"2026-07-05T02:13:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SP5UABYA7ZQBJBL2WRBRCUAAP4","target":"record","payload":{"canonical_record":{"source":{"id":"2101.07690","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-01-19T15:35:24Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"283ab082917d8d35edbfd1e72646d9ca30259c4bde24427af88a48f93c3f8986","abstract_canon_sha256":"5ad4cab1c553fb9f5649e63c33413d0bcbd646522dcebc6ca8c881564c1683c4"},"schema_version":"1.0"},"canonical_sha256":"93fb400700fe6014857ab4431150007f37e2de53256ae56e92dd28b3ac1fd388","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:21.801733Z","signature_b64":"xdiROYoDeQPFFyQV5vbV2ZqzoUaBUSVE/If79vn80crnNngn+nkEfusZil+wPwaTyjY/detzMWVSnWci7js7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93fb400700fe6014857ab4431150007f37e2de53256ae56e92dd28b3ac1fd388","last_reissued_at":"2026-07-05T02:13:21.801366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:21.801366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.07690","source_version":2,"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-05T02:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1OyZZH8HbH4lL5qtGu+bmLTx5hQMdzlW14fy8ZLLgQwdwFPJn6ywcS/2bzjRTsuoX+2ZwnpsF7CpWeIHDqRtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:50:09.854809Z"},"content_sha256":"fc6bca13aad4ab01a1585226442a224294137ad940403073aa5021a47f5c4d04","schema_version":"1.0","event_id":"sha256:fc6bca13aad4ab01a1585226442a224294137ad940403073aa5021a47f5c4d04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SP5UABYA7ZQBJBL2WRBRCUAAP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Mining of Frequent Subgraphs with Two-Vertex Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DB","authors_text":"Bo Wu, Peng Jiang, Rujia Wang","submitted_at":"2021-01-19T15:35:24Z","abstract_excerpt":"Frequent Subgraph Mining (FSM) is the key task in many graph mining and machine learning applications. Numerous systems have been proposed for FSM in the past decade. Although these systems show good performance for small patterns (with no more than four vertices), we found that they have difficulty in mining larger patterns. In this work, we propose a novel two-vertex exploration strategy to accelerate the mining process. Compared with the single-vertex exploration adopted by previous systems, our two-vertex exploration avoids the large memory consumption issue and significantly reduces the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07690","kind":"arxiv","version":2},"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/2101.07690/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-05T02:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7NXaKeKgepDzP0ivaZvhKO2RPsgZNvJnsUDAf3UvpHKW/pY4mQ9w6QOkTy807wYPh6KpvL4d2EfXVZU2uKRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:50:09.855721Z"},"content_sha256":"c13ac2cc412bccadc8cdf84b258f5c2942d009c303c3b4fd00c6a5ddd3ea3822","schema_version":"1.0","event_id":"sha256:c13ac2cc412bccadc8cdf84b258f5c2942d009c303c3b4fd00c6a5ddd3ea3822"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/bundle.json","state_url":"https://pith.science/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/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-07T00:50:09Z","links":{"resolver":"https://pith.science/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4","bundle":"https://pith.science/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/bundle.json","state":"https://pith.science/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SP5UABYA7ZQBJBL2WRBRCUAAP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SP5UABYA7ZQBJBL2WRBRCUAAP4","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":"5ad4cab1c553fb9f5649e63c33413d0bcbd646522dcebc6ca8c881564c1683c4","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-01-19T15:35:24Z","title_canon_sha256":"283ab082917d8d35edbfd1e72646d9ca30259c4bde24427af88a48f93c3f8986"},"schema_version":"1.0","source":{"id":"2101.07690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07690","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07690v2","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07690","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"SP5UABYA7ZQB","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"SP5UABYA7ZQBJBL2","created_at":"2026-07-05T02:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"SP5UABYA","created_at":"2026-07-05T02:13:21Z"}],"graph_snapshots":[{"event_id":"sha256:c13ac2cc412bccadc8cdf84b258f5c2942d009c303c3b4fd00c6a5ddd3ea3822","target":"graph","created_at":"2026-07-05T02:13: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.07690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Frequent Subgraph Mining (FSM) is the key task in many graph mining and machine learning applications. Numerous systems have been proposed for FSM in the past decade. Although these systems show good performance for small patterns (with no more than four vertices), we found that they have difficulty in mining larger patterns. In this work, we propose a novel two-vertex exploration strategy to accelerate the mining process. Compared with the single-vertex exploration adopted by previous systems, our two-vertex exploration avoids the large memory consumption issue and significantly reduces the m","authors_text":"Bo Wu, Peng Jiang, Rujia Wang","cross_cats":["cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-01-19T15:35:24Z","title":"Efficient Mining of Frequent Subgraphs with Two-Vertex Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07690","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:fc6bca13aad4ab01a1585226442a224294137ad940403073aa5021a47f5c4d04","target":"record","created_at":"2026-07-05T02:13: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":"5ad4cab1c553fb9f5649e63c33413d0bcbd646522dcebc6ca8c881564c1683c4","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-01-19T15:35:24Z","title_canon_sha256":"283ab082917d8d35edbfd1e72646d9ca30259c4bde24427af88a48f93c3f8986"},"schema_version":"1.0","source":{"id":"2101.07690","kind":"arxiv","version":2}},"canonical_sha256":"93fb400700fe6014857ab4431150007f37e2de53256ae56e92dd28b3ac1fd388","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93fb400700fe6014857ab4431150007f37e2de53256ae56e92dd28b3ac1fd388","first_computed_at":"2026-07-05T02:13:21.801366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:13:21.801366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xdiROYoDeQPFFyQV5vbV2ZqzoUaBUSVE/If79vn80crnNngn+nkEfusZil+wPwaTyjY/detzMWVSnWci7js7BA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:13:21.801733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.07690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6bca13aad4ab01a1585226442a224294137ad940403073aa5021a47f5c4d04","sha256:c13ac2cc412bccadc8cdf84b258f5c2942d009c303c3b4fd00c6a5ddd3ea3822"],"state_sha256":"548090e7475e7c3378afe785808ef0f2ec2592d9af20c321a18c87ae7b4b4386"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKcmndXnxroY/hSWfSsSrgVhCz8pcX9dKex1B09x1FtGuPIQuOi6tHLbric0h0ujRVDJUcfNzi6s5tqSNP65CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:50:09.863404Z","bundle_sha256":"7bc4fd015d2b73e5411dca703b64dd0009d94f9e3924dc8c553292981025e8c0"}}