{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2XYMJ5YTQPLOANDY6DXY57XFHQ","short_pith_number":"pith:2XYMJ5YT","canonical_record":{"source":{"id":"2210.10755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T17:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"41ca987725cc42657d986b9314a20dcc0c0704f14816bf8f5e5c9ffd745d7f2f","abstract_canon_sha256":"6364786634097678c3a5cb926c3a9962aa933018fdfeb3e80ac271bd9c8d5aba"},"schema_version":"1.0"},"canonical_sha256":"d5f0c4f71383d6e03478f0ef8efee53c3634cdd98c85a615caf0f4ea7129bb41","source":{"kind":"arxiv","id":"2210.10755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.10755","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2210.10755v2","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10755","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"2XYMJ5YTQPLO","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"2XYMJ5YTQPLOANDY","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"2XYMJ5YT","created_at":"2026-07-05T07:05:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2XYMJ5YTQPLOANDY6DXY57XFHQ","target":"record","payload":{"canonical_record":{"source":{"id":"2210.10755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T17:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"41ca987725cc42657d986b9314a20dcc0c0704f14816bf8f5e5c9ffd745d7f2f","abstract_canon_sha256":"6364786634097678c3a5cb926c3a9962aa933018fdfeb3e80ac271bd9c8d5aba"},"schema_version":"1.0"},"canonical_sha256":"d5f0c4f71383d6e03478f0ef8efee53c3634cdd98c85a615caf0f4ea7129bb41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:29.863934Z","signature_b64":"kmI3Thq02pP2lVt2XPJzcnyX8urcAttFXj66y5WEXJ6OqqKNtRWzJ4WiUv2q+TJCB+zH9nPeH4C8dfj4FKFFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f0c4f71383d6e03478f0ef8efee53c3634cdd98c85a615caf0f4ea7129bb41","last_reissued_at":"2026-07-05T07:05:29.863455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:29.863455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.10755","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-05T07:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpDurMsjJ2CmQybuwjT49wAC2Yb9zUMmz909jfP8psTKFChcs01eEWe0rY/zvacKXoe1ZqyPjzfGKGP/ycPZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:31:52.697152Z"},"content_sha256":"0f2a529e21deba8dd9c3addd176bac9b022cdef977e0c6c15defd1fb284fce4b","schema_version":"1.0","event_id":"sha256:0f2a529e21deba8dd9c3addd176bac9b022cdef977e0c6c15defd1fb284fce4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2XYMJ5YTQPLOANDY6DXY57XFHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards the Erd\\H{o}s-Hajnal conjecture for $P_5$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matija Buci\\'c, Pablo Blanco","submitted_at":"2022-10-19T17:54:39Z","abstract_excerpt":"The Erd\\H{o}s-Hajnal conjecture is one of the most classical and well-known problems in extremal and structural combinatorics dating back to 1977. It asserts that in stark contrast to the case of a general $n$-vertex graph if one imposes even a little bit of structure on the graph, namely by forbidding a fixed graph $H$ as an induced subgraph, instead of only being able to find a polylogarithmic size clique or an independent set one can find one of polynomial size. Despite being the focus of considerable attention over the years the conjecture remains open. In this paper we improve the best kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10755","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/2210.10755/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-05T07:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBMba+pddsd3CctzqvmoOf6CXmE51Vscq9HCA3odc26xc9/3QByViRkARh7cpjycokL7Cw/KX8Hv/gLHwiP0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:31:52.697643Z"},"content_sha256":"ba2b5a1b25f236e80de40239440b55b83ea4338708c39dae1b7fab1f8e675cdf","schema_version":"1.0","event_id":"sha256:ba2b5a1b25f236e80de40239440b55b83ea4338708c39dae1b7fab1f8e675cdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/bundle.json","state_url":"https://pith.science/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/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-06T10:31:52Z","links":{"resolver":"https://pith.science/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ","bundle":"https://pith.science/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/bundle.json","state":"https://pith.science/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XYMJ5YTQPLOANDY6DXY57XFHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2XYMJ5YTQPLOANDY6DXY57XFHQ","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":"6364786634097678c3a5cb926c3a9962aa933018fdfeb3e80ac271bd9c8d5aba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T17:54:39Z","title_canon_sha256":"41ca987725cc42657d986b9314a20dcc0c0704f14816bf8f5e5c9ffd745d7f2f"},"schema_version":"1.0","source":{"id":"2210.10755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.10755","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2210.10755v2","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10755","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"2XYMJ5YTQPLO","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"2XYMJ5YTQPLOANDY","created_at":"2026-07-05T07:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"2XYMJ5YT","created_at":"2026-07-05T07:05:29Z"}],"graph_snapshots":[{"event_id":"sha256:ba2b5a1b25f236e80de40239440b55b83ea4338708c39dae1b7fab1f8e675cdf","target":"graph","created_at":"2026-07-05T07:05:29Z","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/2210.10755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Erd\\H{o}s-Hajnal conjecture is one of the most classical and well-known problems in extremal and structural combinatorics dating back to 1977. It asserts that in stark contrast to the case of a general $n$-vertex graph if one imposes even a little bit of structure on the graph, namely by forbidding a fixed graph $H$ as an induced subgraph, instead of only being able to find a polylogarithmic size clique or an independent set one can find one of polynomial size. Despite being the focus of considerable attention over the years the conjecture remains open. In this paper we improve the best kn","authors_text":"Matija Buci\\'c, Pablo Blanco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T17:54:39Z","title":"Towards the Erd\\H{o}s-Hajnal conjecture for $P_5$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10755","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:0f2a529e21deba8dd9c3addd176bac9b022cdef977e0c6c15defd1fb284fce4b","target":"record","created_at":"2026-07-05T07:05:29Z","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":"6364786634097678c3a5cb926c3a9962aa933018fdfeb3e80ac271bd9c8d5aba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T17:54:39Z","title_canon_sha256":"41ca987725cc42657d986b9314a20dcc0c0704f14816bf8f5e5c9ffd745d7f2f"},"schema_version":"1.0","source":{"id":"2210.10755","kind":"arxiv","version":2}},"canonical_sha256":"d5f0c4f71383d6e03478f0ef8efee53c3634cdd98c85a615caf0f4ea7129bb41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5f0c4f71383d6e03478f0ef8efee53c3634cdd98c85a615caf0f4ea7129bb41","first_computed_at":"2026-07-05T07:05:29.863455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:05:29.863455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmI3Thq02pP2lVt2XPJzcnyX8urcAttFXj66y5WEXJ6OqqKNtRWzJ4WiUv2q+TJCB+zH9nPeH4C8dfj4FKFFAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:05:29.863934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.10755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2a529e21deba8dd9c3addd176bac9b022cdef977e0c6c15defd1fb284fce4b","sha256:ba2b5a1b25f236e80de40239440b55b83ea4338708c39dae1b7fab1f8e675cdf"],"state_sha256":"3a4f86550e9b2aca96fed0d70a0592b14d0a1a9c36e3c89652a80905727fb6ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfT8GU9s84EoT+pQ2hKe3b691XcLxL6w3r6N8Cd6t8ZnLr08NLqNz1xy993xH3ICw+CxL5zaJpxEb1d/w99MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:31:52.701074Z","bundle_sha256":"cbc4157e39c59010d069f6a41a628f5a7d034eaa77d86ff3cff57603e80c3563"}}