{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2FM6R6L3Z5YV72GWLKZDTMJ7S3","short_pith_number":"pith:2FM6R6L3","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"},"canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","source":{"kind":"arxiv","id":"1407.7873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7873","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7873v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7873","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"2FM6R6L3Z5YV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FM6R6L3Z5YV72GW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FM6R6L3","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2FM6R6L3Z5YV72GWLKZDTMJ7S3","target":"record","payload":{"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"},"canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","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"},"source_kind":"arxiv","source_id":"1407.7873","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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ev7wPGcbvncAFzLVljvqfmexA87TBTILnX1opSFoJXqwayv9ojDxUWDXhb7Nx1fXDC2zFtp9esKxNWW1o5VwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:59:43.622655Z"},"content_sha256":"65a5079af02e0501a3cbf089e7eabdc2bae84ae81337c57096166b896e199ed1","schema_version":"1.0","event_id":"sha256:65a5079af02e0501a3cbf089e7eabdc2bae84ae81337c57096166b896e199ed1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2FM6R6L3Z5YV72GWLKZDTMJ7S3","target":"graph","payload":{"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"},"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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQDsZae0uolOrilSg0dtytKW/mM7/5lTtr9TFoyEJ/vAHVwCMwsdw9Z3z4M+gxydPrDxpJkdUKiDJy4gINP5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:59:43.623028Z"},"content_sha256":"99ce536f0c283a418d1898a7e818e86e21a9f2f6c13eb2e96684d4525574a88e","schema_version":"1.0","event_id":"sha256:99ce536f0c283a418d1898a7e818e86e21a9f2f6c13eb2e96684d4525574a88e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/bundle.json","state_url":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/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-06-01T17:59:43Z","links":{"resolver":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3","bundle":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/bundle.json","state":"https://pith.science/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FM6R6L3Z5YV72GWLKZDTMJ7S3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2FM6R6L3Z5YV72GWLKZDTMJ7S3","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":"82172a5407af5f6955672be358d141db4877138c050a2426d3219c5ff46821f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-29T20:08:39Z","title_canon_sha256":"b796b9ddc8ced74ced9674a11611b35d2e2b2d2e415df55179cb4026ecce1396"},"schema_version":"1.0","source":{"id":"1407.7873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7873","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7873v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7873","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"2FM6R6L3Z5YV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FM6R6L3Z5YV72GW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FM6R6L3","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:99ce536f0c283a418d1898a7e818e86e21a9f2f6c13eb2e96684d4525574a88e","target":"graph","created_at":"2026-05-18T02:46:14Z","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":"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","authors_text":"P\\'eter Csikv\\'ari, Zolt\\'an L\\'or\\'ant Nagy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-29T20:08:39Z","title":"The Density Tur\\'an problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7873","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:65a5079af02e0501a3cbf089e7eabdc2bae84ae81337c57096166b896e199ed1","target":"record","created_at":"2026-05-18T02:46:14Z","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":"82172a5407af5f6955672be358d141db4877138c050a2426d3219c5ff46821f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-29T20:08:39Z","title_canon_sha256":"b796b9ddc8ced74ced9674a11611b35d2e2b2d2e415df55179cb4026ecce1396"},"schema_version":"1.0","source":{"id":"1407.7873","kind":"arxiv","version":1}},"canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d159e8f97bcf715fe8d65ab239b13f96cc92d39b0b077b8b2e931929917ca569","first_computed_at":"2026-05-18T02:46:14.286458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:14.286458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WnaZVWzu55EIwo3i8NMTw2LHS3E6blpp+clw/ofRAdmiYDPIoynAugZldvPAlQh34YBUKcgKzrXafze6SIXDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:14.287196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65a5079af02e0501a3cbf089e7eabdc2bae84ae81337c57096166b896e199ed1","sha256:99ce536f0c283a418d1898a7e818e86e21a9f2f6c13eb2e96684d4525574a88e"],"state_sha256":"4062a8e3c8d69b58e6efef1a7f195ee84ace0a2fc142be62d0d629d3798cae65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4eHeAxYTkElk25hkeTmAv7+59DgxbzO6JCrLsjY2ld7g6UFASmn5vSJCLrIoillRsPauRqJaNEvFXoxCsWDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:59:43.624992Z","bundle_sha256":"112e0db652c8ca6cf3ad2f18276cfc7b39cb4fd5f93fe4198926a5789e60a18d"}}