{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZPI5BM25KI3K7JKYLBUPT6ZLHA","short_pith_number":"pith:ZPI5BM25","schema_version":"1.0","canonical_sha256":"cbd1d0b35d5236afa5585868f9fb2b3807578fce35a6f409c776597e450b8231","source":{"kind":"arxiv","id":"1205.6693","version":1},"attestation_state":"computed","paper":{"title":"Truss Decomposition in Massive Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"James Cheng, Jia Wang","submitted_at":"2012-05-30T14:32:46Z","abstract_excerpt":"The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the \"core\" of a k-core that keeps the key information of, while filtering out less important information from, the k-core. However, existing algorithms for computing k-truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k-truss in "},"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":"1205.6693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"3115da856460f284bdcc51f640b0fecf3a0bec0cd6f97b0d01b9f8c001ac082a","abstract_canon_sha256":"5c4d1170c958e22417fa2a2aa055befb6aa65d228596b74133113d77c113f3af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:38.196613Z","signature_b64":"T4s0pZ3w9SvBWhsvpCGiqZmJst7OLXLbbUc6ALrtCXSwh+DsMulGMZOeXrPbmc+pjN6CnCyv1n7YYpBDcAvLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbd1d0b35d5236afa5585868f9fb2b3807578fce35a6f409c776597e450b8231","last_reissued_at":"2026-05-18T03:54:38.195936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:38.195936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truss Decomposition in Massive Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"James Cheng, Jia Wang","submitted_at":"2012-05-30T14:32:46Z","abstract_excerpt":"The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the \"core\" of a k-core that keeps the key information of, while filtering out less important information from, the k-core. However, existing algorithms for computing k-truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k-truss in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6693","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":"1205.6693","created_at":"2026-05-18T03:54:38.196062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6693v1","created_at":"2026-05-18T03:54:38.196062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6693","created_at":"2026-05-18T03:54:38.196062+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPI5BM25KI3K","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPI5BM25KI3K7JKY","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPI5BM25","created_at":"2026-05-18T12:27:30.460161+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/ZPI5BM25KI3K7JKYLBUPT6ZLHA","json":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA.json","graph_json":"https://pith.science/api/pith-number/ZPI5BM25KI3K7JKYLBUPT6ZLHA/graph.json","events_json":"https://pith.science/api/pith-number/ZPI5BM25KI3K7JKYLBUPT6ZLHA/events.json","paper":"https://pith.science/paper/ZPI5BM25"},"agent_actions":{"view_html":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA","download_json":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA.json","view_paper":"https://pith.science/paper/ZPI5BM25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6693&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPI5BM25KI3K7JKYLBUPT6ZLHA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPI5BM25KI3K7JKYLBUPT6ZLHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA/action/storage_attestation","attest_author":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA/action/author_attestation","sign_citation":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA/action/citation_signature","submit_replication":"https://pith.science/pith/ZPI5BM25KI3K7JKYLBUPT6ZLHA/action/replication_record"}},"created_at":"2026-05-18T03:54:38.196062+00:00","updated_at":"2026-05-18T03:54:38.196062+00:00"}