{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2GRO6SKHR35DKBICOKAAC7VUWP","short_pith_number":"pith:2GRO6SKH","canonical_record":{"source":{"id":"1705.03561","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T22:45:59Z","cross_cats_sorted":[],"title_canon_sha256":"27dfbdb962a59f473bd55b3525fb0ed4c188be2031faece4bd212bd93077f5c0","abstract_canon_sha256":"a1b7282c4727a712017bf0ad761e7234520540894d95ca4772323d73292ddab8"},"schema_version":"1.0"},"canonical_sha256":"d1a2ef49478efa3505027280017eb4b3d5f2d46d15854c44478b092a40005eaa","source":{"kind":"arxiv","id":"1705.03561","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03561","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03561v3","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03561","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"2GRO6SKHR35D","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GRO6SKHR35DKBIC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GRO6SKH","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2GRO6SKHR35DKBICOKAAC7VUWP","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03561","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T22:45:59Z","cross_cats_sorted":[],"title_canon_sha256":"27dfbdb962a59f473bd55b3525fb0ed4c188be2031faece4bd212bd93077f5c0","abstract_canon_sha256":"a1b7282c4727a712017bf0ad761e7234520540894d95ca4772323d73292ddab8"},"schema_version":"1.0"},"canonical_sha256":"d1a2ef49478efa3505027280017eb4b3d5f2d46d15854c44478b092a40005eaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.725964Z","signature_b64":"JdFR8va0whJQA07XnR7cQt9JunmCa0CwY3zVW6whi9t45yUphzYu9YM+5NAqUY+2XytkebOhpwtp9+EffB9wAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1a2ef49478efa3505027280017eb4b3d5f2d46d15854c44478b092a40005eaa","last_reissued_at":"2026-05-18T00:05:05.725329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.725329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03561","source_version":3,"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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBtlU0QbbH/zgNk9hZXhaIB33YTxfvQcT9W/Q2WNgXbVJuPxXobQkdGmcpb9nMwkTEUG8qxH1rQ2P6/srQbECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:04:28.316141Z"},"content_sha256":"34e46484b1d0cf16a53cfd5156e32f613484bcf2682566998dacfbaa784f33d1","schema_version":"1.0","event_id":"sha256:34e46484b1d0cf16a53cfd5156e32f613484bcf2682566998dacfbaa784f33d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2GRO6SKHR35DKBICOKAAC7VUWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotics for Tur\\'an numbers of cycles in 3-uniform linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2017-05-09T22:45:59Z","abstract_excerpt":"Let $\\mathcal{F}$ be a family of $3$-uniform linear hypergraphs. The linear Tur\\'an number of $\\mathcal F$ is the maximum possible number of edges in a $3$-uniform linear hypergraph on $n$ vertices which contains no member of $\\mathcal{F}$ as a subhypergraph.\n  In this paper we show that the linear Tur\\'an number of the five cycle $C_5$ (in the Berge sense) is $\\frac{1}{3 \\sqrt3}n^{3/2}$ asymptotically. We also show that the linear Tur\\'an number of the four cycle $C_4$ and $\\{C_3, C_4\\}$ are equal asmptotically, which is a strengthening of a theorem of Lazebnik and Verstra\\\"ete.\n  We establis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03561","kind":"arxiv","version":3},"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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9OiAptAjUyFL3txpHNrCnT0kVXu7QH/GNTV6jLtSkgszqnlG0bxGVTstiADbT5HnApbfsuEJt1KMOojP92WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:04:28.316516Z"},"content_sha256":"21707dfa42adb555931f4af7ca7242bd9ae0205fb2b5c7dd29bed604cdead62b","schema_version":"1.0","event_id":"sha256:21707dfa42adb555931f4af7ca7242bd9ae0205fb2b5c7dd29bed604cdead62b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GRO6SKHR35DKBICOKAAC7VUWP/bundle.json","state_url":"https://pith.science/pith/2GRO6SKHR35DKBICOKAAC7VUWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GRO6SKHR35DKBICOKAAC7VUWP/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-26T20:04:28Z","links":{"resolver":"https://pith.science/pith/2GRO6SKHR35DKBICOKAAC7VUWP","bundle":"https://pith.science/pith/2GRO6SKHR35DKBICOKAAC7VUWP/bundle.json","state":"https://pith.science/pith/2GRO6SKHR35DKBICOKAAC7VUWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GRO6SKHR35DKBICOKAAC7VUWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2GRO6SKHR35DKBICOKAAC7VUWP","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":"a1b7282c4727a712017bf0ad761e7234520540894d95ca4772323d73292ddab8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T22:45:59Z","title_canon_sha256":"27dfbdb962a59f473bd55b3525fb0ed4c188be2031faece4bd212bd93077f5c0"},"schema_version":"1.0","source":{"id":"1705.03561","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03561","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03561v3","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03561","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"2GRO6SKHR35D","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GRO6SKHR35DKBIC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GRO6SKH","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:21707dfa42adb555931f4af7ca7242bd9ae0205fb2b5c7dd29bed604cdead62b","target":"graph","created_at":"2026-05-18T00:05:05Z","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":"Let $\\mathcal{F}$ be a family of $3$-uniform linear hypergraphs. The linear Tur\\'an number of $\\mathcal F$ is the maximum possible number of edges in a $3$-uniform linear hypergraph on $n$ vertices which contains no member of $\\mathcal{F}$ as a subhypergraph.\n  In this paper we show that the linear Tur\\'an number of the five cycle $C_5$ (in the Berge sense) is $\\frac{1}{3 \\sqrt3}n^{3/2}$ asymptotically. We also show that the linear Tur\\'an number of the four cycle $C_4$ and $\\{C_3, C_4\\}$ are equal asmptotically, which is a strengthening of a theorem of Lazebnik and Verstra\\\"ete.\n  We establis","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T22:45:59Z","title":"Asymptotics for Tur\\'an numbers of cycles in 3-uniform linear hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03561","kind":"arxiv","version":3},"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:34e46484b1d0cf16a53cfd5156e32f613484bcf2682566998dacfbaa784f33d1","target":"record","created_at":"2026-05-18T00:05:05Z","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":"a1b7282c4727a712017bf0ad761e7234520540894d95ca4772323d73292ddab8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T22:45:59Z","title_canon_sha256":"27dfbdb962a59f473bd55b3525fb0ed4c188be2031faece4bd212bd93077f5c0"},"schema_version":"1.0","source":{"id":"1705.03561","kind":"arxiv","version":3}},"canonical_sha256":"d1a2ef49478efa3505027280017eb4b3d5f2d46d15854c44478b092a40005eaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1a2ef49478efa3505027280017eb4b3d5f2d46d15854c44478b092a40005eaa","first_computed_at":"2026-05-18T00:05:05.725329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:05.725329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JdFR8va0whJQA07XnR7cQt9JunmCa0CwY3zVW6whi9t45yUphzYu9YM+5NAqUY+2XytkebOhpwtp9+EffB9wAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:05.725964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03561","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e46484b1d0cf16a53cfd5156e32f613484bcf2682566998dacfbaa784f33d1","sha256:21707dfa42adb555931f4af7ca7242bd9ae0205fb2b5c7dd29bed604cdead62b"],"state_sha256":"9d301984e9c98da0e3da68377fde9e6544f363a9a985ef9d874058c05fe66a79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLbYRQOzp181E6Qsdzvx3OUk3hcn5hLEsVgwDzgGPpMDcCFoCNt/FJN/6zWCw7EbeycKm/nnDAPbanUw43yDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:04:28.318705Z","bundle_sha256":"3a1b7eafd6047b68f73466d29c93e777faf6e1c122c59c45cc47c17557a8dcfe"}}