{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O2PVLMZ725CM7TN25T6M7UHGSY","short_pith_number":"pith:O2PVLMZ7","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"},"canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","source":{"kind":"arxiv","id":"1810.03078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03078","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03078v1","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03078","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"O2PVLMZ725CM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2PVLMZ725CM7TN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2PVLMZ7","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O2PVLMZ725CM7TN25T6M7UHGSY","target":"record","payload":{"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"},"canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","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"},"source_kind":"arxiv","source_id":"1810.03078","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-18T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIl0NaOaCQz+8KW8W2zlSHbCQa3YzWYUC8qQQYMZEc8S0gRf/y7rrcmovduMyjcRTJEhve3+BGVouSXuN2kqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:05:32.604142Z"},"content_sha256":"54ff6a4094c7734f02a2d491c3f38b0895648baf407f997013d1c9c40cff777a","schema_version":"1.0","event_id":"sha256:54ff6a4094c7734f02a2d491c3f38b0895648baf407f997013d1c9c40cff777a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O2PVLMZ725CM7TN25T6M7UHGSY","target":"graph","payload":{"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"},"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-18T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7qPwzhzQodbASCy0z5MTQiItYZi7Xkvjbv98QqRK4kXi+VUwbiyhggXLQUqs/r5qYTudaGbsUBcy8sxaj1cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:05:32.604697Z"},"content_sha256":"b06c1d54029bebcbf544d9e04d7e7997c7e604b5a17717e29327f8310cbb7a30","schema_version":"1.0","event_id":"sha256:b06c1d54029bebcbf544d9e04d7e7997c7e604b5a17717e29327f8310cbb7a30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/bundle.json","state_url":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2PVLMZ725CM7TN25T6M7UHGSY/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-27T00:05:32Z","links":{"resolver":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY","bundle":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/bundle.json","state":"https://pith.science/pith/O2PVLMZ725CM7TN25T6M7UHGSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2PVLMZ725CM7TN25T6M7UHGSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O2PVLMZ725CM7TN25T6M7UHGSY","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":"c61206a2f67b8ac11e506c71efb7def66bffe1ff122edb228b150707d2403134","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-07T03:31:10Z","title_canon_sha256":"5532900e29312ee4243b0fc0851ec691571f2437b2389cc9cafb2eca9474e96a"},"schema_version":"1.0","source":{"id":"1810.03078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03078","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03078v1","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03078","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"O2PVLMZ725CM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2PVLMZ725CM7TN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2PVLMZ7","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b06c1d54029bebcbf544d9e04d7e7997c7e604b5a17717e29327f8310cbb7a30","target":"graph","created_at":"2026-05-18T00:03:54Z","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":"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","authors_text":"John C.S. Lui, Konstantin Avrachenkov, Xutong Liu, Yu-Zhen Janice Chen","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-07T03:31:10Z","title":"Graphlet Count Estimation via Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03078","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:54ff6a4094c7734f02a2d491c3f38b0895648baf407f997013d1c9c40cff777a","target":"record","created_at":"2026-05-18T00:03:54Z","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":"c61206a2f67b8ac11e506c71efb7def66bffe1ff122edb228b150707d2403134","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-07T03:31:10Z","title_canon_sha256":"5532900e29312ee4243b0fc0851ec691571f2437b2389cc9cafb2eca9474e96a"},"schema_version":"1.0","source":{"id":"1810.03078","kind":"arxiv","version":1}},"canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"769f55b33fd744cfcdbaecfccfd0e6961eba42ef03d70bca93c2feec70425327","first_computed_at":"2026-05-18T00:03:54.602762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:54.602762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rl2Ek655lJjTBwWIP5CYGEuXYmn+jVpQQvzs90UPzHUVTJUUPVa+AcIA2h2RgUTX3cbFX/KNDSH27CxTgXAMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:54.603409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54ff6a4094c7734f02a2d491c3f38b0895648baf407f997013d1c9c40cff777a","sha256:b06c1d54029bebcbf544d9e04d7e7997c7e604b5a17717e29327f8310cbb7a30"],"state_sha256":"867870223b34ef840d8aaeecbdcf87bec10718f282b79aae590da4aa1ca08c01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IezV+ySzkbYJxrRmY7o4u1UY9sw8XBZBZw7Cpx0ryGXVQShgayTqDzff40D29SocvYKzQEbtm6bgVin18LXoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:05:32.607275Z","bundle_sha256":"ff2e991c24ebd98cb40a5920e91a825f0e298520bc4ea6cb5eb6d68480ed77e0"}}