{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G5DYPYIODL4645NNYM3URLSDTP","short_pith_number":"pith:G5DYPYIO","canonical_record":{"source":{"id":"2605.28537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"78d123e4ed97ca48171baaacf92fafc39100373bd4a22f56f338b29613eef691","abstract_canon_sha256":"e216a5e5a3d1024ae8ee2dd8c269d5d259b376e510cc6aac4ba100596e4a609a"},"schema_version":"1.0"},"canonical_sha256":"374787e10e1af9ee75adc33748ae439beb2038fd0204e9003a17aba274466e5c","source":{"kind":"arxiv","id":"2605.28537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28537","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28537v1","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28537","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"G5DYPYIODL46","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"G5DYPYIODL4645NN","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"G5DYPYIO","created_at":"2026-05-28T02:04:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G5DYPYIODL4645NNYM3URLSDTP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"78d123e4ed97ca48171baaacf92fafc39100373bd4a22f56f338b29613eef691","abstract_canon_sha256":"e216a5e5a3d1024ae8ee2dd8c269d5d259b376e510cc6aac4ba100596e4a609a"},"schema_version":"1.0"},"canonical_sha256":"374787e10e1af9ee75adc33748ae439beb2038fd0204e9003a17aba274466e5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:55.763918Z","signature_b64":"Tr5gGVscTQxYh9tgTmRrOXBlsFreMe39+qyhFUOtAI7TOagNmS1jAi1QDosdLsd1KvcnqQptcY6S7T0o/AwOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"374787e10e1af9ee75adc33748ae439beb2038fd0204e9003a17aba274466e5c","last_reissued_at":"2026-05-28T02:04:55.763520Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:55.763520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28537","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-28T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WevrEoJKG77sitWvqUPECAPmCfTlwfbpl0GCLzZnnG1ZMh5ywFxTselwb8FDIwx2K7l6ExkgkOcw3Hd/HagGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:36.123183Z"},"content_sha256":"957b07fd09cf4c460c88a479bc62c1a553805e2d8b00d52c19ead788b4b543c7","schema_version":"1.0","event_id":"sha256:957b07fd09cf4c460c88a479bc62c1a553805e2d8b00d52c19ead788b4b543c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G5DYPYIODL4645NNYM3URLSDTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-critical $(P_5,\\text{chair})$-free and $(P_5,\\text{cricket})$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jorik Jooken","submitted_at":"2026-05-27T14:32:10Z","abstract_excerpt":"For graphs $G, F_1$ and $F_2$, we say that $G$ is $(F_1,F_2)$-free if neither $F_1$ nor $F_2$ is an induced subgraph of $G$. We say that $G$ is $k$-vertex-critical if the chromatic number of $G$ is $k$, but every proper induced subgraph of $G$ has chromatic number at most $k-1$. The $\\textit{chair}$ graph is a $5$-vertex graph obtained by adding a pendant vertex to one of the two central vertices of a path on $4$ vertices. The $\\textit{cricket}$ graph is a $5$-vertex graph obtained by adding two pendant vertices to a common vertex of a triangle. The path on $5$ vertices is denoted by $P_5$. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28537","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.28537/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-28T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8893SK7iVuQlRGVuV5ijjxr4BNFAQ87enXcG19qDk3dB5DBCpEiphm7hdNQa1kOhIhTbNTWUPFDQlMSjdrSPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:36.123953Z"},"content_sha256":"c30d3851511a6792990a784172abd45882b8641947b3f722757c45170200516d","schema_version":"1.0","event_id":"sha256:c30d3851511a6792990a784172abd45882b8641947b3f722757c45170200516d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5DYPYIODL4645NNYM3URLSDTP/bundle.json","state_url":"https://pith.science/pith/G5DYPYIODL4645NNYM3URLSDTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5DYPYIODL4645NNYM3URLSDTP/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-06-07T16:15:36Z","links":{"resolver":"https://pith.science/pith/G5DYPYIODL4645NNYM3URLSDTP","bundle":"https://pith.science/pith/G5DYPYIODL4645NNYM3URLSDTP/bundle.json","state":"https://pith.science/pith/G5DYPYIODL4645NNYM3URLSDTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5DYPYIODL4645NNYM3URLSDTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G5DYPYIODL4645NNYM3URLSDTP","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":"e216a5e5a3d1024ae8ee2dd8c269d5d259b376e510cc6aac4ba100596e4a609a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:32:10Z","title_canon_sha256":"78d123e4ed97ca48171baaacf92fafc39100373bd4a22f56f338b29613eef691"},"schema_version":"1.0","source":{"id":"2605.28537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28537","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28537v1","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28537","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"G5DYPYIODL46","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"G5DYPYIODL4645NN","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"G5DYPYIO","created_at":"2026-05-28T02:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:c30d3851511a6792990a784172abd45882b8641947b3f722757c45170200516d","target":"graph","created_at":"2026-05-28T02:04:55Z","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.28537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For graphs $G, F_1$ and $F_2$, we say that $G$ is $(F_1,F_2)$-free if neither $F_1$ nor $F_2$ is an induced subgraph of $G$. We say that $G$ is $k$-vertex-critical if the chromatic number of $G$ is $k$, but every proper induced subgraph of $G$ has chromatic number at most $k-1$. The $\\textit{chair}$ graph is a $5$-vertex graph obtained by adding a pendant vertex to one of the two central vertices of a path on $4$ vertices. The $\\textit{cricket}$ graph is a $5$-vertex graph obtained by adding two pendant vertices to a common vertex of a triangle. The path on $5$ vertices is denoted by $P_5$. We","authors_text":"Jorik Jooken","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:32:10Z","title":"Vertex-critical $(P_5,\\text{chair})$-free and $(P_5,\\text{cricket})$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28537","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:957b07fd09cf4c460c88a479bc62c1a553805e2d8b00d52c19ead788b4b543c7","target":"record","created_at":"2026-05-28T02:04:55Z","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":"e216a5e5a3d1024ae8ee2dd8c269d5d259b376e510cc6aac4ba100596e4a609a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:32:10Z","title_canon_sha256":"78d123e4ed97ca48171baaacf92fafc39100373bd4a22f56f338b29613eef691"},"schema_version":"1.0","source":{"id":"2605.28537","kind":"arxiv","version":1}},"canonical_sha256":"374787e10e1af9ee75adc33748ae439beb2038fd0204e9003a17aba274466e5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"374787e10e1af9ee75adc33748ae439beb2038fd0204e9003a17aba274466e5c","first_computed_at":"2026-05-28T02:04:55.763520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:55.763520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tr5gGVscTQxYh9tgTmRrOXBlsFreMe39+qyhFUOtAI7TOagNmS1jAi1QDosdLsd1KvcnqQptcY6S7T0o/AwOBg==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:55.763918Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957b07fd09cf4c460c88a479bc62c1a553805e2d8b00d52c19ead788b4b543c7","sha256:c30d3851511a6792990a784172abd45882b8641947b3f722757c45170200516d"],"state_sha256":"086d701d5dd20d97b4730b14bf2f4d5a96bfdf08f86183b2dfc447e76ca6e2ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2sQKvOtl7sSqqN2BzfP4FZgaGxl80i4ejccBYXcofElYqYc//qqknsh9+K3z9QXE6uZMtTOD6ggSasBB0OuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:15:36.127962Z","bundle_sha256":"027ae59b3bc4dc710fbacc371c0b5620392367686fc0629d9174fca8df599fe0"}}