{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6YQCS667DMRRN765QFDDMVXXMG","short_pith_number":"pith:6YQCS667","canonical_record":{"source":{"id":"1301.1870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T14:39:22Z","cross_cats_sorted":[],"title_canon_sha256":"f45a0c51ad13d9b8471645ca299790514abddfd2970f667bef1b5ddce0f50e14","abstract_canon_sha256":"a1a9a0b383175f3ac4cba4f580985442301d764221859068b712821cf1d3976f"},"schema_version":"1.0"},"canonical_sha256":"f620297bdf1b2316ffdd81463656f7618d5981e7637d4152a84a9a5261d9c5a1","source":{"kind":"arxiv","id":"1301.1870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1870","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1870v1","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1870","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"pith_short_12","alias_value":"6YQCS667DMRR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6YQCS667DMRRN765","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6YQCS667","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6YQCS667DMRRN765QFDDMVXXMG","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T14:39:22Z","cross_cats_sorted":[],"title_canon_sha256":"f45a0c51ad13d9b8471645ca299790514abddfd2970f667bef1b5ddce0f50e14","abstract_canon_sha256":"a1a9a0b383175f3ac4cba4f580985442301d764221859068b712821cf1d3976f"},"schema_version":"1.0"},"canonical_sha256":"f620297bdf1b2316ffdd81463656f7618d5981e7637d4152a84a9a5261d9c5a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:55.795919Z","signature_b64":"PoevpvhKGpke1OtHmJGPnnTGZl8xvli8GMf9E3M2XTnnxbhVFP4GE8OzFM5rYFxbaQ51kgpiWfR+4f6kaNl/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f620297bdf1b2316ffdd81463656f7618d5981e7637d4152a84a9a5261d9c5a1","last_reissued_at":"2026-05-18T03:36:55.795329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:55.795329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1870","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-18T03:36:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljx5jgHhzrDyaYVwM0xwrlZJWqtt4j1rXk7LIXvsb2CxrYODgh/mZbGeky2RH7rjMHHb5w/oM3OKWAAJdog3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:04.121259Z"},"content_sha256":"c88ba18319cb42c66c468e1f24212ebf11d5fdd6eced68d9a16ca5fc414624c3","schema_version":"1.0","event_id":"sha256:c88ba18319cb42c66c468e1f24212ebf11d5fdd6eced68d9a16ca5fc414624c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6YQCS667DMRRN765QFDDMVXXMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turan Problems on Non-uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Travis Johnston","submitted_at":"2013-01-09T14:39:22Z","abstract_excerpt":"A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types. For a fixed hypergraph $H$, the Tur\\'an density $\\pi(H)$ is defined to be $\\lim_{n\\to\\infty}\\max_{G_n}h_n(G_n)$, where the maximum is taken over all $H$-free hypergraphs $G_n$ on $n$ vertices satisfying $R(G_n)\\subseteq R(H)$, and $h_n(G_n)$, the so called Lubell function, is the expected number of edges in $G_n$ hit by a random full chain. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1870","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-18T03:36:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51FRWoHCYuGbea4HaSskUakm8ypDG4uR85ReR5G9ZYjpd9aOGuIiuYwCIGOKqnxCHxKYz14nboQpEPJWWyKtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:04.121615Z"},"content_sha256":"1be9a8616ac89eece7eaadfa4eb0a58107afb69c43d8b431ba5a97e0cede7712","schema_version":"1.0","event_id":"sha256:1be9a8616ac89eece7eaadfa4eb0a58107afb69c43d8b431ba5a97e0cede7712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YQCS667DMRRN765QFDDMVXXMG/bundle.json","state_url":"https://pith.science/pith/6YQCS667DMRRN765QFDDMVXXMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YQCS667DMRRN765QFDDMVXXMG/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-01T22:22:04Z","links":{"resolver":"https://pith.science/pith/6YQCS667DMRRN765QFDDMVXXMG","bundle":"https://pith.science/pith/6YQCS667DMRRN765QFDDMVXXMG/bundle.json","state":"https://pith.science/pith/6YQCS667DMRRN765QFDDMVXXMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YQCS667DMRRN765QFDDMVXXMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6YQCS667DMRRN765QFDDMVXXMG","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":"a1a9a0b383175f3ac4cba4f580985442301d764221859068b712821cf1d3976f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T14:39:22Z","title_canon_sha256":"f45a0c51ad13d9b8471645ca299790514abddfd2970f667bef1b5ddce0f50e14"},"schema_version":"1.0","source":{"id":"1301.1870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1870","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1870v1","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1870","created_at":"2026-05-18T03:36:55Z"},{"alias_kind":"pith_short_12","alias_value":"6YQCS667DMRR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6YQCS667DMRRN765","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6YQCS667","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:1be9a8616ac89eece7eaadfa4eb0a58107afb69c43d8b431ba5a97e0cede7712","target":"graph","created_at":"2026-05-18T03:36:55Z","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":"A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types. For a fixed hypergraph $H$, the Tur\\'an density $\\pi(H)$ is defined to be $\\lim_{n\\to\\infty}\\max_{G_n}h_n(G_n)$, where the maximum is taken over all $H$-free hypergraphs $G_n$ on $n$ vertices satisfying $R(G_n)\\subseteq R(H)$, and $h_n(G_n)$, the so called Lubell function, is the expected number of edges in $G_n$ hit by a random full chain. T","authors_text":"Linyuan Lu, Travis Johnston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T14:39:22Z","title":"Turan Problems on Non-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1870","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:c88ba18319cb42c66c468e1f24212ebf11d5fdd6eced68d9a16ca5fc414624c3","target":"record","created_at":"2026-05-18T03:36:55Z","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":"a1a9a0b383175f3ac4cba4f580985442301d764221859068b712821cf1d3976f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-09T14:39:22Z","title_canon_sha256":"f45a0c51ad13d9b8471645ca299790514abddfd2970f667bef1b5ddce0f50e14"},"schema_version":"1.0","source":{"id":"1301.1870","kind":"arxiv","version":1}},"canonical_sha256":"f620297bdf1b2316ffdd81463656f7618d5981e7637d4152a84a9a5261d9c5a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f620297bdf1b2316ffdd81463656f7618d5981e7637d4152a84a9a5261d9c5a1","first_computed_at":"2026-05-18T03:36:55.795329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:55.795329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PoevpvhKGpke1OtHmJGPnnTGZl8xvli8GMf9E3M2XTnnxbhVFP4GE8OzFM5rYFxbaQ51kgpiWfR+4f6kaNl/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:55.795919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88ba18319cb42c66c468e1f24212ebf11d5fdd6eced68d9a16ca5fc414624c3","sha256:1be9a8616ac89eece7eaadfa4eb0a58107afb69c43d8b431ba5a97e0cede7712"],"state_sha256":"e00aa44df431c55fbc2f2ca6a579ca538113ad1f88f08cf5723307e57369e470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhOHjuU2y9DlS7F7qz9x3XpZ39s7Uw/RWGtDAT0XjvGGnQbWB+LJXfxR5oOe25k16z2H9NMgjIs6bgcMfdgnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:04.123574Z","bundle_sha256":"317ca789abb3813b9f315db22e3468e9144b46fd25084136f79fb1716472cad5"}}