{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NVFAHLGC6VVNEMZB2LET3PKOVA","short_pith_number":"pith:NVFAHLGC","canonical_record":{"source":{"id":"1906.00140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-01T03:31:06Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"1d122705c3c5013f9d37e47890c98f39649fbfb4d40f9e1fb21982b1f62a3332","abstract_canon_sha256":"ae77a50143c46b6ecf20c1472ac89dc064724a3a6a57f98572f9c6a5b2bc49da"},"schema_version":"1.0"},"canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","source":{"kind":"arxiv","id":"1906.00140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00140","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00140v1","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00140","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"NVFAHLGC6VVN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NVFAHLGC6VVNEMZB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NVFAHLGC","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NVFAHLGC6VVNEMZB2LET3PKOVA","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-01T03:31:06Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"1d122705c3c5013f9d37e47890c98f39649fbfb4d40f9e1fb21982b1f62a3332","abstract_canon_sha256":"ae77a50143c46b6ecf20c1472ac89dc064724a3a6a57f98572f9c6a5b2bc49da"},"schema_version":"1.0"},"canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.046862Z","signature_b64":"Jyf1ZQNrjlKH4TBFwTN3kEI6TRkkdu8WWcSdKgVFmypBkT+drjM9KLK5/qsR5YOlcGDgVlnr0xN5fK/p8IlSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","last_reissued_at":"2026-05-17T23:44:28.046254Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.046254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00140","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chD5c5WVQnmRse8GessWiW0/cSTF5k5nTmmfLOl05vdmscwVphKVB2PwMCGGEIeEWsIS89rS6ttFRWA3Fo/XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:19:20.729485Z"},"content_sha256":"a9bff729235ff9c54d4def67d191d6716592d744012bd70d5a859c4ca70c6ef8","schema_version":"1.0","event_id":"sha256:a9bff729235ff9c54d4def67d191d6716592d744012bd70d5a859c4ca70c6ef8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NVFAHLGC6VVNEMZB2LET3PKOVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Algorithm for K-Truss Discovery on Public-Private Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.DB","authors_text":"Soroush Ebadian, Xin Huang","submitted_at":"2019-06-01T03:31:06Z","abstract_excerpt":"In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owner, e.g., hidden friend lists on Facebook and secret following on Sina Weibo. However, existing public-private analytic algorithms have not yet investigated the dense subgraph discovery of k-truss, where each edge is contained in at least k-2 triangles. This paper aims at finding k-truss efficiently in public-private graphs. The core of our solution is a novel algorithm to update k-truss with node insertions. We devel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00140","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/uPaZAsQVzm9S2LuynyUChdu+/9WeIa+Snvah0byQvbv2NaTX4FTjusgyOo/dnOJpZA+Szp2z6l+/OC3ewiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:19:20.729852Z"},"content_sha256":"7c784aff348d5647aafa8f9c80bf31f2d2966da0e7f1a4a9a437581225e6ceb1","schema_version":"1.0","event_id":"sha256:7c784aff348d5647aafa8f9c80bf31f2d2966da0e7f1a4a9a437581225e6ceb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/bundle.json","state_url":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/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-28T02:19:20Z","links":{"resolver":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA","bundle":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/bundle.json","state":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NVFAHLGC6VVNEMZB2LET3PKOVA","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":"ae77a50143c46b6ecf20c1472ac89dc064724a3a6a57f98572f9c6a5b2bc49da","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-01T03:31:06Z","title_canon_sha256":"1d122705c3c5013f9d37e47890c98f39649fbfb4d40f9e1fb21982b1f62a3332"},"schema_version":"1.0","source":{"id":"1906.00140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00140","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00140v1","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00140","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"NVFAHLGC6VVN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NVFAHLGC6VVNEMZB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NVFAHLGC","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7c784aff348d5647aafa8f9c80bf31f2d2966da0e7f1a4a9a437581225e6ceb1","target":"graph","created_at":"2026-05-17T23:44:28Z","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":"In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owner, e.g., hidden friend lists on Facebook and secret following on Sina Weibo. However, existing public-private analytic algorithms have not yet investigated the dense subgraph discovery of k-truss, where each edge is contained in at least k-2 triangles. This paper aims at finding k-truss efficiently in public-private graphs. The core of our solution is a novel algorithm to update k-truss with node insertions. We devel","authors_text":"Soroush Ebadian, Xin Huang","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-01T03:31:06Z","title":"Fast Algorithm for K-Truss Discovery on Public-Private Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00140","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:a9bff729235ff9c54d4def67d191d6716592d744012bd70d5a859c4ca70c6ef8","target":"record","created_at":"2026-05-17T23:44:28Z","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":"ae77a50143c46b6ecf20c1472ac89dc064724a3a6a57f98572f9c6a5b2bc49da","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-01T03:31:06Z","title_canon_sha256":"1d122705c3c5013f9d37e47890c98f39649fbfb4d40f9e1fb21982b1f62a3332"},"schema_version":"1.0","source":{"id":"1906.00140","kind":"arxiv","version":1}},"canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","first_computed_at":"2026-05-17T23:44:28.046254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.046254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jyf1ZQNrjlKH4TBFwTN3kEI6TRkkdu8WWcSdKgVFmypBkT+drjM9KLK5/qsR5YOlcGDgVlnr0xN5fK/p8IlSAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.046862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9bff729235ff9c54d4def67d191d6716592d744012bd70d5a859c4ca70c6ef8","sha256:7c784aff348d5647aafa8f9c80bf31f2d2966da0e7f1a4a9a437581225e6ceb1"],"state_sha256":"68f5f41d3d7922667b05f3789449bf53ca7e53ad654b484cb445b72ceb60cac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydIpx0Sa3Q/HHS+ARTg77pk5HLFWmHjSSRmJxE/Vg8NGmEvq05NXtuhS9BJNyNhZ5M0Hp2RZIIadObaVErv3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:19:20.731961Z","bundle_sha256":"43febb29ee5e1627182fb1f67f4c3a8eae2cfaaf022914e15ce0e52da7c9045c"}}