{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O2PVLMZ725CM7TN25T6M7UHGSY","short_pith_number":"pith:O2PVLMZ7","schema_version":"1.0","canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","source":{"kind":"arxiv","id":"1810.03078","version":1},"attestation_state":"computed","paper":{"title":"Graphlet Count Estimation via Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"John C.S. Lui, Konstantin Avrachenkov, Xutong Liu, Yu-Zhen Janice Chen","submitted_at":"2018-10-07T03:31:10Z","abstract_excerpt":"Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, is a signature which characterizes the local network structure of a given graph. Graphlet count plays a prominent role in network analysis of many fields, most notably bioinformatics and social science.\n  However, computing exact graphlet count is inherently difficult and computat"},"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":"1810.03078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-07T03:31:10Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"5532900e29312ee4243b0fc0851ec691571f2437b2389cc9cafb2eca9474e96a","abstract_canon_sha256":"c61206a2f67b8ac11e506c71efb7def66bffe1ff122edb228b150707d2403134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:54.603409Z","signature_b64":"rl2Ek655lJjTBwWIP5CYGEuXYmn+jVpQQvzs90UPzHUVTJUUPVa+AcIA2h2RgUTX3cbFX/KNDSH27CxTgXAMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","last_reissued_at":"2026-05-18T00:03:54.602762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:54.602762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphlet Count Estimation via Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"John C.S. Lui, Konstantin Avrachenkov, Xutong Liu, Yu-Zhen Janice Chen","submitted_at":"2018-10-07T03:31:10Z","abstract_excerpt":"Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, is a signature which characterizes the local network structure of a given graph. Graphlet count plays a prominent role in network analysis of many fields, most notably bioinformatics and social science.\n  However, computing exact graphlet count is inherently difficult and computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03078","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":"1810.03078","created_at":"2026-05-18T00:03:54.602870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03078v1","created_at":"2026-05-18T00:03:54.602870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03078","created_at":"2026-05-18T00:03:54.602870+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2PVLMZ725CM","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2PVLMZ725CM7TN2","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2PVLMZ7","created_at":"2026-05-18T12:32:40.477152+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/O2PVLMZ725CM7TN25T6M7UHGSY","json":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY.json","graph_json":"https://pith.science/api/pith-number/O2PVLMZ725CM7TN25T6M7UHGSY/graph.json","events_json":"https://pith.science/api/pith-number/O2PVLMZ725CM7TN25T6M7UHGSY/events.json","paper":"https://pith.science/paper/O2PVLMZ7"},"agent_actions":{"view_html":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY","download_json":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY.json","view_paper":"https://pith.science/paper/O2PVLMZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03078&json=true","fetch_graph":"https://pith.science/api/pith-number/O2PVLMZ725CM7TN25T6M7UHGSY/graph.json","fetch_events":"https://pith.science/api/pith-number/O2PVLMZ725CM7TN25T6M7UHGSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/action/storage_attestation","attest_author":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/action/author_attestation","sign_citation":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/action/citation_signature","submit_replication":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/action/replication_record"}},"created_at":"2026-05-18T00:03:54.602870+00:00","updated_at":"2026-05-18T00:03:54.602870+00:00"}