{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GNMRNGQLFH3JAOVCC5FZ37T5SA","short_pith_number":"pith:GNMRNGQL","schema_version":"1.0","canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","source":{"kind":"arxiv","id":"1502.05058","version":1},"attestation_state":"computed","paper":{"title":"Tensor Spectral Clustering for Partitioning Higher-order Network Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Jure Leskovec","submitted_at":"2015-02-17T21:04:44Z","abstract_excerpt":"Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forw"},"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":"1502.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-17T21:04:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"c0cda36c492dce2077bcfdea6f113a4317bfb5f4a249733510b4801db60a9e43","abstract_canon_sha256":"031648d2c99b9425e67b368f2d6696581b293f09b92061630c18094fad32c09a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.310168Z","signature_b64":"M8Ena9ufOviQ8ZLzVCtOkt5ZwNzOuh2NyssQIM6Bg3W9F4r2NpKwB4uQuqu1mfPNA/QLy52xAy7JD8iSLP3jDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","last_reissued_at":"2026-05-18T00:26:47.309029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.309029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Spectral Clustering for Partitioning Higher-order Network Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Jure Leskovec","submitted_at":"2015-02-17T21:04:44Z","abstract_excerpt":"Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05058","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":"1502.05058","created_at":"2026-05-18T00:26:47.309140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05058v1","created_at":"2026-05-18T00:26:47.309140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05058","created_at":"2026-05-18T00:26:47.309140+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNMRNGQLFH3J","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNMRNGQLFH3JAOVC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNMRNGQL","created_at":"2026-05-18T12:29:22.688609+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/GNMRNGQLFH3JAOVCC5FZ37T5SA","json":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA.json","graph_json":"https://pith.science/api/pith-number/GNMRNGQLFH3JAOVCC5FZ37T5SA/graph.json","events_json":"https://pith.science/api/pith-number/GNMRNGQLFH3JAOVCC5FZ37T5SA/events.json","paper":"https://pith.science/paper/GNMRNGQL"},"agent_actions":{"view_html":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA","download_json":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA.json","view_paper":"https://pith.science/paper/GNMRNGQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/GNMRNGQLFH3JAOVCC5FZ37T5SA/graph.json","fetch_events":"https://pith.science/api/pith-number/GNMRNGQLFH3JAOVCC5FZ37T5SA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/action/storage_attestation","attest_author":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/action/author_attestation","sign_citation":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/action/citation_signature","submit_replication":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/action/replication_record"}},"created_at":"2026-05-18T00:26:47.309140+00:00","updated_at":"2026-05-18T00:26:47.309140+00:00"}