{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NQIPSHXA7CGGCXQKCE63XOLNPG","short_pith_number":"pith:NQIPSHXA","canonical_record":{"source":{"id":"2506.23942","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ad6f1412e102fc414b2aa8fffb16502a7466a9a7548eaad1985e28abc4aae45","abstract_canon_sha256":"d9222fa54f025167b5c9249efe1c268cf9a9e87d4471da1b63285ed19a4c331a"},"schema_version":"1.0"},"canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","source":{"kind":"arxiv","id":"2506.23942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23942","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23942v1","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23942","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"NQIPSHXA7CGG","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_16","alias_value":"NQIPSHXA7CGGCXQK","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_8","alias_value":"NQIPSHXA","created_at":"2026-07-05T11:29:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NQIPSHXA7CGGCXQKCE63XOLNPG","target":"record","payload":{"canonical_record":{"source":{"id":"2506.23942","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ad6f1412e102fc414b2aa8fffb16502a7466a9a7548eaad1985e28abc4aae45","abstract_canon_sha256":"d9222fa54f025167b5c9249efe1c268cf9a9e87d4471da1b63285ed19a4c331a"},"schema_version":"1.0"},"canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:30.500381Z","signature_b64":"sQu/xFm/4BNHNjnw3VxZi1ggoxCnM4whhmVCkrMagEJ5Mk6AW6LW2R/jrXQz4r74PWigjzddxg1wNmlksFC5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","last_reissued_at":"2026-07-05T11:29:30.499857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:30.499857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.23942","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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nEu+8UaRATY15oS3FsA/slnBuw5i7XKAYQpPuR8aE1rYBqriIQ3y9ACX9+MSix2hc7CJ02X4q8WLS+8j7+IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:15:02.171460Z"},"content_sha256":"ed8a5da5a4e027ab62cb4814ac92d240b829bdf913c132743d2ccedd60a51d34","schema_version":"1.0","event_id":"sha256:ed8a5da5a4e027ab62cb4814ac92d240b829bdf913c132743d2ccedd60a51d34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NQIPSHXA7CGGCXQKCE63XOLNPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$C_4$-free subgraphs of high degree with geometric applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istvan Tomon, Zach Hunter","submitted_at":"2025-06-30T15:09:00Z","abstract_excerpt":"The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$-vertex graph that does not contain the complete bipartite graph $K_{s,s}$. While the problem remains widely open in the case of general graphs, the past two decades have seen significant progress on this problem for various restricted graph classes -- particularly those arising from geometric settings -- leading to a deeper understanding of their structure.\n  In this paper, we develop a new structural tool for addressing Zarankiewicz-type problems. More specifically, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23942","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.23942/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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDHgG5pDd+TJ25PWt00fI57S2gmHZEENXaY/nfXQuasvktGgzMC9RPPNLQgJrngHDiw2KHxH4y+owA4r0TjrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:15:02.172387Z"},"content_sha256":"fdef4eeeba6d9558a1b1e26d40b3eac7e624371c496fdbf843a58fae6b483100","schema_version":"1.0","event_id":"sha256:fdef4eeeba6d9558a1b1e26d40b3eac7e624371c496fdbf843a58fae6b483100"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/bundle.json","state_url":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/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-08T13:15:02Z","links":{"resolver":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG","bundle":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/bundle.json","state":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NQIPSHXA7CGGCXQKCE63XOLNPG","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":"d9222fa54f025167b5c9249efe1c268cf9a9e87d4471da1b63285ed19a4c331a","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","title_canon_sha256":"2ad6f1412e102fc414b2aa8fffb16502a7466a9a7548eaad1985e28abc4aae45"},"schema_version":"1.0","source":{"id":"2506.23942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23942","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23942v1","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23942","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"NQIPSHXA7CGG","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_16","alias_value":"NQIPSHXA7CGGCXQK","created_at":"2026-07-05T11:29:30Z"},{"alias_kind":"pith_short_8","alias_value":"NQIPSHXA","created_at":"2026-07-05T11:29:30Z"}],"graph_snapshots":[{"event_id":"sha256:fdef4eeeba6d9558a1b1e26d40b3eac7e624371c496fdbf843a58fae6b483100","target":"graph","created_at":"2026-07-05T11:29:30Z","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.23942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$-vertex graph that does not contain the complete bipartite graph $K_{s,s}$. While the problem remains widely open in the case of general graphs, the past two decades have seen significant progress on this problem for various restricted graph classes -- particularly those arising from geometric settings -- leading to a deeper understanding of their structure.\n  In this paper, we develop a new structural tool for addressing Zarankiewicz-type problems. More specifically, we show","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istvan Tomon, Zach Hunter","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","title":"$C_4$-free subgraphs of high degree with geometric applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23942","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:ed8a5da5a4e027ab62cb4814ac92d240b829bdf913c132743d2ccedd60a51d34","target":"record","created_at":"2026-07-05T11:29:30Z","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":"d9222fa54f025167b5c9249efe1c268cf9a9e87d4471da1b63285ed19a4c331a","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","title_canon_sha256":"2ad6f1412e102fc414b2aa8fffb16502a7466a9a7548eaad1985e28abc4aae45"},"schema_version":"1.0","source":{"id":"2506.23942","kind":"arxiv","version":1}},"canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","first_computed_at":"2026-07-05T11:29:30.499857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:29:30.499857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQu/xFm/4BNHNjnw3VxZi1ggoxCnM4whhmVCkrMagEJ5Mk6AW6LW2R/jrXQz4r74PWigjzddxg1wNmlksFC5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:29:30.500381Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed8a5da5a4e027ab62cb4814ac92d240b829bdf913c132743d2ccedd60a51d34","sha256:fdef4eeeba6d9558a1b1e26d40b3eac7e624371c496fdbf843a58fae6b483100"],"state_sha256":"7e1790b6c91387f37707aa42a605ae75d46b754d1718153b4728403193473f61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQhhrt03qMj2M+r00UGw77MUtlh5DVblqbullHT0Jm5RnPG+I8lPL0h3hLIk/UfevPd+lc4c+DeWYYf7yuZ6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:15:02.177740Z","bundle_sha256":"701a11f69af61b81805bc1b4b4b0d826bb3e9a3471e55d4dd66aa5a468b1aaae"}}