{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CUFODA4MGK75FXG5N54SL6CI5R","short_pith_number":"pith:CUFODA4M","canonical_record":{"source":{"id":"1701.01772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-06T22:37:59Z","cross_cats_sorted":["cs.DC","math.CO","stat.ML"],"title_canon_sha256":"6f66a9393a249cdf6212e1ff0d61a95e80af8cd447eefd0704f9fc8235410919","abstract_canon_sha256":"2b21477744482e1567f58bcf4e83ca61a6c828f8d208f386d1521a471a23c55c"},"schema_version":"1.0"},"canonical_sha256":"150ae1838c32bfd2dcdd6f7925f848ec6321dfc61c9c98a583e5462c8e456470","source":{"kind":"arxiv","id":"1701.01772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01772","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01772v2","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01772","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"CUFODA4MGK75","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CUFODA4MGK75FXG5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CUFODA4M","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CUFODA4MGK75FXG5N54SL6CI5R","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-06T22:37:59Z","cross_cats_sorted":["cs.DC","math.CO","stat.ML"],"title_canon_sha256":"6f66a9393a249cdf6212e1ff0d61a95e80af8cd447eefd0704f9fc8235410919","abstract_canon_sha256":"2b21477744482e1567f58bcf4e83ca61a6c828f8d208f386d1521a471a23c55c"},"schema_version":"1.0"},"canonical_sha256":"150ae1838c32bfd2dcdd6f7925f848ec6321dfc61c9c98a583e5462c8e456470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:50.749958Z","signature_b64":"qG9CRj2AFJ+ytqmHL5kzHGjtBRNCuu5M3+q3fkpZKQ44Mv+zQTjxp2McCdGAD45LjI1zSSsZZjdVCwDpGVTwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"150ae1838c32bfd2dcdd6f7925f848ec6321dfc61c9c98a583e5462c8e456470","last_reissued_at":"2026-05-18T00:49:50.749610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:50.749610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01772","source_version":2,"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:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vMIwk/hOqTTsEtdpmfZMVviEZG/g+llVSftukiWxh3IAl+EkKN02m6qfoUKLQhF1RJPAgFnIYVuxWms9tbsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:53:38.193915Z"},"content_sha256":"764cdf581205c24bc6b733157d5ba49f8bb059edbadb6f49ecd4cf81a9851e84","schema_version":"1.0","event_id":"sha256:764cdf581205c24bc6b733157d5ba49f8bb059edbadb6f49ecd4cf81a9851e84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CUFODA4MGK75FXG5N54SL6CI5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimation of Graphlet Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO","stat.ML"],"primary_cat":"cs.SI","authors_text":"Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi","submitted_at":"2017-01-06T22:37:59Z","abstract_excerpt":"Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is often too expensive to compute graphlets exactly in massive networks with billions of edges, and finding an approximate count is usually sufficient for many applications. In this work, we propose an unbiased graphlet estimation framework that is (a) fast with significant speedups com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01772","kind":"arxiv","version":2},"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:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC/cdAUJbe4mRssDHfO5PdMQSkn69UvGCVm5ufnX0vYHlMC+HtZZyl2UhAbmaE4yNM0cxSFEL0swGtrNu0yICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:53:38.194705Z"},"content_sha256":"f24775ef3242af4079f9a20845d2a8a7e4dea52c98d61973b34dc69208adfdd1","schema_version":"1.0","event_id":"sha256:f24775ef3242af4079f9a20845d2a8a7e4dea52c98d61973b34dc69208adfdd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUFODA4MGK75FXG5N54SL6CI5R/bundle.json","state_url":"https://pith.science/pith/CUFODA4MGK75FXG5N54SL6CI5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUFODA4MGK75FXG5N54SL6CI5R/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-08T05:53:38Z","links":{"resolver":"https://pith.science/pith/CUFODA4MGK75FXG5N54SL6CI5R","bundle":"https://pith.science/pith/CUFODA4MGK75FXG5N54SL6CI5R/bundle.json","state":"https://pith.science/pith/CUFODA4MGK75FXG5N54SL6CI5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUFODA4MGK75FXG5N54SL6CI5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CUFODA4MGK75FXG5N54SL6CI5R","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":"2b21477744482e1567f58bcf4e83ca61a6c828f8d208f386d1521a471a23c55c","cross_cats_sorted":["cs.DC","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-06T22:37:59Z","title_canon_sha256":"6f66a9393a249cdf6212e1ff0d61a95e80af8cd447eefd0704f9fc8235410919"},"schema_version":"1.0","source":{"id":"1701.01772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01772","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01772v2","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01772","created_at":"2026-05-18T00:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"CUFODA4MGK75","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CUFODA4MGK75FXG5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CUFODA4M","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f24775ef3242af4079f9a20845d2a8a7e4dea52c98d61973b34dc69208adfdd1","target":"graph","created_at":"2026-05-18T00:49:50Z","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 induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is often too expensive to compute graphlets exactly in massive networks with billions of edges, and finding an approximate count is usually sufficient for many applications. In this work, we propose an unbiased graphlet estimation framework that is (a) fast with significant speedups com","authors_text":"Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi","cross_cats":["cs.DC","math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-06T22:37:59Z","title":"Estimation of Graphlet Statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01772","kind":"arxiv","version":2},"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:764cdf581205c24bc6b733157d5ba49f8bb059edbadb6f49ecd4cf81a9851e84","target":"record","created_at":"2026-05-18T00:49:50Z","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":"2b21477744482e1567f58bcf4e83ca61a6c828f8d208f386d1521a471a23c55c","cross_cats_sorted":["cs.DC","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-06T22:37:59Z","title_canon_sha256":"6f66a9393a249cdf6212e1ff0d61a95e80af8cd447eefd0704f9fc8235410919"},"schema_version":"1.0","source":{"id":"1701.01772","kind":"arxiv","version":2}},"canonical_sha256":"150ae1838c32bfd2dcdd6f7925f848ec6321dfc61c9c98a583e5462c8e456470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"150ae1838c32bfd2dcdd6f7925f848ec6321dfc61c9c98a583e5462c8e456470","first_computed_at":"2026-05-18T00:49:50.749610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:50.749610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qG9CRj2AFJ+ytqmHL5kzHGjtBRNCuu5M3+q3fkpZKQ44Mv+zQTjxp2McCdGAD45LjI1zSSsZZjdVCwDpGVTwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:50.749958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:764cdf581205c24bc6b733157d5ba49f8bb059edbadb6f49ecd4cf81a9851e84","sha256:f24775ef3242af4079f9a20845d2a8a7e4dea52c98d61973b34dc69208adfdd1"],"state_sha256":"2e49f2bb643ca75877b9fa1ebe19303a28c941b0b6a6e01ef24e6afcee43ebe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdY6VvwQnnjQySlhsCgeN5iAZE+8tmXr6UbfeY2hvYiR001V54b/MgxzLOMXBE367DjrBJtTy0sXt+1DlRmlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:53:38.199331Z","bundle_sha256":"0c57878bb90b2c787e83caed943a1eec1e72a45b6e28114ec4d7747bc81f7028"}}