{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ES4K2SHWQB2TUFUIROJDRUUY4Z","short_pith_number":"pith:ES4K2SHW","canonical_record":{"source":{"id":"2501.15861","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T08:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"46238ff4dcc4ae6dcb5e780bea645db6e631d8ab8da3f6a48e9807b7464a488b","abstract_canon_sha256":"828a32d0a4d6f6aa90ed39f0baf7d0d581d03eae28665871078c36b3a1887601"},"schema_version":"1.0"},"canonical_sha256":"24b8ad48f680753a16888b9238d298e66840d8bc6f1e541d32d7159d79f3afba","source":{"kind":"arxiv","id":"2501.15861","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15861","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15861v2","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15861","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"ES4K2SHWQB2T","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"ES4K2SHWQB2TUFUI","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"ES4K2SHW","created_at":"2026-07-05T10:14:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ES4K2SHWQB2TUFUIROJDRUUY4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2501.15861","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T08:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"46238ff4dcc4ae6dcb5e780bea645db6e631d8ab8da3f6a48e9807b7464a488b","abstract_canon_sha256":"828a32d0a4d6f6aa90ed39f0baf7d0d581d03eae28665871078c36b3a1887601"},"schema_version":"1.0"},"canonical_sha256":"24b8ad48f680753a16888b9238d298e66840d8bc6f1e541d32d7159d79f3afba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:50.049032Z","signature_b64":"5WWZyPjeTmweN8auZAwYmZVERMsgzzoxmZdrJlZJ4U04WJ0Jxf2uKQhObAYOAO+BGAeQb5CdtTy6nCvlv2sXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24b8ad48f680753a16888b9238d298e66840d8bc6f1e541d32d7159d79f3afba","last_reissued_at":"2026-07-05T10:14:50.048505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:50.048505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.15861","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-07-05T10:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/Rrtur32FDX+EdJc2tUlkeNur8zn0Z19tDwilHll+hrU95MNZyIz2Wa+3351xoAla5n2wo/FP0zbkOEz1TfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T16:19:48.448866Z"},"content_sha256":"de60af81312ebfa770d90ef5bddb105b1672c530f19ebf8a3d5a222cadbe5155","schema_version":"1.0","event_id":"sha256:de60af81312ebfa770d90ef5bddb105b1672c530f19ebf8a3d5a222cadbe5155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ES4K2SHWQB2TUFUIROJDRUUY4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many pentagons in triple systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Jozsef Solymosi","submitted_at":"2025-01-27T08:40:53Z","abstract_excerpt":"We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$\n  copies of a pentagon, provided $m>100 \\, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan.\n  More generally, for each $ \\ell \\ge 2$, we prove that there is a constant $c$ such that if an $n$-vertex graph is $\\varepsilon$-far from being triangle-free, with $\\varepsilon \\gg n^{-1/3\\ell}$, then it has at least $c \\, \\varepsilon^{3\\ell} n^{2\\ell+1}$ copies of $C_{2\\ell+1}$. This improves the previous best bound of $c \\, \\varepsilon^{4\\ell+2} n^{2\\ell+1}$ due to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15861","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.15861/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-05T10:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10RIUOIMCfg0GlWZJVAbgIDpg3SOBagJXyme3bJjVIty0ZTiVUw+9Jub5TUPSeu22nwYzSpAj5hnrYdm020nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T16:19:48.449242Z"},"content_sha256":"3550eef7c4e596f16148c7e5a4cac49c0a4dbec92234e8815e6d35fed4420866","schema_version":"1.0","event_id":"sha256:3550eef7c4e596f16148c7e5a4cac49c0a4dbec92234e8815e6d35fed4420866"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/bundle.json","state_url":"https://pith.science/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/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-07-19T16:19:48Z","links":{"resolver":"https://pith.science/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z","bundle":"https://pith.science/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/bundle.json","state":"https://pith.science/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ES4K2SHWQB2TUFUIROJDRUUY4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ES4K2SHWQB2TUFUIROJDRUUY4Z","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":"828a32d0a4d6f6aa90ed39f0baf7d0d581d03eae28665871078c36b3a1887601","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T08:40:53Z","title_canon_sha256":"46238ff4dcc4ae6dcb5e780bea645db6e631d8ab8da3f6a48e9807b7464a488b"},"schema_version":"1.0","source":{"id":"2501.15861","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15861","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15861v2","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15861","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"ES4K2SHWQB2T","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"ES4K2SHWQB2TUFUI","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"ES4K2SHW","created_at":"2026-07-05T10:14:50Z"}],"graph_snapshots":[{"event_id":"sha256:3550eef7c4e596f16148c7e5a4cac49c0a4dbec92234e8815e6d35fed4420866","target":"graph","created_at":"2026-07-05T10:14:50Z","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/2501.15861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$\n  copies of a pentagon, provided $m>100 \\, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan.\n  More generally, for each $ \\ell \\ge 2$, we prove that there is a constant $c$ such that if an $n$-vertex graph is $\\varepsilon$-far from being triangle-free, with $\\varepsilon \\gg n^{-1/3\\ell}$, then it has at least $c \\, \\varepsilon^{3\\ell} n^{2\\ell+1}$ copies of $C_{2\\ell+1}$. This improves the previous best bound of $c \\, \\varepsilon^{4\\ell+2} n^{2\\ell+1}$ due to ","authors_text":"Dhruv Mubayi, Jozsef Solymosi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T08:40:53Z","title":"Many pentagons in triple systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15861","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:de60af81312ebfa770d90ef5bddb105b1672c530f19ebf8a3d5a222cadbe5155","target":"record","created_at":"2026-07-05T10:14:50Z","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":"828a32d0a4d6f6aa90ed39f0baf7d0d581d03eae28665871078c36b3a1887601","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T08:40:53Z","title_canon_sha256":"46238ff4dcc4ae6dcb5e780bea645db6e631d8ab8da3f6a48e9807b7464a488b"},"schema_version":"1.0","source":{"id":"2501.15861","kind":"arxiv","version":2}},"canonical_sha256":"24b8ad48f680753a16888b9238d298e66840d8bc6f1e541d32d7159d79f3afba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24b8ad48f680753a16888b9238d298e66840d8bc6f1e541d32d7159d79f3afba","first_computed_at":"2026-07-05T10:14:50.048505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:50.048505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5WWZyPjeTmweN8auZAwYmZVERMsgzzoxmZdrJlZJ4U04WJ0Jxf2uKQhObAYOAO+BGAeQb5CdtTy6nCvlv2sXCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:50.049032Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.15861","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de60af81312ebfa770d90ef5bddb105b1672c530f19ebf8a3d5a222cadbe5155","sha256:3550eef7c4e596f16148c7e5a4cac49c0a4dbec92234e8815e6d35fed4420866"],"state_sha256":"af082fd8bbe7315301e1c5a84261b2fb7719d0c6c13baede04b81c05fcf6e652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtcOix4uJ8cV6ucASR3sdC229PJrpDutzaFaGq+eWDSSHxT1Ywz3maVpD7qyknzRHM/aN+xn3jorOXlJMuOGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T16:19:48.452139Z","bundle_sha256":"2fd034cd92858cd9973b020a48fcae95f648ef5476d9ae583897d7e6ab5fab8c"}}