{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:57ZRZFXHAHODDI2QJZGY3GSYYS","short_pith_number":"pith:57ZRZFXH","schema_version":"1.0","canonical_sha256":"eff31c96e701dc31a3504e4d8d9a58c4984c04f4eff42e9b4345a6ff899520a8","source":{"kind":"arxiv","id":"1612.08447","version":1},"attestation_state":"computed","paper":{"title":"Higher-order organization of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Jure Leskovec","submitted_at":"2016-12-26T21:50:42Z","abstract_excerpt":"Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be captured at the level of individual nodes and edges. However, higher-order organization of complex networks---at the level of small network subgraphs---remains largely unknown. Here we develop a generalized framework for clustering networks based on higher-order connectivity patterns. This framework provides mathematical guarantees on the optimality of obtained cl"},"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":"1612.08447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-26T21:50:42Z","cross_cats_sorted":["cs.DM","physics.soc-ph"],"title_canon_sha256":"5959d53a6b43393dd5ec29f23f38ca81cd465ffd1882d5034fc2f87d5d2ce320","abstract_canon_sha256":"e6f47a541ce51870be6d52c2433dcade613a7a2f8c1024e4c1d2598b8963e91c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:46.639370Z","signature_b64":"kr/MXZzHyMYl9XuH98zSDWp4aA216vSVp2GWxD+/ievmjR6Qpw1IR0PmItdmOD7Enrz/68qJCMaN8XjkbccxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff31c96e701dc31a3504e4d8d9a58c4984c04f4eff42e9b4345a6ff899520a8","last_reissued_at":"2026-05-18T00:26:46.638663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:46.638663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order organization of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Jure Leskovec","submitted_at":"2016-12-26T21:50:42Z","abstract_excerpt":"Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be captured at the level of individual nodes and edges. However, higher-order organization of complex networks---at the level of small network subgraphs---remains largely unknown. Here we develop a generalized framework for clustering networks based on higher-order connectivity patterns. This framework provides mathematical guarantees on the optimality of obtained cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08447","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":"1612.08447","created_at":"2026-05-18T00:26:46.638769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08447v1","created_at":"2026-05-18T00:26:46.638769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08447","created_at":"2026-05-18T00:26:46.638769+00:00"},{"alias_kind":"pith_short_12","alias_value":"57ZRZFXHAHOD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"57ZRZFXHAHODDI2Q","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"57ZRZFXH","created_at":"2026-05-18T12:29:58.707656+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/57ZRZFXHAHODDI2QJZGY3GSYYS","json":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS.json","graph_json":"https://pith.science/api/pith-number/57ZRZFXHAHODDI2QJZGY3GSYYS/graph.json","events_json":"https://pith.science/api/pith-number/57ZRZFXHAHODDI2QJZGY3GSYYS/events.json","paper":"https://pith.science/paper/57ZRZFXH"},"agent_actions":{"view_html":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS","download_json":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS.json","view_paper":"https://pith.science/paper/57ZRZFXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08447&json=true","fetch_graph":"https://pith.science/api/pith-number/57ZRZFXHAHODDI2QJZGY3GSYYS/graph.json","fetch_events":"https://pith.science/api/pith-number/57ZRZFXHAHODDI2QJZGY3GSYYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS/action/storage_attestation","attest_author":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS/action/author_attestation","sign_citation":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS/action/citation_signature","submit_replication":"https://pith.science/pith/57ZRZFXHAHODDI2QJZGY3GSYYS/action/replication_record"}},"created_at":"2026-05-18T00:26:46.638769+00:00","updated_at":"2026-05-18T00:26:46.638769+00:00"}