{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IDNX3VMN5EFNQOIWMSUFVAJRFT","short_pith_number":"pith:IDNX3VMN","canonical_record":{"source":{"id":"1604.08691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-29T05:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"314b28c1ad4ec165c4b8965eebe449dc461fa8c44d90c1fa0d912afe44729a23","abstract_canon_sha256":"fef9e5eb746cea3b5e19472f632261f50f35dd6a9650c2605afa1d2eda0a1429"},"schema_version":"1.0"},"canonical_sha256":"40db7dd58de90ad8391664a85a81312cfc1cae234cb0965fed0349ce7cea3fae","source":{"kind":"arxiv","id":"1604.08691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08691","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08691v1","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08691","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"IDNX3VMN5EFN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDNX3VMN5EFNQOIW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDNX3VMN","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IDNX3VMN5EFNQOIWMSUFVAJRFT","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-29T05:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"314b28c1ad4ec165c4b8965eebe449dc461fa8c44d90c1fa0d912afe44729a23","abstract_canon_sha256":"fef9e5eb746cea3b5e19472f632261f50f35dd6a9650c2605afa1d2eda0a1429"},"schema_version":"1.0"},"canonical_sha256":"40db7dd58de90ad8391664a85a81312cfc1cae234cb0965fed0349ce7cea3fae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.177420Z","signature_b64":"DJFhNvw3AIqJzWQywM+cguKsSPDbaLhF0bqfUyAnrD3RvnoD03gFaiovxIFOUrFijmXNzk5MU65VywUVwwN2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40db7dd58de90ad8391664a85a81312cfc1cae234cb0965fed0349ce7cea3fae","last_reissued_at":"2026-05-18T01:16:02.176683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.176683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08691","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-18T01:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+CBBXvwNzAj2GGWpbhQmAQlQuN55tHXzxXeUUUOfCOevr2erGkGWtkU/o8YreJjFfeDcDNdTGtwTqYJf19tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:40:19.246859Z"},"content_sha256":"26072a131b74670f2c8f360b3f69c74484565156490d3e45a0b37fd57eddeae1","schema_version":"1.0","event_id":"sha256:26072a131b74670f2c8f360b3f69c74484565156490d3e45a0b37fd57eddeae1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IDNX3VMN5EFNQOIWMSUFVAJRFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Don Towsley, Jiefeng Cheng, Jing Tao, John C.S. Lui, Junzhou Zhao, Pinghui Wang, Xiangliang Zhang, Xiaohong Guan, Zhenguo Li","submitted_at":"2016-04-29T05:24:24Z","abstract_excerpt":"Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number of instances a specific graphlet appears in a large graph (i.e., the total number of CISes isomorphic to the graphlet), little attention has been paid to characterizing a node's graphlet degree, i.e., the number of CISes isomorphic to the graphlet that include the node, which is an important metric for analyzing complex networks such as social and biological networks. Similar to global graphlet counting, it is challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08691","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-18T01:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fr1Qu47FZtjRpzNic3bZz/3DEKO9U8evr/HpeNpMfbPXZPzXNY7fyVp3YdZGdpulEOJ0NJtLNWKe2gOs1LZTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:40:19.247209Z"},"content_sha256":"974ca10fb78671f05339feaac4be8973707d24a5ff805cacc001f2f6e1bb1268","schema_version":"1.0","event_id":"sha256:974ca10fb78671f05339feaac4be8973707d24a5ff805cacc001f2f6e1bb1268"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/bundle.json","state_url":"https://pith.science/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/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-06-10T16:40:19Z","links":{"resolver":"https://pith.science/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT","bundle":"https://pith.science/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/bundle.json","state":"https://pith.science/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDNX3VMN5EFNQOIWMSUFVAJRFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IDNX3VMN5EFNQOIWMSUFVAJRFT","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":"fef9e5eb746cea3b5e19472f632261f50f35dd6a9650c2605afa1d2eda0a1429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-29T05:24:24Z","title_canon_sha256":"314b28c1ad4ec165c4b8965eebe449dc461fa8c44d90c1fa0d912afe44729a23"},"schema_version":"1.0","source":{"id":"1604.08691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08691","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08691v1","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08691","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"IDNX3VMN5EFN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDNX3VMN5EFNQOIW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDNX3VMN","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:974ca10fb78671f05339feaac4be8973707d24a5ff805cacc001f2f6e1bb1268","target":"graph","created_at":"2026-05-18T01:16:02Z","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":"Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number of instances a specific graphlet appears in a large graph (i.e., the total number of CISes isomorphic to the graphlet), little attention has been paid to characterizing a node's graphlet degree, i.e., the number of CISes isomorphic to the graphlet that include the node, which is an important metric for analyzing complex networks such as social and biological networks. Similar to global graphlet counting, it is challen","authors_text":"Don Towsley, Jiefeng Cheng, Jing Tao, John C.S. Lui, Junzhou Zhao, Pinghui Wang, Xiangliang Zhang, Xiaohong Guan, Zhenguo Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-29T05:24:24Z","title":"A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08691","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:26072a131b74670f2c8f360b3f69c74484565156490d3e45a0b37fd57eddeae1","target":"record","created_at":"2026-05-18T01:16:02Z","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":"fef9e5eb746cea3b5e19472f632261f50f35dd6a9650c2605afa1d2eda0a1429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-29T05:24:24Z","title_canon_sha256":"314b28c1ad4ec165c4b8965eebe449dc461fa8c44d90c1fa0d912afe44729a23"},"schema_version":"1.0","source":{"id":"1604.08691","kind":"arxiv","version":1}},"canonical_sha256":"40db7dd58de90ad8391664a85a81312cfc1cae234cb0965fed0349ce7cea3fae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40db7dd58de90ad8391664a85a81312cfc1cae234cb0965fed0349ce7cea3fae","first_computed_at":"2026-05-18T01:16:02.176683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:02.176683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DJFhNvw3AIqJzWQywM+cguKsSPDbaLhF0bqfUyAnrD3RvnoD03gFaiovxIFOUrFijmXNzk5MU65VywUVwwN2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:02.177420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26072a131b74670f2c8f360b3f69c74484565156490d3e45a0b37fd57eddeae1","sha256:974ca10fb78671f05339feaac4be8973707d24a5ff805cacc001f2f6e1bb1268"],"state_sha256":"37cbdbfbef09dd3a996b67de34fd8401e854ec854d3772c3d605341025a5c47f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnsHrscpTQGtRJ4qRxPp3FNM+G+ccchnxveO6rj85WBxTTqpKbUIQ8fCaoUQxhbEOL+e1Wl3L3qCn+Pk8SzFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:40:19.249185Z","bundle_sha256":"401a7cab4e46bde195a9d25b529a741b001909ead678b14b549a6445073dd983"}}