{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U7W7UNKWMYHLXKVVAQKENDULMV","short_pith_number":"pith:U7W7UNKW","canonical_record":{"source":{"id":"1402.2807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-12T12:57:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0d02acc9df88864b0e298b1ff7889eb5e8d2b8c3a95ce2b5045ca50999ac3107","abstract_canon_sha256":"8eb441d896bc626a9b1880be9f41e022df89cbe60f3954278e579ab61e69abb0"},"schema_version":"1.0"},"canonical_sha256":"a7edfa3556660ebbaab50414468e8b6558085557ed3810ed46106a73c2eb1f53","source":{"kind":"arxiv","id":"1402.2807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2807","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2807v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2807","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"U7W7UNKWMYHL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U7W7UNKWMYHLXKVV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U7W7UNKW","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U7W7UNKWMYHLXKVVAQKENDULMV","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-12T12:57:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0d02acc9df88864b0e298b1ff7889eb5e8d2b8c3a95ce2b5045ca50999ac3107","abstract_canon_sha256":"8eb441d896bc626a9b1880be9f41e022df89cbe60f3954278e579ab61e69abb0"},"schema_version":"1.0"},"canonical_sha256":"a7edfa3556660ebbaab50414468e8b6558085557ed3810ed46106a73c2eb1f53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.232679Z","signature_b64":"AOiozphyinpDubgdvrt9f5k188bFH+mvaS86iwpmCyyMda3D2y+DAPK6sQMXtadfPnSS314risIbfeV3GpPXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7edfa3556660ebbaab50414468e8b6558085557ed3810ed46106a73c2eb1f53","last_reissued_at":"2026-05-18T02:59:17.231895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.231895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2807","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-18T02:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XjP1g+3MylKzzD4A60wT1PjAv+GEfEW5rFcB3GLF/bLTwxz71PkxPTaaavkzezKrj0cddf6foAMM00HIZWsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:18:58.098568Z"},"content_sha256":"609ae01683dff817b12b783f66c76d37ddb8aed7076c5c01f50f8d53eeb3046b","schema_version":"1.0","event_id":"sha256:609ae01683dff817b12b783f66c76d37ddb8aed7076c5c01f50f8d53eeb3046b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U7W7UNKWMYHLXKVVAQKENDULMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Truss Maintenance in Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Chengfei Liu, Jeffrey Xu Yu, Rui Zhou, Weifa Liang, Yanchun Zhang","submitted_at":"2014-02-12T12:57:06Z","abstract_excerpt":"Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within the subgraph. While truss has been demonstrated as superior to model the close relationship in social networks and efficient algorithms for finding trusses have been extensively studied, very little attention has been paid to truss maintenance. However, most social networks are evolving networks. It may be infeasible to recompute trusses from scratch from time to time in order to find the up-to-date $k$-trusses in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2807","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-18T02:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCk8o2lZTDKa630NKRvtMtBwWy7fGa8VwRBMge9jK5kxqdqpB3kXQvUI6pKGbjFsnm5Kn+/Yn5bxrIdAvYTJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:18:58.099133Z"},"content_sha256":"eff0e3c562a9e0fd858fa11c6cd27354ee5edcc1da2288b92d278561499445ff","schema_version":"1.0","event_id":"sha256:eff0e3c562a9e0fd858fa11c6cd27354ee5edcc1da2288b92d278561499445ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7W7UNKWMYHLXKVVAQKENDULMV/bundle.json","state_url":"https://pith.science/pith/U7W7UNKWMYHLXKVVAQKENDULMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7W7UNKWMYHLXKVVAQKENDULMV/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-06-07T09:18:58Z","links":{"resolver":"https://pith.science/pith/U7W7UNKWMYHLXKVVAQKENDULMV","bundle":"https://pith.science/pith/U7W7UNKWMYHLXKVVAQKENDULMV/bundle.json","state":"https://pith.science/pith/U7W7UNKWMYHLXKVVAQKENDULMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7W7UNKWMYHLXKVVAQKENDULMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U7W7UNKWMYHLXKVVAQKENDULMV","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":"8eb441d896bc626a9b1880be9f41e022df89cbe60f3954278e579ab61e69abb0","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-12T12:57:06Z","title_canon_sha256":"0d02acc9df88864b0e298b1ff7889eb5e8d2b8c3a95ce2b5045ca50999ac3107"},"schema_version":"1.0","source":{"id":"1402.2807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2807","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2807v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2807","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"U7W7UNKWMYHL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U7W7UNKWMYHLXKVV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U7W7UNKW","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:eff0e3c562a9e0fd858fa11c6cd27354ee5edcc1da2288b92d278561499445ff","target":"graph","created_at":"2026-05-18T02:59:17Z","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":"Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within the subgraph. While truss has been demonstrated as superior to model the close relationship in social networks and efficient algorithms for finding trusses have been extensively studied, very little attention has been paid to truss maintenance. However, most social networks are evolving networks. It may be infeasible to recompute trusses from scratch from time to time in order to find the up-to-date $k$-trusses in t","authors_text":"Chengfei Liu, Jeffrey Xu Yu, Rui Zhou, Weifa Liang, Yanchun Zhang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-12T12:57:06Z","title":"Efficient Truss Maintenance in Evolving Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2807","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:609ae01683dff817b12b783f66c76d37ddb8aed7076c5c01f50f8d53eeb3046b","target":"record","created_at":"2026-05-18T02:59:17Z","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":"8eb441d896bc626a9b1880be9f41e022df89cbe60f3954278e579ab61e69abb0","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-12T12:57:06Z","title_canon_sha256":"0d02acc9df88864b0e298b1ff7889eb5e8d2b8c3a95ce2b5045ca50999ac3107"},"schema_version":"1.0","source":{"id":"1402.2807","kind":"arxiv","version":1}},"canonical_sha256":"a7edfa3556660ebbaab50414468e8b6558085557ed3810ed46106a73c2eb1f53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7edfa3556660ebbaab50414468e8b6558085557ed3810ed46106a73c2eb1f53","first_computed_at":"2026-05-18T02:59:17.231895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:17.231895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOiozphyinpDubgdvrt9f5k188bFH+mvaS86iwpmCyyMda3D2y+DAPK6sQMXtadfPnSS314risIbfeV3GpPXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:17.232679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:609ae01683dff817b12b783f66c76d37ddb8aed7076c5c01f50f8d53eeb3046b","sha256:eff0e3c562a9e0fd858fa11c6cd27354ee5edcc1da2288b92d278561499445ff"],"state_sha256":"5fcdd8046a4cc1293dcce6076730c6753869019d9fdaef46e1b24831feca1324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YasT6viac/dt0quJYn6QHjUIPr2bn9ACRB6cl7BPx+CLIShNYyCSrZJQCy9nIktkmf3HAoswmTkyPArmSmYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:18:58.102127Z","bundle_sha256":"08e9e1421ec0619cf853f63334f4ea9d669a41ffa99d5280f2a607dfb37c2a07"}}