{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GNMRNGQLFH3JAOVCC5FZ37T5SA","short_pith_number":"pith:GNMRNGQL","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"},"canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","source":{"kind":"arxiv","id":"1502.05058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05058","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05058v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05058","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"GNMRNGQLFH3J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GNMRNGQLFH3JAOVC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GNMRNGQL","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GNMRNGQLFH3JAOVCC5FZ37T5SA","target":"record","payload":{"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"},"canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","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"},"source_kind":"arxiv","source_id":"1502.05058","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-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4MAWhbUcbBMCyutfA0Lku5j9bBoBbUK4Bwnne3q9Rdg6q4e2l6/Gi/bMjDBYZcQimdSxH0nIIJq+m6is5DNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:55:54.255684Z"},"content_sha256":"f343cf3b8dc4223cc12ce06739dcd87a412737265dbd7bfa60c1cb93a5f935b0","schema_version":"1.0","event_id":"sha256:f343cf3b8dc4223cc12ce06739dcd87a412737265dbd7bfa60c1cb93a5f935b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GNMRNGQLFH3JAOVCC5FZ37T5SA","target":"graph","payload":{"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"},"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:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpyJ25tpsESnnfWslj8bncmTYzeejk/+6G8JnhisgTno7UTUOE/i/cdB25xwJ6uoBzaaze9iwcd6UxiR2uWAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:55:54.256386Z"},"content_sha256":"27ad05ea5614c9596fee9cd8f0d1a64a4ad7524eda1128781c6f97dd514cfee9","schema_version":"1.0","event_id":"sha256:27ad05ea5614c9596fee9cd8f0d1a64a4ad7524eda1128781c6f97dd514cfee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/bundle.json","state_url":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/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-05-31T10:55:54Z","links":{"resolver":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA","bundle":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/bundle.json","state":"https://pith.science/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNMRNGQLFH3JAOVCC5FZ37T5SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GNMRNGQLFH3JAOVCC5FZ37T5SA","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":"031648d2c99b9425e67b368f2d6696581b293f09b92061630c18094fad32c09a","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-17T21:04:44Z","title_canon_sha256":"c0cda36c492dce2077bcfdea6f113a4317bfb5f4a249733510b4801db60a9e43"},"schema_version":"1.0","source":{"id":"1502.05058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05058","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05058v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05058","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"GNMRNGQLFH3J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GNMRNGQLFH3JAOVC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GNMRNGQL","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:27ad05ea5614c9596fee9cd8f0d1a64a4ad7524eda1128781c6f97dd514cfee9","target":"graph","created_at":"2026-05-18T00:26:47Z","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":"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","authors_text":"Austin R. Benson, David F. Gleich, Jure Leskovec","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-17T21:04:44Z","title":"Tensor Spectral Clustering for Partitioning Higher-order Network Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05058","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:f343cf3b8dc4223cc12ce06739dcd87a412737265dbd7bfa60c1cb93a5f935b0","target":"record","created_at":"2026-05-18T00:26:47Z","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":"031648d2c99b9425e67b368f2d6696581b293f09b92061630c18094fad32c09a","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-17T21:04:44Z","title_canon_sha256":"c0cda36c492dce2077bcfdea6f113a4317bfb5f4a249733510b4801db60a9e43"},"schema_version":"1.0","source":{"id":"1502.05058","kind":"arxiv","version":1}},"canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3359169a0b29f6903aa2174b9dfe7d9005d812d01b2806b5b9af4bea6e85a180","first_computed_at":"2026-05-18T00:26:47.309029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:47.309029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M8Ena9ufOviQ8ZLzVCtOkt5ZwNzOuh2NyssQIM6Bg3W9F4r2NpKwB4uQuqu1mfPNA/QLy52xAy7JD8iSLP3jDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:47.310168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f343cf3b8dc4223cc12ce06739dcd87a412737265dbd7bfa60c1cb93a5f935b0","sha256:27ad05ea5614c9596fee9cd8f0d1a64a4ad7524eda1128781c6f97dd514cfee9"],"state_sha256":"b8b98975308a2be715f1e7130b3aefe5f1fe83be7f7a959abbbe0e5c40684e46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C36vMMhWNeVYdogFOWYF50PCjhGVd42WjLuotaXlsB4+BF6nCe+kWott42IIJNFvAhLB/S7wscmnYdzVzDB/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:55:54.260376Z","bundle_sha256":"0367155443483297c8f58ca9b4fd5561d716ef96429baea71e967b9a7cfe75e8"}}