{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2FM6R6L3Z5YV72GWLKZDTMJ7S3","short_pith_number":"pith:2FM6R6L3","schema_version":"1.0","canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","source":{"kind":"arxiv","id":"1407.7873","version":1},"attestation_state":"computed","paper":{"title":"The Density Tur\\'an problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2014-07-29T20:08:39Z","abstract_excerpt":"Let $H$ be a graph on $n$ vertices and let the blow-up graph\n  $G[H]$ be defined as follows. We replace each vertex $v_i$ of $H$ by a cluster\n  $A_i$ and connect some pairs of vertices of $A_i$ and $A_j$ if $(v_i,v_j)$ was\n  an edge of the graph $H$. As usual, we define the edge density between $A_i$ and $A_j$ as $d(A_i,A_j)=\\frac{e(A_i,A_j)}{|A_i||A_j|}.$ We study the following problem. Given densities $\\gamma_{ij}$ for each edge $(i,j)\\in E(H)$. Then one has to decide whether there exists a blow-up graph $G[H]$ with edge densities at least $\\gamma_{ij}$ such that one cannot choose a vertex f"},"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":"1407.7873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-29T20:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"b796b9ddc8ced74ced9674a11611b35d2e2b2d2e415df55179cb4026ecce1396","abstract_canon_sha256":"82172a5407af5f6955672be358d141db4877138c050a2426d3219c5ff46821f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:14.287196Z","signature_b64":"WnaZVWzu55EIwo3i8NMTw2LHS3E6blpp+clw/ofRAdmiYDPIoynAugZldvPAlQh34YBUKcgKzrXafze6SIXDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","last_reissued_at":"2026-05-18T02:46:14.286458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:14.286458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Density Tur\\'an problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2014-07-29T20:08:39Z","abstract_excerpt":"Let $H$ be a graph on $n$ vertices and let the blow-up graph\n  $G[H]$ be defined as follows. We replace each vertex $v_i$ of $H$ by a cluster\n  $A_i$ and connect some pairs of vertices of $A_i$ and $A_j$ if $(v_i,v_j)$ was\n  an edge of the graph $H$. As usual, we define the edge density between $A_i$ and $A_j$ as $d(A_i,A_j)=\\frac{e(A_i,A_j)}{|A_i||A_j|}.$ We study the following problem. Given densities $\\gamma_{ij}$ for each edge $(i,j)\\in E(H)$. Then one has to decide whether there exists a blow-up graph $G[H]$ with edge densities at least $\\gamma_{ij}$ such that one cannot choose a vertex f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7873","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":"1407.7873","created_at":"2026-05-18T02:46:14.286590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7873v1","created_at":"2026-05-18T02:46:14.286590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7873","created_at":"2026-05-18T02:46:14.286590+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FM6R6L3Z5YV","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FM6R6L3Z5YV72GW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FM6R6L3","created_at":"2026-05-18T12:28:09.283467+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/2FM6R6L3Z5YV72GWLKZDTMJ7S3","json":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3.json","graph_json":"https://pith.science/api/pith-number/2FM6R6L3Z5YV72GWLKZDTMJ7S3/graph.json","events_json":"https://pith.science/api/pith-number/2FM6R6L3Z5YV72GWLKZDTMJ7S3/events.json","paper":"https://pith.science/paper/2FM6R6L3"},"agent_actions":{"view_html":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3","download_json":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3.json","view_paper":"https://pith.science/paper/2FM6R6L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7873&json=true","fetch_graph":"https://pith.science/api/pith-number/2FM6R6L3Z5YV72GWLKZDTMJ7S3/graph.json","fetch_events":"https://pith.science/api/pith-number/2FM6R6L3Z5YV72GWLKZDTMJ7S3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/action/storage_attestation","attest_author":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/action/author_attestation","sign_citation":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/action/citation_signature","submit_replication":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/action/replication_record"}},"created_at":"2026-05-18T02:46:14.286590+00:00","updated_at":"2026-05-18T02:46:14.286590+00:00"}