{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FBY4GGG5A4MDYHU57L657JAD5L","short_pith_number":"pith:FBY4GGG5","canonical_record":{"source":{"id":"1305.3082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-14T09:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"b8bcd2c03c6a46497167d290be8108d641c96b7cac8948c8991c8bd6899f8686","abstract_canon_sha256":"1a34bbad403898798e8e9d5c2ce4e01dace48ff1b9e2d50bc74440d4a2263d97"},"schema_version":"1.0"},"canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","source":{"kind":"arxiv","id":"1305.3082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3082","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3082v1","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3082","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"FBY4GGG5A4MD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBY4GGG5A4MDYHU5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBY4GGG5","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FBY4GGG5A4MDYHU57L657JAD5L","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-14T09:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"b8bcd2c03c6a46497167d290be8108d641c96b7cac8948c8991c8bd6899f8686","abstract_canon_sha256":"1a34bbad403898798e8e9d5c2ce4e01dace48ff1b9e2d50bc74440d4a2263d97"},"schema_version":"1.0"},"canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:35.924588Z","signature_b64":"jozLTax/AhwG9oeJOQrFx4bMgFlsStslWd72rI06zK9AiWiSkdUW7chwQDNGG7/SPBuCLCDYHnvgUApRDLGjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","last_reissued_at":"2026-05-18T03:17:35.924023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:35.924023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3082","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-18T03:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwgmNDF50gFG2Jqy0FQnvofZbuj7YoEbxm0886/7Xin4yL8SAagxswqmHBBpJd80qTQhRQA17mnThN4D8lGtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:54:08.468812Z"},"content_sha256":"4abf33839ccd36d34800d6b7a12770bfd95d49cba8c72f60b0306582839d292b","schema_version":"1.0","event_id":"sha256:4abf33839ccd36d34800d6b7a12770bfd95d49cba8c72f60b0306582839d292b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FBY4GGG5A4MDYHU57L657JAD5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Frequent Neighborhood Patterns in Large Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jialong Han, Ji-Rong Wen","submitted_at":"2013-05-14T09:46:17Z","abstract_excerpt":"Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely heavily on the downward-closure property (DCP) of the support measure to ensure an efficient pruning of the candidate patterns. When switching to the emerging scenario of single-graph databases such as Google Knowledge Graph and Facebook social graph, the traditional support measure turns out to be trivial (either 0 or 1). However, to the best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3082","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-18T03:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aduc+ywNwwMMVKI08AH/KpDvSIRT7U/x9YCRGggEA2gEesLA3obxO1qz6BCXmkimqfk52arnNMt83pC4BJhSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:54:08.469498Z"},"content_sha256":"5419c701b94acb90511b416292654295d50e82cbf12c6773d020d3ef943f2a2f","schema_version":"1.0","event_id":"sha256:5419c701b94acb90511b416292654295d50e82cbf12c6773d020d3ef943f2a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/bundle.json","state_url":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBY4GGG5A4MDYHU57L657JAD5L/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-26T16:54:08Z","links":{"resolver":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L","bundle":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/bundle.json","state":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBY4GGG5A4MDYHU57L657JAD5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FBY4GGG5A4MDYHU57L657JAD5L","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":"1a34bbad403898798e8e9d5c2ce4e01dace48ff1b9e2d50bc74440d4a2263d97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-14T09:46:17Z","title_canon_sha256":"b8bcd2c03c6a46497167d290be8108d641c96b7cac8948c8991c8bd6899f8686"},"schema_version":"1.0","source":{"id":"1305.3082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3082","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3082v1","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3082","created_at":"2026-05-18T03:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"FBY4GGG5A4MD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBY4GGG5A4MDYHU5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBY4GGG5","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:5419c701b94acb90511b416292654295d50e82cbf12c6773d020d3ef943f2a2f","target":"graph","created_at":"2026-05-18T03:17:35Z","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":"Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely heavily on the downward-closure property (DCP) of the support measure to ensure an efficient pruning of the candidate patterns. When switching to the emerging scenario of single-graph databases such as Google Knowledge Graph and Facebook social graph, the traditional support measure turns out to be trivial (either 0 or 1). However, to the best","authors_text":"Jialong Han, Ji-Rong Wen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-14T09:46:17Z","title":"Mining Frequent Neighborhood Patterns in Large Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3082","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:4abf33839ccd36d34800d6b7a12770bfd95d49cba8c72f60b0306582839d292b","target":"record","created_at":"2026-05-18T03:17:35Z","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":"1a34bbad403898798e8e9d5c2ce4e01dace48ff1b9e2d50bc74440d4a2263d97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-14T09:46:17Z","title_canon_sha256":"b8bcd2c03c6a46497167d290be8108d641c96b7cac8948c8991c8bd6899f8686"},"schema_version":"1.0","source":{"id":"1305.3082","kind":"arxiv","version":1}},"canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","first_computed_at":"2026-05-18T03:17:35.924023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:35.924023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jozLTax/AhwG9oeJOQrFx4bMgFlsStslWd72rI06zK9AiWiSkdUW7chwQDNGG7/SPBuCLCDYHnvgUApRDLGjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:35.924588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4abf33839ccd36d34800d6b7a12770bfd95d49cba8c72f60b0306582839d292b","sha256:5419c701b94acb90511b416292654295d50e82cbf12c6773d020d3ef943f2a2f"],"state_sha256":"78bb34df3d29b464dbb7ca512cc1bf9356744866d39e7131066aa44a307b01ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE0O3oL9MS3xH5ENdwTY9Qf0BtNSuZDo9oaMZtW94Wed7qmdxslgy6rfAGzLpqrhBmVLF1URwk6d24d+Ik9IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:54:08.473086Z","bundle_sha256":"5563dd27613787ab00858a691d296f498fbc0d039352704d1bd472ce401793f5"}}