{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A343NDWODUQ764YSCO2EUZLQAT","short_pith_number":"pith:A343NDWO","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"},"canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","source":{"kind":"arxiv","id":"1804.07431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07431","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07431v1","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07431","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"A343NDWODUQ7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A343NDWODUQ764YS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A343NDWO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A343NDWODUQ764YSCO2EUZLQAT","target":"record","payload":{"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"},"canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","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"},"source_kind":"arxiv","source_id":"1804.07431","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-18T00:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFmPuNp+M/26CdvbFICS6Lb+r38+Bmrg5Ss8ocxn9vobdX2CZ80ZNi97vhIlaO4lgw2HzXQN08sGGYVDpMKNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:58:08.459353Z"},"content_sha256":"793d6a3a8f003c98107a9bf3744fc367f1aca350b8613c82656b0da18662b360","schema_version":"1.0","event_id":"sha256:793d6a3a8f003c98107a9bf3744fc367f1aca350b8613c82656b0da18662b360"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A343NDWODUQ764YSCO2EUZLQAT","target":"graph","payload":{"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"},"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-18T00:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LlH13ogmiewKZjTNimp0h7cho1rt2ib6DchX3WJksZhF6UF3ZPxlm1K8AvzEIyq0QYa9W5KA1SYG97rrl+/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:58:08.459715Z"},"content_sha256":"c161c18721948efa38e704440f99ce9bee06b5a2e1af257eca1bd25fbd5478f0","schema_version":"1.0","event_id":"sha256:c161c18721948efa38e704440f99ce9bee06b5a2e1af257eca1bd25fbd5478f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/bundle.json","state_url":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A343NDWODUQ764YSCO2EUZLQAT/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-19T20:58:08Z","links":{"resolver":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT","bundle":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/bundle.json","state":"https://pith.science/pith/A343NDWODUQ764YSCO2EUZLQAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A343NDWODUQ764YSCO2EUZLQAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A343NDWODUQ764YSCO2EUZLQAT","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":"b9830f352ab665a4d3d031bc96c88aec26b0acf7ca4047e660e6fbce21f0dd4e","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-20T02:37:31Z","title_canon_sha256":"82082268739c34442524c10a99503ace4d04187bcf6032b4f66b5905d08ca737"},"schema_version":"1.0","source":{"id":"1804.07431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07431","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07431v1","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07431","created_at":"2026-05-18T00:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"A343NDWODUQ7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A343NDWODUQ764YS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A343NDWO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:c161c18721948efa38e704440f99ce9bee06b5a2e1af257eca1bd25fbd5478f0","target":"graph","created_at":"2026-05-18T00:17:32Z","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":"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","authors_text":"C. Seshadhri, Fan Wei, Jacob Fox, Nicole Wein, Tim Roughgarden","cross_cats":["cs.DM","cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-20T02:37:31Z","title":"Finding Cliques in Social Networks: A New Distribution-Free Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07431","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:793d6a3a8f003c98107a9bf3744fc367f1aca350b8613c82656b0da18662b360","target":"record","created_at":"2026-05-18T00:17:32Z","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":"b9830f352ab665a4d3d031bc96c88aec26b0acf7ca4047e660e6fbce21f0dd4e","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-20T02:37:31Z","title_canon_sha256":"82082268739c34442524c10a99503ace4d04187bcf6032b4f66b5905d08ca737"},"schema_version":"1.0","source":{"id":"1804.07431","kind":"arxiv","version":1}},"canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06f9b68ece1d21ff731213b44a657004cba1097462487be627aab4f99737a7da","first_computed_at":"2026-05-18T00:17:32.633144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:32.633144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fddjXRvCbRpTLCZ26jsltBygofS1QY7N8+9Cz+VP1e/v9fJ1uNd2zYBxqnJNUqMRPfLywTCqYX+pz8F0fgRVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:32.633787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:793d6a3a8f003c98107a9bf3744fc367f1aca350b8613c82656b0da18662b360","sha256:c161c18721948efa38e704440f99ce9bee06b5a2e1af257eca1bd25fbd5478f0"],"state_sha256":"0b934144e0adc66203977f2201c3b0408e4fb219a56b6abe9d49da4af9552d96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVLNf57h/FhS+Kd3JEIzsqXzv0TDdtyjNJPB94T4PcFreRdoGMNvWdUeLd4Czy8QHhFb/CScFk6Bq4MBlY5fDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T20:58:08.461781Z","bundle_sha256":"1bbbc526f80559e2b297aebfdf24a1ae4d344f750a156de81c7b9fa27f1b5e63"}}