{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IPQOA2NZFVXDKJC23EWJL733O6","short_pith_number":"pith:IPQOA2NZ","schema_version":"1.0","canonical_sha256":"43e0e069b92d6e35245ad92c95ff7b7784201a1841ea475ab038010fe131c350","source":{"kind":"arxiv","id":"1704.03913","version":2},"attestation_state":"computed","paper":{"title":"Higher-order clustering in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, Hao Yin, Jure Leskovec","submitted_at":"2017-04-12T19:48:31Z","abstract_excerpt":"A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order network structures is not well understood. Here we introduce higher-order clustering coefficients that measure the closure probability of higher-order network cliques and provide a "},"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":"1704.03913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-12T19:48:31Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph","stat.ML"],"title_canon_sha256":"3d7238ee900ce795668367dec92cb7a637f23bc329a22297c318a0fe9051ff64","abstract_canon_sha256":"1243571e067ed8797a89b91ace1f7e81fe8746fa8f2148467e48636b22d0fe5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:24.321046Z","signature_b64":"sGfMnVqSuyUrtCLE5ShUuDQ8TAtg8lf81DQ4fB0ra/HU4NeNHwFq4jmMwSj3lTDKUT1DGFQwbk05z6HZb1vvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43e0e069b92d6e35245ad92c95ff7b7784201a1841ea475ab038010fe131c350","last_reissued_at":"2026-05-18T00:15:24.320337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:24.320337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order clustering in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, Hao Yin, Jure Leskovec","submitted_at":"2017-04-12T19:48:31Z","abstract_excerpt":"A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order network structures is not well understood. Here we introduce higher-order clustering coefficients that measure the closure probability of higher-order network cliques and provide a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03913","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.03913","created_at":"2026-05-18T00:15:24.320453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03913v2","created_at":"2026-05-18T00:15:24.320453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03913","created_at":"2026-05-18T00:15:24.320453+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPQOA2NZFVXD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPQOA2NZFVXDKJC2","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPQOA2NZ","created_at":"2026-05-18T12:31:21.493067+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/IPQOA2NZFVXDKJC23EWJL733O6","json":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6.json","graph_json":"https://pith.science/api/pith-number/IPQOA2NZFVXDKJC23EWJL733O6/graph.json","events_json":"https://pith.science/api/pith-number/IPQOA2NZFVXDKJC23EWJL733O6/events.json","paper":"https://pith.science/paper/IPQOA2NZ"},"agent_actions":{"view_html":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6","download_json":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6.json","view_paper":"https://pith.science/paper/IPQOA2NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03913&json=true","fetch_graph":"https://pith.science/api/pith-number/IPQOA2NZFVXDKJC23EWJL733O6/graph.json","fetch_events":"https://pith.science/api/pith-number/IPQOA2NZFVXDKJC23EWJL733O6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6/action/storage_attestation","attest_author":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6/action/author_attestation","sign_citation":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6/action/citation_signature","submit_replication":"https://pith.science/pith/IPQOA2NZFVXDKJC23EWJL733O6/action/replication_record"}},"created_at":"2026-05-18T00:15:24.320453+00:00","updated_at":"2026-05-18T00:15:24.320453+00:00"}