{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ONYWP6X6JL5IXIKVNIFTRUEVPR","short_pith_number":"pith:ONYWP6X6","canonical_record":{"source":{"id":"2506.23794","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T12:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"1b5d90112a95fd654254f9cfc484184cf34710e2965bfe3feb5366709a34d8a2","abstract_canon_sha256":"829fb16e7dfbcfc7b9d2149717a33c49f4c19fa1da8084eb862a9a9b1600cd1e"},"schema_version":"1.0"},"canonical_sha256":"737167fafe4afa8ba1556a0b38d0957c74e01b470e759673a46fb211ccb264f4","source":{"kind":"arxiv","id":"2506.23794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23794","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23794v1","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23794","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"ONYWP6X6JL5I","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_16","alias_value":"ONYWP6X6JL5IXIKV","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_8","alias_value":"ONYWP6X6","created_at":"2026-07-05T11:29:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ONYWP6X6JL5IXIKVNIFTRUEVPR","target":"record","payload":{"canonical_record":{"source":{"id":"2506.23794","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T12:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"1b5d90112a95fd654254f9cfc484184cf34710e2965bfe3feb5366709a34d8a2","abstract_canon_sha256":"829fb16e7dfbcfc7b9d2149717a33c49f4c19fa1da8084eb862a9a9b1600cd1e"},"schema_version":"1.0"},"canonical_sha256":"737167fafe4afa8ba1556a0b38d0957c74e01b470e759673a46fb211ccb264f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:28.076210Z","signature_b64":"Df1ompSSIC/D9ah8iS3q96dQkkLQSfsIb54Z3SWyK/70/60RjiTGM5e+RJKZ4q9OljPZb9HHLbzibXB5m4+1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737167fafe4afa8ba1556a0b38d0957c74e01b470e759673a46fb211ccb264f4","last_reissued_at":"2026-07-05T11:29:28.075722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:28.075722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.23794","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-05T11:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZ5ZekNgqK78WytZBBzg6ufFyxjqW2zt4AYyVDPL0DAestDsL6ZEYefOvOTUMl3TZJ0jla7EnUICkh86M3aMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:37:16.906831Z"},"content_sha256":"b969baf17fff629a44f751b47fc6eed12df4d68a688f126e6813665e237c29a6","schema_version":"1.0","event_id":"sha256:b969baf17fff629a44f751b47fc6eed12df4d68a688f126e6813665e237c29a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ONYWP6X6JL5IXIKVNIFTRUEVPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sabotage the Mantel Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Debsoumya Chakraborti, Natalie Behague, Xizhi Liu","submitted_at":"2025-06-30T12:35:46Z","abstract_excerpt":"One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\\lfloor n^2/4 \\rfloor$. We investigate how this extremal bound is affected when $G$ is additionally required to contain a prescribed graph $\\mathbb{P}$ as a subgraph. We establish general upper and lower bounds for this problem, which are tight in the exponent for random triangle-free graphs and graphs generated by the triangle-free process, when the size of $\\mathbb{P}$ lies within certain ranges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23794","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/2506.23794/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-05T11:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCHM5urO2FO1yPQfu9wSzgn+L2VCYv2JzZLOKp/DwulUiOcChDuNFLX3X3bP5yPHPvTUp1O+riULaINTiqLkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:37:16.907631Z"},"content_sha256":"cafa806affea54bb843e984f97827287e18e16325cbba68a250cc19d59db6b54","schema_version":"1.0","event_id":"sha256:cafa806affea54bb843e984f97827287e18e16325cbba68a250cc19d59db6b54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/bundle.json","state_url":"https://pith.science/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/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-12T08:37:16Z","links":{"resolver":"https://pith.science/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR","bundle":"https://pith.science/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/bundle.json","state":"https://pith.science/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONYWP6X6JL5IXIKVNIFTRUEVPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ONYWP6X6JL5IXIKVNIFTRUEVPR","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":"829fb16e7dfbcfc7b9d2149717a33c49f4c19fa1da8084eb862a9a9b1600cd1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T12:35:46Z","title_canon_sha256":"1b5d90112a95fd654254f9cfc484184cf34710e2965bfe3feb5366709a34d8a2"},"schema_version":"1.0","source":{"id":"2506.23794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23794","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23794v1","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23794","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"ONYWP6X6JL5I","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_16","alias_value":"ONYWP6X6JL5IXIKV","created_at":"2026-07-05T11:29:28Z"},{"alias_kind":"pith_short_8","alias_value":"ONYWP6X6","created_at":"2026-07-05T11:29:28Z"}],"graph_snapshots":[{"event_id":"sha256:cafa806affea54bb843e984f97827287e18e16325cbba68a250cc19d59db6b54","target":"graph","created_at":"2026-07-05T11:29:28Z","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/2506.23794/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\\lfloor n^2/4 \\rfloor$. We investigate how this extremal bound is affected when $G$ is additionally required to contain a prescribed graph $\\mathbb{P}$ as a subgraph. We establish general upper and lower bounds for this problem, which are tight in the exponent for random triangle-free graphs and graphs generated by the triangle-free process, when the size of $\\mathbb{P}$ lies within certain ranges.","authors_text":"Debsoumya Chakraborti, Natalie Behague, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T12:35:46Z","title":"Sabotage the Mantel Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23794","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:b969baf17fff629a44f751b47fc6eed12df4d68a688f126e6813665e237c29a6","target":"record","created_at":"2026-07-05T11:29:28Z","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":"829fb16e7dfbcfc7b9d2149717a33c49f4c19fa1da8084eb862a9a9b1600cd1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T12:35:46Z","title_canon_sha256":"1b5d90112a95fd654254f9cfc484184cf34710e2965bfe3feb5366709a34d8a2"},"schema_version":"1.0","source":{"id":"2506.23794","kind":"arxiv","version":1}},"canonical_sha256":"737167fafe4afa8ba1556a0b38d0957c74e01b470e759673a46fb211ccb264f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737167fafe4afa8ba1556a0b38d0957c74e01b470e759673a46fb211ccb264f4","first_computed_at":"2026-07-05T11:29:28.075722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:29:28.075722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Df1ompSSIC/D9ah8iS3q96dQkkLQSfsIb54Z3SWyK/70/60RjiTGM5e+RJKZ4q9OljPZb9HHLbzibXB5m4+1CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:29:28.076210Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b969baf17fff629a44f751b47fc6eed12df4d68a688f126e6813665e237c29a6","sha256:cafa806affea54bb843e984f97827287e18e16325cbba68a250cc19d59db6b54"],"state_sha256":"a71547ccda9dacfa7d72f32184f47109b8d074f47e68e102afed60e58cbf29a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsSudHkExyxKzG+C+VhSZSL7f+lNgzmP4CFsFNiIx9fevi/8YXk3p4twwyntDfFwMcQmFOMJGcNGiXFo7TBfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T08:37:16.913320Z","bundle_sha256":"cea02a296a9c274de37688e70e79e8dcf3d3d5da225934f93e9ed0b7bb872738"}}