{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WWSDHN7PIUXB6VADAUFWQWP2YR","short_pith_number":"pith:WWSDHN7P","schema_version":"1.0","canonical_sha256":"b5a433b7ef452e1f5403050b6859fac45334e67fb8003b3468e22e5e7661cf17","source":{"kind":"arxiv","id":"1803.11114","version":1},"attestation_state":"computed","paper":{"title":"The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan Dreier, Peter Rossmanith, Philipp Kuinke","submitted_at":"2018-03-29T15:24:06Z","abstract_excerpt":"Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already have high degree. We use improved concentration bounds for vertex degrees to show that preferential attachment graphs contain asymptotically almost surely (a.a.s.) a one-subdivided clique of size at least $(\\log n)^{1/4}$. Therefore, preferential attachment graphs are a.a.s somewhere-dense. This implies that algorithmic techniques developed for sparse graphs"},"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":"1803.11114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-29T15:24:06Z","cross_cats_sorted":[],"title_canon_sha256":"ab8cb24375378c27c4e5a8c7f51e970049f217ddb966ba391c404541ae438cf8","abstract_canon_sha256":"1071e0ec25690e86a341f51199182b23c49f4b69b182b49f32e31036dfbe064c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:48.463215Z","signature_b64":"qvc06O+uz9mLOCBuD85zcfSee3wrlVQK7Ye2WqniYhLNlpXHqzGywdT4Xny5YjOfRmyIs+T6XkIxU0da6nH5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a433b7ef452e1f5403050b6859fac45334e67fb8003b3468e22e5e7661cf17","last_reissued_at":"2026-05-18T00:19:48.462506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:48.462506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan Dreier, Peter Rossmanith, Philipp Kuinke","submitted_at":"2018-03-29T15:24:06Z","abstract_excerpt":"Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already have high degree. We use improved concentration bounds for vertex degrees to show that preferential attachment graphs contain asymptotically almost surely (a.a.s.) a one-subdivided clique of size at least $(\\log n)^{1/4}$. Therefore, preferential attachment graphs are a.a.s somewhere-dense. This implies that algorithmic techniques developed for sparse graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11114","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":"1803.11114","created_at":"2026-05-18T00:19:48.462634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11114v1","created_at":"2026-05-18T00:19:48.462634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11114","created_at":"2026-05-18T00:19:48.462634+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWSDHN7PIUXB","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWSDHN7PIUXB6VAD","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWSDHN7P","created_at":"2026-05-18T12:33:01.666342+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/WWSDHN7PIUXB6VADAUFWQWP2YR","json":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR.json","graph_json":"https://pith.science/api/pith-number/WWSDHN7PIUXB6VADAUFWQWP2YR/graph.json","events_json":"https://pith.science/api/pith-number/WWSDHN7PIUXB6VADAUFWQWP2YR/events.json","paper":"https://pith.science/paper/WWSDHN7P"},"agent_actions":{"view_html":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR","download_json":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR.json","view_paper":"https://pith.science/paper/WWSDHN7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11114&json=true","fetch_graph":"https://pith.science/api/pith-number/WWSDHN7PIUXB6VADAUFWQWP2YR/graph.json","fetch_events":"https://pith.science/api/pith-number/WWSDHN7PIUXB6VADAUFWQWP2YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR/action/storage_attestation","attest_author":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR/action/author_attestation","sign_citation":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR/action/citation_signature","submit_replication":"https://pith.science/pith/WWSDHN7PIUXB6VADAUFWQWP2YR/action/replication_record"}},"created_at":"2026-05-18T00:19:48.462634+00:00","updated_at":"2026-05-18T00:19:48.462634+00:00"}