{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CSHZQ4JPMV7POT2CSVS3QM6KDT","short_pith_number":"pith:CSHZQ4JP","canonical_record":{"source":{"id":"1807.10177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"37e01dd09c57ffc9428610256d528a84b060030ed26537f98e19e4c3e7ad27a0","abstract_canon_sha256":"573df67b4db16200f3c84e1a1f86e55e65435606faf9a8fb6a2536543c9ae991"},"schema_version":"1.0"},"canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","source":{"kind":"arxiv","id":"1807.10177","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10177","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10177v2","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10177","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"CSHZQ4JPMV7P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSHZQ4JPMV7POT2C","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSHZQ4JP","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CSHZQ4JPMV7POT2CSVS3QM6KDT","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"37e01dd09c57ffc9428610256d528a84b060030ed26537f98e19e4c3e7ad27a0","abstract_canon_sha256":"573df67b4db16200f3c84e1a1f86e55e65435606faf9a8fb6a2536543c9ae991"},"schema_version":"1.0"},"canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:41.455200Z","signature_b64":"BgGNGkgdY/iq+VeewzggRYwHLeka+l5eWuXFKg/Ng8J/IXofbh8bF1SR82o3Kf4Z1eSXxR4nmNXI/7IN0rweAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","last_reissued_at":"2026-05-17T23:52:41.454556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:41.454556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10177","source_version":2,"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-17T23:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIoYuZRBAWo7PVSO2vJblJDDmGsUxzm1SGafPpi8XStWHH4v7kKrCPQxQsOUBruLJ1ldYR3bggimOF0+75d3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:08.557587Z"},"content_sha256":"9e751bc780a3fc340ca8fbbb0c61b73b336ac1838e5229f87b6c3310d9fa4790","schema_version":"1.0","event_id":"sha256:9e751bc780a3fc340ca8fbbb0c61b73b336ac1838e5229f87b6c3310d9fa4790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CSHZQ4JPMV7POT2CSVS3QM6KDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraphs with few Berge paths of fixed length between vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Tait, Zhiyang He","submitted_at":"2018-07-26T14:54:46Z","abstract_excerpt":"In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle problem asking for $\\mathrm{ex}(n, C_{2k})$. We extend results of F\\\"uredi and Simonovits and of Conlon, who studied the problem when $r=2$. In particular, we show that for fixed $k$ and $r$, there is a constant $t$ such that the maximum number of edges can be determined in order of magnitude."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10177","kind":"arxiv","version":2},"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-17T23:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s/OPrKG+RIWT+B1/Z/kHLZMWGFTGTIL79I5tcDwB+vhM/fpao3pH9RR01oRwz4vrd3G8GinGac0pYgsLzkJ2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:08.557930Z"},"content_sha256":"e9acb7aba6f6ac4599f6bd582d3a90f404167cbadaf79d856e7734c3347d3f31","schema_version":"1.0","event_id":"sha256:e9acb7aba6f6ac4599f6bd582d3a90f404167cbadaf79d856e7734c3347d3f31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/bundle.json","state_url":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/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-04T02:44:08Z","links":{"resolver":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT","bundle":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/bundle.json","state":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CSHZQ4JPMV7POT2CSVS3QM6KDT","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":"573df67b4db16200f3c84e1a1f86e55e65435606faf9a8fb6a2536543c9ae991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","title_canon_sha256":"37e01dd09c57ffc9428610256d528a84b060030ed26537f98e19e4c3e7ad27a0"},"schema_version":"1.0","source":{"id":"1807.10177","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10177","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10177v2","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10177","created_at":"2026-05-17T23:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"CSHZQ4JPMV7P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSHZQ4JPMV7POT2C","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSHZQ4JP","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e9acb7aba6f6ac4599f6bd582d3a90f404167cbadaf79d856e7734c3347d3f31","target":"graph","created_at":"2026-05-17T23:52:41Z","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":"In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle problem asking for $\\mathrm{ex}(n, C_{2k})$. We extend results of F\\\"uredi and Simonovits and of Conlon, who studied the problem when $r=2$. In particular, we show that for fixed $k$ and $r$, there is a constant $t$ such that the maximum number of edges can be determined in order of magnitude.","authors_text":"Michael Tait, Zhiyang He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","title":"Hypergraphs with few Berge paths of fixed length between vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10177","kind":"arxiv","version":2},"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:9e751bc780a3fc340ca8fbbb0c61b73b336ac1838e5229f87b6c3310d9fa4790","target":"record","created_at":"2026-05-17T23:52:41Z","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":"573df67b4db16200f3c84e1a1f86e55e65435606faf9a8fb6a2536543c9ae991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","title_canon_sha256":"37e01dd09c57ffc9428610256d528a84b060030ed26537f98e19e4c3e7ad27a0"},"schema_version":"1.0","source":{"id":"1807.10177","kind":"arxiv","version":2}},"canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","first_computed_at":"2026-05-17T23:52:41.454556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:41.454556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BgGNGkgdY/iq+VeewzggRYwHLeka+l5eWuXFKg/Ng8J/IXofbh8bF1SR82o3Kf4Z1eSXxR4nmNXI/7IN0rweAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:41.455200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10177","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e751bc780a3fc340ca8fbbb0c61b73b336ac1838e5229f87b6c3310d9fa4790","sha256:e9acb7aba6f6ac4599f6bd582d3a90f404167cbadaf79d856e7734c3347d3f31"],"state_sha256":"b7484a6c6a3309ed286a3a90dd4e5e0318552d164f9126a9c29ca073c40f3d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Syl3ObZhEA91MbR9ZF5rkQN8gChL/ADVI3Kg2G0Pv4hfE/j7BhkcAdejcVwdzcCSRtBL5uh4ANIeE1ooW4gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:44:08.559794Z","bundle_sha256":"7b27f2955f9dc611d2ab1e59581566fecb1f4a25d9096d3e7eb717036e20a363"}}