{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A343NDWODUQ764YSCO2EUZLQAT","short_pith_number":"pith:A343NDWO","schema_version":"1.0","canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","source":{"kind":"arxiv","id":"1804.07431","version":1},"attestation_state":"computed","paper":{"title":"Finding Cliques in Social Networks: A New Distribution-Free Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.SI"],"primary_cat":"math.CO","authors_text":"C. Seshadhri, Fan Wei, Jacob Fox, Nicole Wein, Tim Roughgarden","submitted_at":"2018-04-20T02:37:31Z","abstract_excerpt":"We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the property that pairs of vertices with common neighbors tend to be adjacent. Our most basic definition is that of a \"$c$-closed\" graph, where for every pair of vertices $u,v$ with at least $c$ common neighbors, $u$ and $v$ are adjacent. We study the classic problem of enumerating all maximal cliques, an important task in social network analysis. We prove that this problem is fixed-parameter tractable with respect to $c$ on $c"},"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":"1804.07431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-20T02:37:31Z","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"82082268739c34442524c10a99503ace4d04187bcf6032b4f66b5905d08ca737","abstract_canon_sha256":"b9830f352ab665a4d3d031bc96c88aec26b0acf7ca4047e660e6fbce21f0dd4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:32.633787Z","signature_b64":"fddjXRvCbRpTLCZ26jsltBygofS1QY7N8+9Cz+VP1e/v9fJ1uNd2zYBxqnJNUqMRPfLywTCqYX+pz8F0fgRVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","last_reissued_at":"2026-05-18T00:17:32.633144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:32.633144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Cliques in Social Networks: A New Distribution-Free Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.SI"],"primary_cat":"math.CO","authors_text":"C. Seshadhri, Fan Wei, Jacob Fox, Nicole Wein, Tim Roughgarden","submitted_at":"2018-04-20T02:37:31Z","abstract_excerpt":"We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the property that pairs of vertices with common neighbors tend to be adjacent. Our most basic definition is that of a \"$c$-closed\" graph, where for every pair of vertices $u,v$ with at least $c$ common neighbors, $u$ and $v$ are adjacent. We study the classic problem of enumerating all maximal cliques, an important task in social network analysis. We prove that this problem is fixed-parameter tractable with respect to $c$ on $c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07431","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":"1804.07431","created_at":"2026-05-18T00:17:32.633239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07431v1","created_at":"2026-05-18T00:17:32.633239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07431","created_at":"2026-05-18T00:17:32.633239+00:00"},{"alias_kind":"pith_short_12","alias_value":"A343NDWODUQ7","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A343NDWODUQ764YS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A343NDWO","created_at":"2026-05-18T12:32:13.499390+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/A343NDWODUQ764YSCO2EUZLQAT","json":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT.json","graph_json":"https://pith.science/api/pith-number/A343NDWODUQ764YSCO2EUZLQAT/graph.json","events_json":"https://pith.science/api/pith-number/A343NDWODUQ764YSCO2EUZLQAT/events.json","paper":"https://pith.science/paper/A343NDWO"},"agent_actions":{"view_html":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT","download_json":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT.json","view_paper":"https://pith.science/paper/A343NDWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07431&json=true","fetch_graph":"https://pith.science/api/pith-number/A343NDWODUQ764YSCO2EUZLQAT/graph.json","fetch_events":"https://pith.science/api/pith-number/A343NDWODUQ764YSCO2EUZLQAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/action/storage_attestation","attest_author":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/action/author_attestation","sign_citation":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/action/citation_signature","submit_replication":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/action/replication_record"}},"created_at":"2026-05-18T00:17:32.633239+00:00","updated_at":"2026-05-18T00:17:32.633239+00:00"}