{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NVFAHLGC6VVNEMZB2LET3PKOVA","short_pith_number":"pith:NVFAHLGC","schema_version":"1.0","canonical_sha256":"6d4a03acc2f56ad23321d2c93dbd4ea82d748dbed944bff67a2d74c4bbc8637a","source":{"kind":"arxiv","id":"1906.00140","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00140","created_at":"2026-05-17T23:44:28.046362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00140v1","created_at":"2026-05-17T23:44:28.046362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00140","created_at":"2026-05-17T23:44:28.046362+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVFAHLGC6VVN","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVFAHLGC6VVNEMZB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVFAHLGC","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14988","citing_title":"Efficient Community Search on Attributed Public-Private Graphs","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA","json":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA.json","graph_json":"https://pith.science/api/pith-number/NVFAHLGC6VVNEMZB2LET3PKOVA/graph.json","events_json":"https://pith.science/api/pith-number/NVFAHLGC6VVNEMZB2LET3PKOVA/events.json","paper":"https://pith.science/paper/NVFAHLGC"},"agent_actions":{"view_html":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA","download_json":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA.json","view_paper":"https://pith.science/paper/NVFAHLGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00140&json=true","fetch_graph":"https://pith.science/api/pith-number/NVFAHLGC6VVNEMZB2LET3PKOVA/graph.json","fetch_events":"https://pith.science/api/pith-number/NVFAHLGC6VVNEMZB2LET3PKOVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/action/storage_attestation","attest_author":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/action/author_attestation","sign_citation":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/action/citation_signature","submit_replication":"https://pith.science/pith/NVFAHLGC6VVNEMZB2LET3PKOVA/action/replication_record"}},"created_at":"2026-05-17T23:44:28.046362+00:00","updated_at":"2026-05-17T23:44:28.046362+00:00"}