{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VRGMVVDM2VOW6HMGTXBODL5I4I","short_pith_number":"pith:VRGMVVDM","canonical_record":{"source":{"id":"2411.19173","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"ba775df8837be5b921f614600fdf5cd4f25037cd0ea38c4512f77e9697fdc74e","abstract_canon_sha256":"b17319aec3ab4c49c15a04842a4a51c091ff18e685dc9a59867dec3480f06c4c"},"schema_version":"1.0"},"canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","source":{"kind":"arxiv","id":"2411.19173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19173","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19173v2","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19173","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"VRGMVVDM2VOW","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"VRGMVVDM2VOW6HMG","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"VRGMVVDM","created_at":"2026-07-05T12:02:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VRGMVVDM2VOW6HMGTXBODL5I4I","target":"record","payload":{"canonical_record":{"source":{"id":"2411.19173","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"ba775df8837be5b921f614600fdf5cd4f25037cd0ea38c4512f77e9697fdc74e","abstract_canon_sha256":"b17319aec3ab4c49c15a04842a4a51c091ff18e685dc9a59867dec3480f06c4c"},"schema_version":"1.0"},"canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:38.090654Z","signature_b64":"oKlbwa/x4k2Gdmf+Im924CuXdKdp0gLMAw5wUzgq8GDCGk/FQl4ZKnlK+5q8NChvX9ZXFkPfUkvdSAsoX7VwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","last_reissued_at":"2026-07-05T12:02:38.090135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:38.090135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.19173","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-05T12:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Y7Oosoue8k9/mNSABVCYQ1CcsNg6NfinZi73WxGrq2JDt3v87m2wBy4zqHfguOswnlJjvBYNpj3zYVK7WFvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:45:38.425541Z"},"content_sha256":"bcd71a3549528e9d1de54c520b886dad3e58f7a478ac11813b9bc34598f56089","schema_version":"1.0","event_id":"sha256:bcd71a3549528e9d1de54c520b886dad3e58f7a478ac11813b9bc34598f56089"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VRGMVVDM2VOW6HMGTXBODL5I4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long induced paths in $K_{s, s}$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","submitted_at":"2024-11-28T14:24:13Z","abstract_excerpt":"More than 40 years ago, Galvin, Rival and Sands showed that every $K_{s, s}$-free graph containing an $n$-vertex path must contain an induced path of length $f(n)$, where $f(n)\\to \\infty$ as $n\\to \\infty$. Recently, it was shown by Duron, Esperet and Raymond that one can take $f(n)=(\\log \\log n)^{1/5-o(1)}$. In this note, we give a short self-contained proof that a $K_{s, s}$-free graphs with an $n$-vertex path contains an induced path of length at least $(\\log \\log n)^{1-o(1)}$. Combined with the recent remarkable example of Cou\\\"etoux, Defrain, and Raymond, which provides an upper bound of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19173","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/2411.19173/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-05T12:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDrFGWgqGsFaJ7t1/J/V8RudRATk3Y/ulD49aET/eTIHPxZSC7MeugoQ8cMyumWYyzF36A+Tqn+3OdDaLqlIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:45:38.425879Z"},"content_sha256":"455caec294c8bca3e3dc550a597e0debbc4d78126ca6c7f1a635746c40badea4","schema_version":"1.0","event_id":"sha256:455caec294c8bca3e3dc550a597e0debbc4d78126ca6c7f1a635746c40badea4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/bundle.json","state_url":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/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-11T10:45:38Z","links":{"resolver":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I","bundle":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/bundle.json","state":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VRGMVVDM2VOW6HMGTXBODL5I4I","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":"b17319aec3ab4c49c15a04842a4a51c091ff18e685dc9a59867dec3480f06c4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","title_canon_sha256":"ba775df8837be5b921f614600fdf5cd4f25037cd0ea38c4512f77e9697fdc74e"},"schema_version":"1.0","source":{"id":"2411.19173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19173","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19173v2","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19173","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"VRGMVVDM2VOW","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"VRGMVVDM2VOW6HMG","created_at":"2026-07-05T12:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"VRGMVVDM","created_at":"2026-07-05T12:02:38Z"}],"graph_snapshots":[{"event_id":"sha256:455caec294c8bca3e3dc550a597e0debbc4d78126ca6c7f1a635746c40badea4","target":"graph","created_at":"2026-07-05T12:02:38Z","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/2411.19173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"More than 40 years ago, Galvin, Rival and Sands showed that every $K_{s, s}$-free graph containing an $n$-vertex path must contain an induced path of length $f(n)$, where $f(n)\\to \\infty$ as $n\\to \\infty$. Recently, it was shown by Duron, Esperet and Raymond that one can take $f(n)=(\\log \\log n)^{1/5-o(1)}$. In this note, we give a short self-contained proof that a $K_{s, s}$-free graphs with an $n$-vertex path contains an induced path of length at least $(\\log \\log n)^{1-o(1)}$. Combined with the recent remarkable example of Cou\\\"etoux, Defrain, and Raymond, which provides an upper bound of $","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","title":"Long induced paths in $K_{s, s}$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19173","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:bcd71a3549528e9d1de54c520b886dad3e58f7a478ac11813b9bc34598f56089","target":"record","created_at":"2026-07-05T12:02:38Z","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":"b17319aec3ab4c49c15a04842a4a51c091ff18e685dc9a59867dec3480f06c4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","title_canon_sha256":"ba775df8837be5b921f614600fdf5cd4f25037cd0ea38c4512f77e9697fdc74e"},"schema_version":"1.0","source":{"id":"2411.19173","kind":"arxiv","version":2}},"canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","first_computed_at":"2026-07-05T12:02:38.090135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:38.090135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKlbwa/x4k2Gdmf+Im924CuXdKdp0gLMAw5wUzgq8GDCGk/FQl4ZKnlK+5q8NChvX9ZXFkPfUkvdSAsoX7VwDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:38.090654Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcd71a3549528e9d1de54c520b886dad3e58f7a478ac11813b9bc34598f56089","sha256:455caec294c8bca3e3dc550a597e0debbc4d78126ca6c7f1a635746c40badea4"],"state_sha256":"006bbfecfc58266d004e3c4f591ab75a0ec33aedacd1be979c5f1c814f1334f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mN+5uXCGLdPC1LVLsXywlJbO+dWQoH4xVk9GXAKQ6iOIWlb+GdyrCcXLS/dW3wAYAFdgtrpZYOtk1NchdqZgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:45:38.428356Z","bundle_sha256":"e1ec50d141be3e9edc9626e013e3d441ab9fae16a5bbc3d9a81bba18e0b351f4"}}