{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4Z6TQ7ZVB6CZQ33LNERWHI7FGA","short_pith_number":"pith:4Z6TQ7ZV","schema_version":"1.0","canonical_sha256":"e67d387f350f85986f6b692363a3e5302176c352202392723d1d4bd8eed0a652","source":{"kind":"arxiv","id":"1603.00395","version":1},"attestation_state":"computed","paper":{"title":"General Tensor Spectral Co-clustering for Higher-Order Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Tao Wu","submitted_at":"2016-03-01T18:36:39Z","abstract_excerpt":"Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new tensor spectral co-clustering method that applies to any non-negative tensor of data. The result of applying our method is a simultaneous clustering of the rows, columns, and slices of a three-mode tensor, and the idea generalizes to any number of modes. The algorithm we design works by recursively bisecting the tensor into two pieces. We also design a new measure to understand "},"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":"1603.00395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-03-01T18:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"bf5bb266205122a1b0f674303a60573720c0ce4e8951515f891e6f0da57fdc73","abstract_canon_sha256":"4f6be52de89b3029be2f744dcbdaa8fd2aa28f0055965355ed4b6ce34ea26beb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:45.194722Z","signature_b64":"XoQvSKNJaJohce8lRwoXF5pe/I2/A5IJ2NAtcE/KC852me0ZRO/yOd4XwSqRDZMGcix/yRnKcFKYeVvwJjsWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e67d387f350f85986f6b692363a3e5302176c352202392723d1d4bd8eed0a652","last_reissued_at":"2026-05-18T01:19:45.194009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:45.194009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Tensor Spectral Co-clustering for Higher-Order Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, David F. Gleich, Tao Wu","submitted_at":"2016-03-01T18:36:39Z","abstract_excerpt":"Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new tensor spectral co-clustering method that applies to any non-negative tensor of data. The result of applying our method is a simultaneous clustering of the rows, columns, and slices of a three-mode tensor, and the idea generalizes to any number of modes. The algorithm we design works by recursively bisecting the tensor into two pieces. We also design a new measure to understand "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00395","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":"1603.00395","created_at":"2026-05-18T01:19:45.194129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00395v1","created_at":"2026-05-18T01:19:45.194129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00395","created_at":"2026-05-18T01:19:45.194129+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Z6TQ7ZVB6CZ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Z6TQ7ZVB6CZQ33L","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Z6TQ7ZV","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/4Z6TQ7ZVB6CZQ33LNERWHI7FGA","json":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA.json","graph_json":"https://pith.science/api/pith-number/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/graph.json","events_json":"https://pith.science/api/pith-number/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/events.json","paper":"https://pith.science/paper/4Z6TQ7ZV"},"agent_actions":{"view_html":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA","download_json":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA.json","view_paper":"https://pith.science/paper/4Z6TQ7ZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00395&json=true","fetch_graph":"https://pith.science/api/pith-number/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/graph.json","fetch_events":"https://pith.science/api/pith-number/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/action/storage_attestation","attest_author":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/action/author_attestation","sign_citation":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/action/citation_signature","submit_replication":"https://pith.science/pith/4Z6TQ7ZVB6CZQ33LNERWHI7FGA/action/replication_record"}},"created_at":"2026-05-18T01:19:45.194129+00:00","updated_at":"2026-05-18T01:19:45.194129+00:00"}