{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WRS3B6IBIZ6EX3LJTROOMZHGDS","short_pith_number":"pith:WRS3B6IB","canonical_record":{"source":{"id":"1807.04683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T15:47:57Z","cross_cats_sorted":[],"title_canon_sha256":"d4887227f7510d5dad58299fdcfde6a4832d5a94196bf1c974fe3ae024ab3dbc","abstract_canon_sha256":"f725b8889e1579aceffdace52cd47bff981539bc222423a6b7ba5273c614be86"},"schema_version":"1.0"},"canonical_sha256":"b465b0f901467c4bed699c5ce664e61cad878be5b7ce2a1c78fb03422ebfeaa6","source":{"kind":"arxiv","id":"1807.04683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04683","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04683v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04683","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"WRS3B6IBIZ6E","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRS3B6IBIZ6EX3LJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRS3B6IB","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WRS3B6IBIZ6EX3LJTROOMZHGDS","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T15:47:57Z","cross_cats_sorted":[],"title_canon_sha256":"d4887227f7510d5dad58299fdcfde6a4832d5a94196bf1c974fe3ae024ab3dbc","abstract_canon_sha256":"f725b8889e1579aceffdace52cd47bff981539bc222423a6b7ba5273c614be86"},"schema_version":"1.0"},"canonical_sha256":"b465b0f901467c4bed699c5ce664e61cad878be5b7ce2a1c78fb03422ebfeaa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:52.813504Z","signature_b64":"lWxZxrmw9dUzczKv8nRLPOenmtKVsaP0m0wi9lqxmSQqhglqa4LCtffMDr2Cfs3FpgZqZx1j7QMrhahFIAY5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b465b0f901467c4bed699c5ce664e61cad878be5b7ce2a1c78fb03422ebfeaa6","last_reissued_at":"2026-05-18T00:10:52.812839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:52.812839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04683","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-18T00:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPDZRxMNFD7BzXo4/Zwk8tPS/e0n/FAP4aChzhJTs8PvCnvjTyqVcoNvmOtszC1w8bD5oED5aGQDkzHLK4YxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:01.432960Z"},"content_sha256":"924d57914fd6ba9d21ee55403a678a0673397a7a1c2984c5c1bfc0c3a44eb0dc","schema_version":"1.0","event_id":"sha256:924d57914fd6ba9d21ee55403a678a0673397a7a1c2984c5c1bfc0c3a44eb0dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WRS3B6IBIZ6EX3LJTROOMZHGDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $r$-uniform hypergraphs with circumference less than $r$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Ruth Luo","submitted_at":"2018-07-12T15:47:57Z","abstract_excerpt":"We show that for each $k\\geq 4$ and $n>r\\geq k+1$, every $n$-vertex $r$-uniform hypergraph with no Berge cycle of length at least $k$ has at most $\\frac{(k-1)(n-1)}{r}$ edges. The bound is exact, and we describe the extremal hypergraphs. This implies and slightly refines the theorem of Gy\\H{o}ri, Katona and Lemons that for $n>r\\geq k\\geq 3$, every $n$-vertex $r$-uniform hypergraph with no Berge path of length $k$ has at most $\\frac{(k-1)n}{r+1}$ edges. To obtain the bounds, we study bipartite graphs with no cycles of length at least $2k$, and then translate the results into the language of mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04683","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-18T00:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0UWp/EJsxx06pO8YcMoAFgnN0RvEO3eSd0BRYh6G0m7cUmKMrsaMRMQyE328vdcSfhCnF4sXML+S6O2wB1RCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:01.433706Z"},"content_sha256":"64a9c476112e85f4b2f6edb59c40dc098ae48ad5b5a4955e1e7fdbe3c108bed5","schema_version":"1.0","event_id":"sha256:64a9c476112e85f4b2f6edb59c40dc098ae48ad5b5a4955e1e7fdbe3c108bed5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/bundle.json","state_url":"https://pith.science/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/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-29T21:22:01Z","links":{"resolver":"https://pith.science/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS","bundle":"https://pith.science/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/bundle.json","state":"https://pith.science/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRS3B6IBIZ6EX3LJTROOMZHGDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WRS3B6IBIZ6EX3LJTROOMZHGDS","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":"f725b8889e1579aceffdace52cd47bff981539bc222423a6b7ba5273c614be86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T15:47:57Z","title_canon_sha256":"d4887227f7510d5dad58299fdcfde6a4832d5a94196bf1c974fe3ae024ab3dbc"},"schema_version":"1.0","source":{"id":"1807.04683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04683","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04683v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04683","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"WRS3B6IBIZ6E","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRS3B6IBIZ6EX3LJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRS3B6IB","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:64a9c476112e85f4b2f6edb59c40dc098ae48ad5b5a4955e1e7fdbe3c108bed5","target":"graph","created_at":"2026-05-18T00:10:52Z","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":"We show that for each $k\\geq 4$ and $n>r\\geq k+1$, every $n$-vertex $r$-uniform hypergraph with no Berge cycle of length at least $k$ has at most $\\frac{(k-1)(n-1)}{r}$ edges. The bound is exact, and we describe the extremal hypergraphs. This implies and slightly refines the theorem of Gy\\H{o}ri, Katona and Lemons that for $n>r\\geq k\\geq 3$, every $n$-vertex $r$-uniform hypergraph with no Berge path of length $k$ has at most $\\frac{(k-1)n}{r+1}$ edges. To obtain the bounds, we study bipartite graphs with no cycles of length at least $2k$, and then translate the results into the language of mul","authors_text":"Alexandr Kostochka, Ruth Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T15:47:57Z","title":"On $r$-uniform hypergraphs with circumference less than $r$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04683","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:924d57914fd6ba9d21ee55403a678a0673397a7a1c2984c5c1bfc0c3a44eb0dc","target":"record","created_at":"2026-05-18T00:10:52Z","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":"f725b8889e1579aceffdace52cd47bff981539bc222423a6b7ba5273c614be86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T15:47:57Z","title_canon_sha256":"d4887227f7510d5dad58299fdcfde6a4832d5a94196bf1c974fe3ae024ab3dbc"},"schema_version":"1.0","source":{"id":"1807.04683","kind":"arxiv","version":1}},"canonical_sha256":"b465b0f901467c4bed699c5ce664e61cad878be5b7ce2a1c78fb03422ebfeaa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b465b0f901467c4bed699c5ce664e61cad878be5b7ce2a1c78fb03422ebfeaa6","first_computed_at":"2026-05-18T00:10:52.812839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:52.812839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lWxZxrmw9dUzczKv8nRLPOenmtKVsaP0m0wi9lqxmSQqhglqa4LCtffMDr2Cfs3FpgZqZx1j7QMrhahFIAY5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:52.813504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:924d57914fd6ba9d21ee55403a678a0673397a7a1c2984c5c1bfc0c3a44eb0dc","sha256:64a9c476112e85f4b2f6edb59c40dc098ae48ad5b5a4955e1e7fdbe3c108bed5"],"state_sha256":"b4a85699f0234a9fb19b3138d1a4ec61325fea4983281dee47fddd160ca601c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgsXrL18gbOr3TgLW7r4wQON8C4C2QC2QeSnemlVN9zGyQgq6rESP3JQFrnXSysz6ebhm2c+suJ2F79dPhPnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:22:01.438606Z","bundle_sha256":"1e02ae2c1b411e747b06f14ad890326ab954eff875f766c5acff64a7028e5fba"}}