{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:K6BAIFWUP6U76NQ7WCF4MWRPXL","short_pith_number":"pith:K6BAIFWU","canonical_record":{"source":{"id":"2607.00732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"9489672a0c5da4030a333b63f1f36599e1235b60d72f3399e010190be119376b","abstract_canon_sha256":"e96f2247b3611a943dd1212db886cb270acd7ac0715b67622f6ad54bc6bf9801"},"schema_version":"1.0"},"canonical_sha256":"57820416d47fa9ff361fb08bc65a2fbad2bec108a32d85ebf2d8aa7406f5b97c","source":{"kind":"arxiv","id":"2607.00732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00732","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00732v1","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00732","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"K6BAIFWUP6U7","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_16","alias_value":"K6BAIFWUP6U76NQ7","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_8","alias_value":"K6BAIFWU","created_at":"2026-07-02T01:17:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:K6BAIFWUP6U76NQ7WCF4MWRPXL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"9489672a0c5da4030a333b63f1f36599e1235b60d72f3399e010190be119376b","abstract_canon_sha256":"e96f2247b3611a943dd1212db886cb270acd7ac0715b67622f6ad54bc6bf9801"},"schema_version":"1.0"},"canonical_sha256":"57820416d47fa9ff361fb08bc65a2fbad2bec108a32d85ebf2d8aa7406f5b97c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:52.870484Z","signature_b64":"ewBm9tq9bo2XMLx/PsAbBcy9FCdNOsabY/Y/EuxQPLBmxQh0nKBIi++A3AkeAuklOlq0+mGpOZwU18VRYY8nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57820416d47fa9ff361fb08bc65a2fbad2bec108a32d85ebf2d8aa7406f5b97c","last_reissued_at":"2026-07-02T01:17:52.870075Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:52.870075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00732","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-02T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkO3apnUTZa9RTshB6bGBCtRBY+RVYhQj21K7a7ROcITXHcXaEW7hN+lLZrqY1xjVEspY46Iw7BLqXVbLWvjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:19:18.862370Z"},"content_sha256":"bf9565c97022b1b7cd61516b7dd47fa5816d83a44aefd909184686391e943048","schema_version":"1.0","event_id":"sha256:bf9565c97022b1b7cd61516b7dd47fa5816d83a44aefd909184686391e943048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:K6BAIFWUP6U76NQ7WCF4MWRPXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Erd\\H{o}s--Rogers problems for $r$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lulu Dai, Qizhong Lin","submitted_at":"2026-07-01T10:17:22Z","abstract_excerpt":"Let \\(F\\) and \\(G\\) be \\(r\\)-uniform hypergraphs, and let \\(f_{F,G}(n)\\) be the largest integer \\(m\\) such that every \\(n\\)-vertex \\(G\\)-free \\(r\\)-graph contains an induced \\(F\\)-free subgraph on \\(m\\) vertices. We prove that, if \\(r\\ge3\\), \\(F\\) is nonempty, \\(G\\) is \\(2\\)-tightly connected, and there is no homomorphism from \\(G\\) to \\(F\\), then \\[\n  f_{F,G}(n)\\le C(\\log n)^{\\beta_F},\n  \\qquad\n  \\beta_F=\n  \\max_{\\substack{\\emptyset\\ne P\\subseteq\\partial_2F}}\n  \\frac{e(P)}{v(P)-1}. \\] For \\(r=3\\), this confirms a conjecture of He and Nie for tightly connected \\(3\\)-graphs, sharpening their ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00732","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.00732/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-02T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3OUxNFgoo3oOrU+Tp9eOmEe4atS/n7xQvXUMw8faLGBvb4scHrJ9CaXgZaEjEpbcO77d4ADPQg1lc97Jodi/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:19:18.862982Z"},"content_sha256":"753b234a85a813801b15f1179c0d3d676bd11da824f204217ffc0c4d731cbfb0","schema_version":"1.0","event_id":"sha256:753b234a85a813801b15f1179c0d3d676bd11da824f204217ffc0c4d731cbfb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/bundle.json","state_url":"https://pith.science/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/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-13T03:19:18Z","links":{"resolver":"https://pith.science/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL","bundle":"https://pith.science/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/bundle.json","state":"https://pith.science/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6BAIFWUP6U76NQ7WCF4MWRPXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:K6BAIFWUP6U76NQ7WCF4MWRPXL","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":"e96f2247b3611a943dd1212db886cb270acd7ac0715b67622f6ad54bc6bf9801","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:17:22Z","title_canon_sha256":"9489672a0c5da4030a333b63f1f36599e1235b60d72f3399e010190be119376b"},"schema_version":"1.0","source":{"id":"2607.00732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00732","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00732v1","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00732","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"K6BAIFWUP6U7","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_16","alias_value":"K6BAIFWUP6U76NQ7","created_at":"2026-07-02T01:17:52Z"},{"alias_kind":"pith_short_8","alias_value":"K6BAIFWU","created_at":"2026-07-02T01:17:52Z"}],"graph_snapshots":[{"event_id":"sha256:753b234a85a813801b15f1179c0d3d676bd11da824f204217ffc0c4d731cbfb0","target":"graph","created_at":"2026-07-02T01:17:52Z","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.00732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let \\(F\\) and \\(G\\) be \\(r\\)-uniform hypergraphs, and let \\(f_{F,G}(n)\\) be the largest integer \\(m\\) such that every \\(n\\)-vertex \\(G\\)-free \\(r\\)-graph contains an induced \\(F\\)-free subgraph on \\(m\\) vertices. We prove that, if \\(r\\ge3\\), \\(F\\) is nonempty, \\(G\\) is \\(2\\)-tightly connected, and there is no homomorphism from \\(G\\) to \\(F\\), then \\[\n  f_{F,G}(n)\\le C(\\log n)^{\\beta_F},\n  \\qquad\n  \\beta_F=\n  \\max_{\\substack{\\emptyset\\ne P\\subseteq\\partial_2F}}\n  \\frac{e(P)}{v(P)-1}. \\] For \\(r=3\\), this confirms a conjecture of He and Nie for tightly connected \\(3\\)-graphs, sharpening their ea","authors_text":"Lulu Dai, Qizhong Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:17:22Z","title":"Generalized Erd\\H{o}s--Rogers problems for $r$-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00732","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:bf9565c97022b1b7cd61516b7dd47fa5816d83a44aefd909184686391e943048","target":"record","created_at":"2026-07-02T01:17:52Z","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":"e96f2247b3611a943dd1212db886cb270acd7ac0715b67622f6ad54bc6bf9801","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:17:22Z","title_canon_sha256":"9489672a0c5da4030a333b63f1f36599e1235b60d72f3399e010190be119376b"},"schema_version":"1.0","source":{"id":"2607.00732","kind":"arxiv","version":1}},"canonical_sha256":"57820416d47fa9ff361fb08bc65a2fbad2bec108a32d85ebf2d8aa7406f5b97c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57820416d47fa9ff361fb08bc65a2fbad2bec108a32d85ebf2d8aa7406f5b97c","first_computed_at":"2026-07-02T01:17:52.870075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:52.870075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ewBm9tq9bo2XMLx/PsAbBcy9FCdNOsabY/Y/EuxQPLBmxQh0nKBIi++A3AkeAuklOlq0+mGpOZwU18VRYY8nBA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:52.870484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf9565c97022b1b7cd61516b7dd47fa5816d83a44aefd909184686391e943048","sha256:753b234a85a813801b15f1179c0d3d676bd11da824f204217ffc0c4d731cbfb0"],"state_sha256":"dabe5e5c90a04ca0137f5271ca88e047e3d32156d967f3afad7a86b243c1d852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjQ/tmuj8m1fo/DvLMUqulySPm4DdC3bWTeS2GCkBIHGZCrWQU8yUkKpd9v6gcAhYFb0DAFkCFChZ/IOp4k3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T03:19:18.867951Z","bundle_sha256":"9d7843682fa3d3acaebb078004017b155220d268ed3588a68dd2d176652b392e"}}