{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:H2CKVLVHZ3SDNVAH3TFPFZ53PD","short_pith_number":"pith:H2CKVLVH","schema_version":"1.0","canonical_sha256":"3e84aaaea7cee436d407dccaf2e7bb78d494b1fe22b672e39e7cf1f63fad6916","source":{"kind":"arxiv","id":"cond-mat/0605279","version":1},"attestation_state":"computed","paper":{"title":"Networks of strong ties","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Lada A. Adamic, Martin J. Strauss, Xiaolin Shi","submitted_at":"2006-05-10T17:47:31Z","abstract_excerpt":"Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of strong ties, requiring that each tie can only be used if the individuals on either end also share at least one other contact in common. We examine the effect of removing all non-transitive ties in two real social network data sets. We observe that although some individuals become disconnected, a giant connected component remains, with an average shortest path "},"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":"cond-mat/0605279","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2006-05-10T17:47:31Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"3bb7c990a08d04cd2321515f1a158882ff46451615da64706c31a398f0823906","abstract_canon_sha256":"61c96b552f64ec9a20b0cf0ab052aace3041f9ed86774f449f8d58979f71a88d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:47.740845Z","signature_b64":"2N0M5ut1S/R/JE38aVQ/pCNmijvb6iwDntO0HlL8m382eDXaNCVp/l2IbT/UuAr+0LzUlHSxmGdUhhveV3pdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e84aaaea7cee436d407dccaf2e7bb78d494b1fe22b672e39e7cf1f63fad6916","last_reissued_at":"2026-05-18T01:39:47.739944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:47.739944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Networks of strong ties","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Lada A. Adamic, Martin J. Strauss, Xiaolin Shi","submitted_at":"2006-05-10T17:47:31Z","abstract_excerpt":"Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of strong ties, requiring that each tie can only be used if the individuals on either end also share at least one other contact in common. We examine the effect of removing all non-transitive ties in two real social network data sets. We observe that although some individuals become disconnected, a giant connected component remains, with an average shortest path "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0605279","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":"cond-mat/0605279","created_at":"2026-05-18T01:39:47.740090+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0605279v1","created_at":"2026-05-18T01:39:47.740090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0605279","created_at":"2026-05-18T01:39:47.740090+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2CKVLVHZ3SD","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2CKVLVHZ3SDNVAH","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2CKVLVH","created_at":"2026-05-18T12:25:53.939244+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/H2CKVLVHZ3SDNVAH3TFPFZ53PD","json":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD.json","graph_json":"https://pith.science/api/pith-number/H2CKVLVHZ3SDNVAH3TFPFZ53PD/graph.json","events_json":"https://pith.science/api/pith-number/H2CKVLVHZ3SDNVAH3TFPFZ53PD/events.json","paper":"https://pith.science/paper/H2CKVLVH"},"agent_actions":{"view_html":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD","download_json":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD.json","view_paper":"https://pith.science/paper/H2CKVLVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0605279&json=true","fetch_graph":"https://pith.science/api/pith-number/H2CKVLVHZ3SDNVAH3TFPFZ53PD/graph.json","fetch_events":"https://pith.science/api/pith-number/H2CKVLVHZ3SDNVAH3TFPFZ53PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD/action/storage_attestation","attest_author":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD/action/author_attestation","sign_citation":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD/action/citation_signature","submit_replication":"https://pith.science/pith/H2CKVLVHZ3SDNVAH3TFPFZ53PD/action/replication_record"}},"created_at":"2026-05-18T01:39:47.740090+00:00","updated_at":"2026-05-18T01:39:47.740090+00:00"}