{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CR2CR44D2SBT6SVQC5O6FFJAVN","short_pith_number":"pith:CR2CR44D","canonical_record":{"source":{"id":"2605.22077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T07:16:34Z","cross_cats_sorted":[],"title_canon_sha256":"ac739a7ec96572be1404bdd7cb2f342f560e134aee9b22a967c8cd88ea145492","abstract_canon_sha256":"51445bf9c1d7dec94a555dab235d38c13073579e93d6737a660555deb96d4ef4"},"schema_version":"1.0"},"canonical_sha256":"147428f383d4833f4ab0175de29520ab65a855f95a3845cb711df8fffee9d484","source":{"kind":"arxiv","id":"2605.22077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22077","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22077v1","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22077","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CR2CR44D2SBT","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"CR2CR44D2SBT6SVQ","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"CR2CR44D","created_at":"2026-05-22T01:04:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CR2CR44D2SBT6SVQC5O6FFJAVN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T07:16:34Z","cross_cats_sorted":[],"title_canon_sha256":"ac739a7ec96572be1404bdd7cb2f342f560e134aee9b22a967c8cd88ea145492","abstract_canon_sha256":"51445bf9c1d7dec94a555dab235d38c13073579e93d6737a660555deb96d4ef4"},"schema_version":"1.0"},"canonical_sha256":"147428f383d4833f4ab0175de29520ab65a855f95a3845cb711df8fffee9d484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:24.049365Z","signature_b64":"+jNXNjc0qxJIquSpUPspsAvvF+kkPuG9zh0r1MvyQyryxvsaoH8DDY+j4wHJCFpsSMHM9hgRy5iq99eL8qiJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"147428f383d4833f4ab0175de29520ab65a855f95a3845cb711df8fffee9d484","last_reissued_at":"2026-05-22T01:04:24.048390Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:24.048390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22077","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-05-22T01:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DozfPR+o84BhNhE3JuSsPTPBH5CiXvLbzCIaif9MN/ghNI2QEZlfrEWQO93euso5M2F29Dk9cwMhqCav2N5tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:49.669770Z"},"content_sha256":"1b8b3454a50428ff1867bfa67b22b00eb4045eea96c46402e6e473ff882eb506","schema_version":"1.0","event_id":"sha256:1b8b3454a50428ff1867bfa67b22b00eb4045eea96c46402e6e473ff882eb506"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CR2CR44D2SBT6SVQC5O6FFJAVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induced/Incomparable versus Ramsey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Yair Caro, Zsolt Tuza","submitted_at":"2026-05-21T07:16:34Z","abstract_excerpt":"We consider the following problem: Let $H$ and $F$ be two graphs on $k$ vertices and assume $F \\neq H$. We say that $H$ and $F$ are incomparable if neither $F$ nor $H$ contains the other.\n  Let $H$ be a graph on $k$ vertices and let $G$ be a graph on at least $k$ vertices. Then $G$ is said to be $H$-exact if any induced subgraph of $G$ on $k$ vertices is either isomorphic to $H$ or incomparable with $H$. Exact($H$) is the family of all graphs $G$ which are $H$-exact.\n  We pose the following problem: For a graph $H$ on $k$ vertices, determine or estimate $f(H) = \\max \\{n: \\exists G \\in \\text{Ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22077","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/2605.22077/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-05-22T01:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wL/B+mtlnBY6p40uJ4iW6vnROUTcS33QrGxCnr5AF5S+C96KzyhmK5bEb8rLROOGoStgFs08+1y5yQV4+LPRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:49.670468Z"},"content_sha256":"0eb18465e6058ce6aeec2ccf8ef1523d8e89fc4e5869c234293124ad4b5a9534","schema_version":"1.0","event_id":"sha256:0eb18465e6058ce6aeec2ccf8ef1523d8e89fc4e5869c234293124ad4b5a9534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/bundle.json","state_url":"https://pith.science/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/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-05-30T13:27:49Z","links":{"resolver":"https://pith.science/pith/CR2CR44D2SBT6SVQC5O6FFJAVN","bundle":"https://pith.science/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/bundle.json","state":"https://pith.science/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CR2CR44D2SBT6SVQC5O6FFJAVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CR2CR44D2SBT6SVQC5O6FFJAVN","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":"51445bf9c1d7dec94a555dab235d38c13073579e93d6737a660555deb96d4ef4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T07:16:34Z","title_canon_sha256":"ac739a7ec96572be1404bdd7cb2f342f560e134aee9b22a967c8cd88ea145492"},"schema_version":"1.0","source":{"id":"2605.22077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22077","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22077v1","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22077","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CR2CR44D2SBT","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"CR2CR44D2SBT6SVQ","created_at":"2026-05-22T01:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"CR2CR44D","created_at":"2026-05-22T01:04:24Z"}],"graph_snapshots":[{"event_id":"sha256:0eb18465e6058ce6aeec2ccf8ef1523d8e89fc4e5869c234293124ad4b5a9534","target":"graph","created_at":"2026-05-22T01:04:24Z","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/2605.22077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the following problem: Let $H$ and $F$ be two graphs on $k$ vertices and assume $F \\neq H$. We say that $H$ and $F$ are incomparable if neither $F$ nor $H$ contains the other.\n  Let $H$ be a graph on $k$ vertices and let $G$ be a graph on at least $k$ vertices. Then $G$ is said to be $H$-exact if any induced subgraph of $G$ on $k$ vertices is either isomorphic to $H$ or incomparable with $H$. Exact($H$) is the family of all graphs $G$ which are $H$-exact.\n  We pose the following problem: For a graph $H$ on $k$ vertices, determine or estimate $f(H) = \\max \\{n: \\exists G \\in \\text{Ex","authors_text":"Christina Zarb, Yair Caro, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T07:16:34Z","title":"Induced/Incomparable versus Ramsey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22077","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:1b8b3454a50428ff1867bfa67b22b00eb4045eea96c46402e6e473ff882eb506","target":"record","created_at":"2026-05-22T01:04:24Z","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":"51445bf9c1d7dec94a555dab235d38c13073579e93d6737a660555deb96d4ef4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T07:16:34Z","title_canon_sha256":"ac739a7ec96572be1404bdd7cb2f342f560e134aee9b22a967c8cd88ea145492"},"schema_version":"1.0","source":{"id":"2605.22077","kind":"arxiv","version":1}},"canonical_sha256":"147428f383d4833f4ab0175de29520ab65a855f95a3845cb711df8fffee9d484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"147428f383d4833f4ab0175de29520ab65a855f95a3845cb711df8fffee9d484","first_computed_at":"2026-05-22T01:04:24.048390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:24.048390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jNXNjc0qxJIquSpUPspsAvvF+kkPuG9zh0r1MvyQyryxvsaoH8DDY+j4wHJCFpsSMHM9hgRy5iq99eL8qiJAw==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:24.049365Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b8b3454a50428ff1867bfa67b22b00eb4045eea96c46402e6e473ff882eb506","sha256:0eb18465e6058ce6aeec2ccf8ef1523d8e89fc4e5869c234293124ad4b5a9534"],"state_sha256":"f5e1d96ca1277f6b2e87574943238e8ae69fc0d77dbe3ddda702e041a11b8d55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvn6xgViQ091EIsoF3NkLAkdXI4Eb7ai1D0YI8cHcQ7NYK6uXqkD4kNf7GLScjWY62YY5GOAS2OXXOGhdp6pAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:27:49.673777Z","bundle_sha256":"7ca825428fc980639f4c08c14574e58dc5ce2541cebe9c68d59f7cd018f08807"}}