{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4EWURG3IDBVHRV2QAMFAWASFQP","short_pith_number":"pith:4EWURG3I","canonical_record":{"source":{"id":"1305.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"2a9224d02087e1ab12adf068b420e51c6092f230181829ce3d0374deff4de21d","abstract_canon_sha256":"5d45454592a4bbdc0adf5e755385fb38d4f03972e5a8efaeb264601dbe91ca90"},"schema_version":"1.0"},"canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","source":{"kind":"arxiv","id":"1305.5372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5372","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5372v1","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5372","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"4EWURG3IDBVH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EWURG3IDBVHRV2Q","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EWURG3I","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4EWURG3IDBVHRV2QAMFAWASFQP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"2a9224d02087e1ab12adf068b420e51c6092f230181829ce3d0374deff4de21d","abstract_canon_sha256":"5d45454592a4bbdc0adf5e755385fb38d4f03972e5a8efaeb264601dbe91ca90"},"schema_version":"1.0"},"canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.953099Z","signature_b64":"eQV3aQZ8oHZgL41xYAjIh4u9KqARfZcUbmCXb35C2IAensJoTQPeHCZIO7+GyDgMME+HXQPHraOz6Ez4aTSACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","last_reissued_at":"2026-05-18T03:25:04.952404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.952404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5372","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTN+aMup8KfUi/zhUCoumR0FIwhxPefcoMUHyFG7yEMoo3/gC3LeiLsIDiY3VScUI8VAwmKfPJGxEwyj/YeaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:08.874185Z"},"content_sha256":"fe1b422def4116337842e95db6ecbdea3f69d96719f57a233f63665ed6a1db04","schema_version":"1.0","event_id":"sha256:fe1b422def4116337842e95db6ecbdea3f69d96719f57a233f63665ed6a1db04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4EWURG3IDBVHRV2QAMFAWASFQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraph Tur\\'an numbers of vertex disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-05-23T10:43:41Z","abstract_excerpt":"The Tur\\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\\left({n;H} \\right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let $\\mathcal{C}_{\\ell}^{\\left(k \\right)}$ denote the family of all $k$-uniform minimal cycles of length $\\ell$, $\\mathcal{S}(\\ell_1,\\ldots,\\ell_r)$ denote the family of hypergraphs consisting of unions of $r$ vertex disjoint minimal cycles of length $\\ell_1,\\ldots,\\ell_r$, respectively, and $\\mathbb{C}_{\\ell}^{\\left(k \\right)}$ denote a $k$-uniform linear cycle of length $\\ell$. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5372","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjapCN5yeMWZrgE5m7z4knF/KQPGOxpitA1Sa0cOpvW8+LLGKaf/AV0XhopFHoi+TiHCRQM8famG6PMeBz1+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:08.874895Z"},"content_sha256":"6367e9f66fa3d96c1534315d5e024dbaf2ca5d1b12381a903099541c70a70d91","schema_version":"1.0","event_id":"sha256:6367e9f66fa3d96c1534315d5e024dbaf2ca5d1b12381a903099541c70a70d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/bundle.json","state_url":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EWURG3IDBVHRV2QAMFAWASFQP/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-05-25T11:10:08Z","links":{"resolver":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP","bundle":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/bundle.json","state":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EWURG3IDBVHRV2QAMFAWASFQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4EWURG3IDBVHRV2QAMFAWASFQP","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":"5d45454592a4bbdc0adf5e755385fb38d4f03972e5a8efaeb264601dbe91ca90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","title_canon_sha256":"2a9224d02087e1ab12adf068b420e51c6092f230181829ce3d0374deff4de21d"},"schema_version":"1.0","source":{"id":"1305.5372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5372","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5372v1","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5372","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"4EWURG3IDBVH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EWURG3IDBVHRV2Q","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EWURG3I","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6367e9f66fa3d96c1534315d5e024dbaf2ca5d1b12381a903099541c70a70d91","target":"graph","created_at":"2026-05-18T03:25:04Z","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":"The Tur\\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\\left({n;H} \\right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let $\\mathcal{C}_{\\ell}^{\\left(k \\right)}$ denote the family of all $k$-uniform minimal cycles of length $\\ell$, $\\mathcal{S}(\\ell_1,\\ldots,\\ell_r)$ denote the family of hypergraphs consisting of unions of $r$ vertex disjoint minimal cycles of length $\\ell_1,\\ldots,\\ell_r$, respectively, and $\\mathbb{C}_{\\ell}^{\\left(k \\right)}$ denote a $k$-uniform linear cycle of length $\\ell$. We","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","title":"Hypergraph Tur\\'an numbers of vertex disjoint cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5372","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:fe1b422def4116337842e95db6ecbdea3f69d96719f57a233f63665ed6a1db04","target":"record","created_at":"2026-05-18T03:25:04Z","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":"5d45454592a4bbdc0adf5e755385fb38d4f03972e5a8efaeb264601dbe91ca90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","title_canon_sha256":"2a9224d02087e1ab12adf068b420e51c6092f230181829ce3d0374deff4de21d"},"schema_version":"1.0","source":{"id":"1305.5372","kind":"arxiv","version":1}},"canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","first_computed_at":"2026-05-18T03:25:04.952404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:04.952404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQV3aQZ8oHZgL41xYAjIh4u9KqARfZcUbmCXb35C2IAensJoTQPeHCZIO7+GyDgMME+HXQPHraOz6Ez4aTSACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:04.953099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe1b422def4116337842e95db6ecbdea3f69d96719f57a233f63665ed6a1db04","sha256:6367e9f66fa3d96c1534315d5e024dbaf2ca5d1b12381a903099541c70a70d91"],"state_sha256":"242d165db38f8e39cba8bb4172b8c59f16256a67b53abbdd2d273d4197cae54f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bA+GgrPD+smPlmaHMvLRv2E78/GnPy/SWJsvZqWD9UuxgZDAa/+Yjap8Htr78CqiacyrVnAUF8HFpJvUgyb7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:10:08.878514Z","bundle_sha256":"0b24177eb65c86b38a0858a433dff3a913e0a817a141b12635d7523237b43e8a"}}