{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TW5VVUF3OLUDVGRM6PPTNGEVMD","short_pith_number":"pith:TW5VVUF3","canonical_record":{"source":{"id":"2410.21733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"d400626af4bd0981d8a181eeac984aa634b379d75150d46c01f05c69f7c5a3ce","abstract_canon_sha256":"2d2245c03912b04d8acb8d01a7f7f7213227a0b2d0bf91c8b0c9dedd370a2f05"},"schema_version":"1.0"},"canonical_sha256":"9dbb5ad0bb72e83a9a2cf3df36989560e4d76a68a88df024845e1d6a2de66f0f","source":{"kind":"arxiv","id":"2410.21733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21733","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21733v1","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21733","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"TW5VVUF3OLUD","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"TW5VVUF3OLUDVGRM","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"TW5VVUF3","created_at":"2026-07-05T09:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TW5VVUF3OLUDVGRM6PPTNGEVMD","target":"record","payload":{"canonical_record":{"source":{"id":"2410.21733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"d400626af4bd0981d8a181eeac984aa634b379d75150d46c01f05c69f7c5a3ce","abstract_canon_sha256":"2d2245c03912b04d8acb8d01a7f7f7213227a0b2d0bf91c8b0c9dedd370a2f05"},"schema_version":"1.0"},"canonical_sha256":"9dbb5ad0bb72e83a9a2cf3df36989560e4d76a68a88df024845e1d6a2de66f0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:32.415679Z","signature_b64":"UK92BsHi5dygh6qHpMy9HHMyhLMnO7zFBlHAsybTpvUg/ZVZG9yjxFSr4lsDL0uTfWiM9hOTNxRxs7BtOD8qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dbb5ad0bb72e83a9a2cf3df36989560e4d76a68a88df024845e1d6a2de66f0f","last_reissued_at":"2026-07-05T09:27:32.415272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:32.415272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.21733","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-07-05T09:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1Mcd+uS/brof/mYfDOEAicbnIKZCzpS11MUvwr3zvseF7xaUReziogIClwPqoOIU7ToPEWfKpevbo+IOAm5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:32:03.529220Z"},"content_sha256":"169aaec13372c7f5468ca9414545941c378d6615de021bd4085a0e487fc29fd3","schema_version":"1.0","event_id":"sha256:169aaec13372c7f5468ca9414545941c378d6615de021bd4085a0e487fc29fd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TW5VVUF3OLUDVGRM6PPTNGEVMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Berge Pancyclic hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Teegan Bailey, Yupei Li","submitted_at":"2024-10-29T04:40:15Z","abstract_excerpt":"A Berge cycle of length $\\ell$ in a hypergraph is an alternating sequence of $\\ell$ distinct vertices and $\\ell$ distinct edges $v_1,e_1,v_2, \\ldots, v_\\ell, e_{\\ell}$ such that $\\{v_i, v_{i+1}\\} \\subseteq e_i$ for all $i$, with indices taken modulo $\\ell$. We call an $n$-vertex hypergraph pancyclic if it contains Berge cycles of every length from $3$ to $n$. We prove a sharp Dirac-type result guaranteeing pancyclicity in uniform hypergraphs: for $n \\geq 70$, $3 \\leq r \\leq \\lfloor (n-1)/2\\rfloor - 2$, if $\\cH$ is an $n$-vertex, $r$-uniform hypergraph with minimum degree at least ${\\lfloor (n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21733","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21733/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggzTJyKtil54hRdv2DF80pLzRT78KCgl+A9Zzx30nb726Dhw8Vu6HCa6eSufjb04tLxeavu5eX4VovrokSOUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:32:03.529963Z"},"content_sha256":"6687db8d9f398c8c24732992c94545f38940cf84036dda8059b7d8d06f228e90","schema_version":"1.0","event_id":"sha256:6687db8d9f398c8c24732992c94545f38940cf84036dda8059b7d8d06f228e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/bundle.json","state_url":"https://pith.science/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/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-08-16T02:32:03Z","links":{"resolver":"https://pith.science/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD","bundle":"https://pith.science/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/bundle.json","state":"https://pith.science/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TW5VVUF3OLUDVGRM6PPTNGEVMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TW5VVUF3OLUDVGRM6PPTNGEVMD","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":"2d2245c03912b04d8acb8d01a7f7f7213227a0b2d0bf91c8b0c9dedd370a2f05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:40:15Z","title_canon_sha256":"d400626af4bd0981d8a181eeac984aa634b379d75150d46c01f05c69f7c5a3ce"},"schema_version":"1.0","source":{"id":"2410.21733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21733","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21733v1","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21733","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"TW5VVUF3OLUD","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"TW5VVUF3OLUDVGRM","created_at":"2026-07-05T09:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"TW5VVUF3","created_at":"2026-07-05T09:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6687db8d9f398c8c24732992c94545f38940cf84036dda8059b7d8d06f228e90","target":"graph","created_at":"2026-07-05T09:27:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.21733/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Berge cycle of length $\\ell$ in a hypergraph is an alternating sequence of $\\ell$ distinct vertices and $\\ell$ distinct edges $v_1,e_1,v_2, \\ldots, v_\\ell, e_{\\ell}$ such that $\\{v_i, v_{i+1}\\} \\subseteq e_i$ for all $i$, with indices taken modulo $\\ell$. We call an $n$-vertex hypergraph pancyclic if it contains Berge cycles of every length from $3$ to $n$. We prove a sharp Dirac-type result guaranteeing pancyclicity in uniform hypergraphs: for $n \\geq 70$, $3 \\leq r \\leq \\lfloor (n-1)/2\\rfloor - 2$, if $\\cH$ is an $n$-vertex, $r$-uniform hypergraph with minimum degree at least ${\\lfloor (n-","authors_text":"Ruth Luo, Teegan Bailey, Yupei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:40:15Z","title":"Berge Pancyclic hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21733","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:169aaec13372c7f5468ca9414545941c378d6615de021bd4085a0e487fc29fd3","target":"record","created_at":"2026-07-05T09:27:32Z","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":"2d2245c03912b04d8acb8d01a7f7f7213227a0b2d0bf91c8b0c9dedd370a2f05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-29T04:40:15Z","title_canon_sha256":"d400626af4bd0981d8a181eeac984aa634b379d75150d46c01f05c69f7c5a3ce"},"schema_version":"1.0","source":{"id":"2410.21733","kind":"arxiv","version":1}},"canonical_sha256":"9dbb5ad0bb72e83a9a2cf3df36989560e4d76a68a88df024845e1d6a2de66f0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dbb5ad0bb72e83a9a2cf3df36989560e4d76a68a88df024845e1d6a2de66f0f","first_computed_at":"2026-07-05T09:27:32.415272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:27:32.415272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UK92BsHi5dygh6qHpMy9HHMyhLMnO7zFBlHAsybTpvUg/ZVZG9yjxFSr4lsDL0uTfWiM9hOTNxRxs7BtOD8qDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:27:32.415679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.21733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:169aaec13372c7f5468ca9414545941c378d6615de021bd4085a0e487fc29fd3","sha256:6687db8d9f398c8c24732992c94545f38940cf84036dda8059b7d8d06f228e90"],"state_sha256":"78989a3617a060c074076fddc5b8b6dac4a1837551d4578a813577028bc1fc26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCgEPbjKAhMbV2YDukIu08rprk8HIltG46bcOIPno1FgKUXmecqQtd411rexV6YzqeaAg6kPo22TQxp4v5XHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T02:32:03.535342Z","bundle_sha256":"a0b66eb28afb1d48656bdff45902f6881c775c91204c5f22d89dc620b4df570c"}}