{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Z2RNZEXNGM2JSOSELC3NRUUDUX","short_pith_number":"pith:Z2RNZEXN","canonical_record":{"source":{"id":"1505.03210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T01:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"5460ef4e8fa802d7167690376c089a2b9def32b98f491c990e2d60845ae2451c","abstract_canon_sha256":"87a40109d6321a36bd3b0c6ddedd2486980eb5bc58daca0022a1a9d21f910196"},"schema_version":"1.0"},"canonical_sha256":"cea2dc92ed3334993a4458b6d8d283a5fecf441d828efba0ecaa062b19c3be71","source":{"kind":"arxiv","id":"1505.03210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03210","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03210v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03210","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z2RNZEXNGM2J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z2RNZEXNGM2JSOSE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z2RNZEXN","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Z2RNZEXNGM2JSOSELC3NRUUDUX","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T01:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"5460ef4e8fa802d7167690376c089a2b9def32b98f491c990e2d60845ae2451c","abstract_canon_sha256":"87a40109d6321a36bd3b0c6ddedd2486980eb5bc58daca0022a1a9d21f910196"},"schema_version":"1.0"},"canonical_sha256":"cea2dc92ed3334993a4458b6d8d283a5fecf441d828efba0ecaa062b19c3be71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.121900Z","signature_b64":"7ZmHTM7fsQctFzDTQiG4sajpeMyjPI11OJbRHEMJHXnHGqCgDoD02U138So4oW1+nB0R4BDqGKzplrCGoe5dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea2dc92ed3334993a4458b6d8d283a5fecf441d828efba0ecaa062b19c3be71","last_reissued_at":"2026-05-18T02:12:10.120949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.120949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03210","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuf19m0BMbHRLKY8LqTYNascONc0DyCd1qqMcc/rV2M3kFKHTP9rISdZs1BArn1c8E7BKYeyBFFrKUtKZ/2fBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:37:02.206097Z"},"content_sha256":"5a901fd130e74b7743b41aec43d29330f280b149498d61c5c07965792412f0ee","schema_version":"1.0","event_id":"sha256:5a901fd130e74b7743b41aec43d29330f280b149498d61c5c07965792412f0ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Z2RNZEXNGM2JSOSELC3NRUUDUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an numbers of hypergraph trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tao Jiang, Zolt\\'an F\\\"uredi","submitted_at":"2015-05-13T01:36:19Z","abstract_excerpt":"An $r$-graph is an $r$-uniform hypergraph tree (or $r$-tree) if its edges can be ordered as $E_1,\\ldots, E_m$ such that $\\forall i>1 \\, \\exists \\alpha(i)<i$ such that $E_i\\cap (\\bigcup_{j=1}^{i-1} E_j)\\subseteq E_{\\alpha(i)}$. The Tur\\'an number $ex(n,{\\cal H})$ of an $r$-graph ${\\cal H}$ is the largest size of an $n$-vertex $r$-graph that does not contain ${\\cal H}$. A cross-cut of ${\\cal H}$ is a set of vertices in ${\\cal H}$ that contains exactly one vertex of each edge of ${\\cal H}$. The cross-cut number $\\sigma({\\cal H})$ of ${\\cal H}$ is the minimum size of a cross-cut of ${\\cal H}$. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03210","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctsP7elx0u9PljGcQ1+/S9eRxcsmT2ghplzy+o3nz13llgr6KJ3W8vCt9cjyPbyGC30ydSqqWl40d2BOOmxrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:37:02.206762Z"},"content_sha256":"4e0efa2c3855330ad9da209e45d39faf4f28a55d95368458a29b4f02a1896a9c","schema_version":"1.0","event_id":"sha256:4e0efa2c3855330ad9da209e45d39faf4f28a55d95368458a29b4f02a1896a9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/bundle.json","state_url":"https://pith.science/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/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-01T05:37:02Z","links":{"resolver":"https://pith.science/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX","bundle":"https://pith.science/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/bundle.json","state":"https://pith.science/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2RNZEXNGM2JSOSELC3NRUUDUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Z2RNZEXNGM2JSOSELC3NRUUDUX","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":"87a40109d6321a36bd3b0c6ddedd2486980eb5bc58daca0022a1a9d21f910196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T01:36:19Z","title_canon_sha256":"5460ef4e8fa802d7167690376c089a2b9def32b98f491c990e2d60845ae2451c"},"schema_version":"1.0","source":{"id":"1505.03210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03210","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03210v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03210","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z2RNZEXNGM2J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z2RNZEXNGM2JSOSE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z2RNZEXN","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:4e0efa2c3855330ad9da209e45d39faf4f28a55d95368458a29b4f02a1896a9c","target":"graph","created_at":"2026-05-18T02:12:10Z","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":"An $r$-graph is an $r$-uniform hypergraph tree (or $r$-tree) if its edges can be ordered as $E_1,\\ldots, E_m$ such that $\\forall i>1 \\, \\exists \\alpha(i)<i$ such that $E_i\\cap (\\bigcup_{j=1}^{i-1} E_j)\\subseteq E_{\\alpha(i)}$. The Tur\\'an number $ex(n,{\\cal H})$ of an $r$-graph ${\\cal H}$ is the largest size of an $n$-vertex $r$-graph that does not contain ${\\cal H}$. A cross-cut of ${\\cal H}$ is a set of vertices in ${\\cal H}$ that contains exactly one vertex of each edge of ${\\cal H}$. The cross-cut number $\\sigma({\\cal H})$ of ${\\cal H}$ is the minimum size of a cross-cut of ${\\cal H}$. We ","authors_text":"Tao Jiang, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T01:36:19Z","title":"Tur\\'an numbers of hypergraph trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03210","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:5a901fd130e74b7743b41aec43d29330f280b149498d61c5c07965792412f0ee","target":"record","created_at":"2026-05-18T02:12:10Z","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":"87a40109d6321a36bd3b0c6ddedd2486980eb5bc58daca0022a1a9d21f910196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T01:36:19Z","title_canon_sha256":"5460ef4e8fa802d7167690376c089a2b9def32b98f491c990e2d60845ae2451c"},"schema_version":"1.0","source":{"id":"1505.03210","kind":"arxiv","version":1}},"canonical_sha256":"cea2dc92ed3334993a4458b6d8d283a5fecf441d828efba0ecaa062b19c3be71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea2dc92ed3334993a4458b6d8d283a5fecf441d828efba0ecaa062b19c3be71","first_computed_at":"2026-05-18T02:12:10.120949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.120949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZmHTM7fsQctFzDTQiG4sajpeMyjPI11OJbRHEMJHXnHGqCgDoD02U138So4oW1+nB0R4BDqGKzplrCGoe5dDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.121900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a901fd130e74b7743b41aec43d29330f280b149498d61c5c07965792412f0ee","sha256:4e0efa2c3855330ad9da209e45d39faf4f28a55d95368458a29b4f02a1896a9c"],"state_sha256":"46cafaa38d61d4e992b9850f164f68d682c5107de4e8cc2b5de6d43544dd623a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2jSH+5SgjEZudGkryy5WBfZF12N77ve/i9QB7TP033kLh5O19aDvlvI4UXq7iql6hYY3v2GJJsD0qXZePDDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:37:02.209686Z","bundle_sha256":"f8e550095359aef0b3a3dae5252094d3a74f0946d57b11867c2bad09e3c8e719"}}