{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","short_pith_number":"pith:4JH5LHF6","canonical_record":{"source":{"id":"2607.13995","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"641ca774b27f4d86b62a05aee7077a2da39a41c6c1dea597fbace3fcfd381e3c","abstract_canon_sha256":"b7b7c796fdf7f8f31a94bad93a5416baec6af9b9543f3ce06d3d5117c5a380df"},"schema_version":"1.0"},"canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","source":{"kind":"arxiv","id":"2607.13995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13995","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13995v1","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13995","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"4JH5LHF6QLSV","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"4JH5LHF6QLSVFQAO","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"4JH5LHF6","created_at":"2026-07-16T01:23:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13995","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"641ca774b27f4d86b62a05aee7077a2da39a41c6c1dea597fbace3fcfd381e3c","abstract_canon_sha256":"b7b7c796fdf7f8f31a94bad93a5416baec6af9b9543f3ce06d3d5117c5a380df"},"schema_version":"1.0"},"canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:23:18.529058Z","signature_b64":"yBkRB4chpPfZVTMM93S9gyQi1GHpsoGDwRdsfStpv4emaAfcxXX6hmwX6k2mNdrISWznW1bQ5Ro/eqOhNSEbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","last_reissued_at":"2026-07-16T01:23:18.528219Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:23:18.528219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13995","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-16T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97h4pBSVsn6vVCJgyNjddR1g/MzOOhkL6VrvLJxeA6Ws/QoW97d4aytmmga9eMcHKvGVKBTuji47O3GLXTYcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:14:37.598121Z"},"content_sha256":"290136361804105287066027304c677627a5e37c4c831ab573d6bd41c6e9d189","schema_version":"1.0","event_id":"sha256:290136361804105287066027304c677627a5e37c4c831ab573d6bd41c6e9d189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluding paths and bicliques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Julien Codsi, Maria Chudnovsky, Martin Milani\\v{c}, Matja\\v{z} Krnc","submitted_at":"2026-07-15T16:25:33Z","abstract_excerpt":"Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type result due to Galvin, Rival, and Sands (1982), establishing the existence of a function $f$ bounding the maximum length of a path in terms of clique number $\\omega$. We improve the best known bound on $f$ to a function that is a singly exponential in $\\omega^c$, for some constant $c$, which we show is best possible, up to optimizing $c$.\n  Our approach also has consequences for treedepth. In particular, we show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13995","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/2607.13995/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-16T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0exEGykyzfUh1T/AuqcrVxejRCDYSBSD+vJd5UCOmboXDBqr2cnN+87U4F3+FhegNoCJe5ihEcGY8H7HfZUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:14:37.600193Z"},"content_sha256":"c80f27d067a2c05835a673001b989a7f1fafcbcc03a914e9d628e8c7e15e5fa3","schema_version":"1.0","event_id":"sha256:c80f27d067a2c05835a673001b989a7f1fafcbcc03a914e9d628e8c7e15e5fa3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","target":"integrity","payload":{"note":"Identifier '10.1016/0095-8956(83' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Neil Robertson and P. D. Seymour. Graph minors. I. Excluding a forest.J. Combin. Theory Ser. B, 35(1):39–61, 1983.doi:10.1016/0095-8956(83) 90079-5","arxiv_id":"2607.13995","detector":"doi_compliance","evidence":{"doi":"10.1016/0095-8956(83","arxiv_id":null,"ref_index":29,"raw_excerpt":"Neil Robertson and P. D. Seymour. Graph minors. I. Excluding a forest.J. Combin. Theory Ser. B, 35(1):39–61, 1983.doi:10.1016/0095-8956(83) 90079-5","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":29,"audited_at":"2026-08-02T03:19:49.215053Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0095-8956(83","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"f520b0bcc37fe9060b0d5b7f260bee9ddd4073f37a80465d4bc18bded2fe8653","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17129,"payload_sha256":"eb7993d7b706caac8fb707375a84d24b54baeb42467a959afcb87c77ee9c1084","signature_b64":"Y4A44QYDDkbFAssiUmZi+ukCVBxGkf75NThfpHb6AQrE1++1c5dMNe4IAM0an6kE9tH30/sQQmFuh5Fn0AHMDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-02T03:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MA2mk7AkjvU+P3Fhs2goG9ycf2S5YEn/OQaLUdUWlHebpVFvh3uLpNba+mYSpU0BPj4Agd6YiimGRFPPKyWFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:14:37.605344Z"},"content_sha256":"eaa28c9342178544ea1425eae2604c035f788ba3bf00f63017911c18ed563612","schema_version":"1.0","event_id":"sha256:eaa28c9342178544ea1425eae2604c035f788ba3bf00f63017911c18ed563612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/bundle.json","state_url":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/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-06T02:14:37Z","links":{"resolver":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF","bundle":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/bundle.json","state":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b7b7c796fdf7f8f31a94bad93a5416baec6af9b9543f3ce06d3d5117c5a380df","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","title_canon_sha256":"641ca774b27f4d86b62a05aee7077a2da39a41c6c1dea597fbace3fcfd381e3c"},"schema_version":"1.0","source":{"id":"2607.13995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13995","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13995v1","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13995","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"4JH5LHF6QLSV","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"4JH5LHF6QLSVFQAO","created_at":"2026-07-16T01:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"4JH5LHF6","created_at":"2026-07-16T01:23:18Z"}],"graph_snapshots":[{"event_id":"sha256:c80f27d067a2c05835a673001b989a7f1fafcbcc03a914e9d628e8c7e15e5fa3","target":"graph","created_at":"2026-07-16T01:23:18Z","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/2607.13995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type result due to Galvin, Rival, and Sands (1982), establishing the existence of a function $f$ bounding the maximum length of a path in terms of clique number $\\omega$. We improve the best known bound on $f$ to a function that is a singly exponential in $\\omega^c$, for some constant $c$, which we show is best possible, up to optimizing $c$.\n  Our approach also has consequences for treedepth. In particular, we show that","authors_text":"Julien Codsi, Maria Chudnovsky, Martin Milani\\v{c}, Matja\\v{z} Krnc","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13995","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:290136361804105287066027304c677627a5e37c4c831ab573d6bd41c6e9d189","target":"record","created_at":"2026-07-16T01:23:18Z","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":"b7b7c796fdf7f8f31a94bad93a5416baec6af9b9543f3ce06d3d5117c5a380df","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","title_canon_sha256":"641ca774b27f4d86b62a05aee7077a2da39a41c6c1dea597fbace3fcfd381e3c"},"schema_version":"1.0","source":{"id":"2607.13995","kind":"arxiv","version":1}},"canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","first_computed_at":"2026-07-16T01:23:18.528219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T01:23:18.528219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBkRB4chpPfZVTMM93S9gyQi1GHpsoGDwRdsfStpv4emaAfcxXX6hmwX6k2mNdrISWznW1bQ5Ro/eqOhNSEbAQ==","signature_status":"signed_v1","signed_at":"2026-07-16T01:23:18.529058Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:290136361804105287066027304c677627a5e37c4c831ab573d6bd41c6e9d189","sha256:c80f27d067a2c05835a673001b989a7f1fafcbcc03a914e9d628e8c7e15e5fa3","sha256:eaa28c9342178544ea1425eae2604c035f788ba3bf00f63017911c18ed563612"],"state_sha256":"75a771f0f2b4e229666c29e24119f955c79fe6ec66136408f47de9afe1d898b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMJr2/h7kkLCPeeRwicufBySmJgGV+S/ZViaa8O4Dypntby6yeBBtOzwYWyyOYszskMP92aBobR4jeEd/JOpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:14:37.613503Z","bundle_sha256":"87bc87744102e777e452ecf5f77b36e8a1df34864d1d5174a905880184567115"}}