{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FBY4GGG5A4MDYHU57L657JAD5L","short_pith_number":"pith:FBY4GGG5","schema_version":"1.0","canonical_sha256":"2871c318dd07183c1e9dfafddfa403eac298c32d26c4060936e8daa08eaa6fdc","source":{"kind":"arxiv","id":"1305.3082","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.3082","created_at":"2026-05-18T03:17:35.924108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3082v1","created_at":"2026-05-18T03:17:35.924108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3082","created_at":"2026-05-18T03:17:35.924108+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBY4GGG5A4MD","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBY4GGG5A4MDYHU5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBY4GGG5","created_at":"2026-05-18T12:27:45.050594+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/FBY4GGG5A4MDYHU57L657JAD5L","json":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L.json","graph_json":"https://pith.science/api/pith-number/FBY4GGG5A4MDYHU57L657JAD5L/graph.json","events_json":"https://pith.science/api/pith-number/FBY4GGG5A4MDYHU57L657JAD5L/events.json","paper":"https://pith.science/paper/FBY4GGG5"},"agent_actions":{"view_html":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L","download_json":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L.json","view_paper":"https://pith.science/paper/FBY4GGG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3082&json=true","fetch_graph":"https://pith.science/api/pith-number/FBY4GGG5A4MDYHU57L657JAD5L/graph.json","fetch_events":"https://pith.science/api/pith-number/FBY4GGG5A4MDYHU57L657JAD5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/action/storage_attestation","attest_author":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/action/author_attestation","sign_citation":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/action/citation_signature","submit_replication":"https://pith.science/pith/FBY4GGG5A4MDYHU57L657JAD5L/action/replication_record"}},"created_at":"2026-05-18T03:17:35.924108+00:00","updated_at":"2026-05-18T03:17:35.924108+00:00"}