{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BG7HTMTQ2XC2KRWHPWO5Q5KIIW","short_pith_number":"pith:BG7HTMTQ","canonical_record":{"source":{"id":"2305.11757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-19T15:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"10d15d77cf306bd86ff08e0e6fe4f2b785149a617392daca4bf7985e64c198c7","abstract_canon_sha256":"9d0668294e29081398027cf8e9ed1669bd4f5f206c460552ebafe6788da9918c"},"schema_version":"1.0"},"canonical_sha256":"09be79b270d5c5a546c77d9dd87548459dc947b225f011f96e42150b289b14fe","source":{"kind":"arxiv","id":"2305.11757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.11757","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"2305.11757v1","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11757","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"BG7HTMTQ2XC2","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"BG7HTMTQ2XC2KRWH","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"BG7HTMTQ","created_at":"2026-07-05T06:11:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BG7HTMTQ2XC2KRWHPWO5Q5KIIW","target":"record","payload":{"canonical_record":{"source":{"id":"2305.11757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-19T15:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"10d15d77cf306bd86ff08e0e6fe4f2b785149a617392daca4bf7985e64c198c7","abstract_canon_sha256":"9d0668294e29081398027cf8e9ed1669bd4f5f206c460552ebafe6788da9918c"},"schema_version":"1.0"},"canonical_sha256":"09be79b270d5c5a546c77d9dd87548459dc947b225f011f96e42150b289b14fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:50.814341Z","signature_b64":"L3j0nzFA1cRBHbikKx4ip4cujtyGNMDo91NhMVD1bf3fylSj/BGSpTfEWOKidQfptFRjDP0uO2s5fYjPoprtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09be79b270d5c5a546c77d9dd87548459dc947b225f011f96e42150b289b14fe","last_reissued_at":"2026-07-05T06:11:50.813912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:50.813912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.11757","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-05T06:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2O8hEv6iKUOYqwc1ZvtEPFvxr6pKAxWf6eCBgzPhuP7/Ky034HCFnqQmY5H6yl/qIjBeNcwkvFi6y8uiUmaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:45.388264Z"},"content_sha256":"54d3b484d93809d79024cb09335ec519a00084bcc28cec54f6e930a1fcd4aec5","schema_version":"1.0","event_id":"sha256:54d3b484d93809d79024cb09335ec519a00084bcc28cec54f6e930a1fcd4aec5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BG7HTMTQ2XC2KRWHPWO5Q5KIIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear $\\chi$-binding functions for $\\{P_3\\cup P_2, gem\\}$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Athmakoori Prashant, M. Gokulnath, S. Francis Raj","submitted_at":"2023-05-19T15:44:14Z","abstract_excerpt":"Finding families that admit a linear $\\chi$-binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of $2K_2$-free graphs has garnered much attention. In this paper, we are interested in finding a linear subfamily of a specific superclass of $2K_2$-free graphs, namely $(P_3\\cup P_2)$-free graphs. We show that the class of $\\{P_3\\cup P_2,gem\\}$-free graphs admits $f=2\\omega$ as a linear $\\chi$-binding function. Furthermore, we give examples to show that the optimal $\\chi$-binding function $f^*\\geq \\left\\lceil\\frac{5\\ome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11757","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/2305.11757/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-05T06:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHBGpWQ5OLh7ZJxknd86dnuu6DrVxQTkBV77nQ4lnPOh8wGOkHeLhanE8MV56QeXUqZZNNQCq2DW/8hyD/7lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:45.388732Z"},"content_sha256":"d6108d5ad9a86903489542a41968f2d16b2028c5dccc39d602abf8e780b27a53","schema_version":"1.0","event_id":"sha256:d6108d5ad9a86903489542a41968f2d16b2028c5dccc39d602abf8e780b27a53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/bundle.json","state_url":"https://pith.science/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/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-13T01:39:45Z","links":{"resolver":"https://pith.science/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW","bundle":"https://pith.science/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/bundle.json","state":"https://pith.science/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BG7HTMTQ2XC2KRWHPWO5Q5KIIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BG7HTMTQ2XC2KRWHPWO5Q5KIIW","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":"9d0668294e29081398027cf8e9ed1669bd4f5f206c460552ebafe6788da9918c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-19T15:44:14Z","title_canon_sha256":"10d15d77cf306bd86ff08e0e6fe4f2b785149a617392daca4bf7985e64c198c7"},"schema_version":"1.0","source":{"id":"2305.11757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.11757","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"2305.11757v1","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11757","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"BG7HTMTQ2XC2","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"BG7HTMTQ2XC2KRWH","created_at":"2026-07-05T06:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"BG7HTMTQ","created_at":"2026-07-05T06:11:50Z"}],"graph_snapshots":[{"event_id":"sha256:d6108d5ad9a86903489542a41968f2d16b2028c5dccc39d602abf8e780b27a53","target":"graph","created_at":"2026-07-05T06:11:50Z","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/2305.11757/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding families that admit a linear $\\chi$-binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of $2K_2$-free graphs has garnered much attention. In this paper, we are interested in finding a linear subfamily of a specific superclass of $2K_2$-free graphs, namely $(P_3\\cup P_2)$-free graphs. We show that the class of $\\{P_3\\cup P_2,gem\\}$-free graphs admits $f=2\\omega$ as a linear $\\chi$-binding function. Furthermore, we give examples to show that the optimal $\\chi$-binding function $f^*\\geq \\left\\lceil\\frac{5\\ome","authors_text":"Athmakoori Prashant, M. Gokulnath, S. Francis Raj","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-19T15:44:14Z","title":"Linear $\\chi$-binding functions for $\\{P_3\\cup P_2, gem\\}$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11757","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:54d3b484d93809d79024cb09335ec519a00084bcc28cec54f6e930a1fcd4aec5","target":"record","created_at":"2026-07-05T06:11:50Z","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":"9d0668294e29081398027cf8e9ed1669bd4f5f206c460552ebafe6788da9918c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-19T15:44:14Z","title_canon_sha256":"10d15d77cf306bd86ff08e0e6fe4f2b785149a617392daca4bf7985e64c198c7"},"schema_version":"1.0","source":{"id":"2305.11757","kind":"arxiv","version":1}},"canonical_sha256":"09be79b270d5c5a546c77d9dd87548459dc947b225f011f96e42150b289b14fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09be79b270d5c5a546c77d9dd87548459dc947b225f011f96e42150b289b14fe","first_computed_at":"2026-07-05T06:11:50.813912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:50.813912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L3j0nzFA1cRBHbikKx4ip4cujtyGNMDo91NhMVD1bf3fylSj/BGSpTfEWOKidQfptFRjDP0uO2s5fYjPoprtAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:50.814341Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.11757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d3b484d93809d79024cb09335ec519a00084bcc28cec54f6e930a1fcd4aec5","sha256:d6108d5ad9a86903489542a41968f2d16b2028c5dccc39d602abf8e780b27a53"],"state_sha256":"01af0e355e35f899cfdfa19c7d7cd13056f570f4d684452140625835a6a557f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAmxjTKYn87QDvnjGTlleWk+LEZdcVc9xUTYmH7Ss5mH0+h3KlhR5ffQJgnb/umrbORW5vN9lpgh3hP6KzA7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:39:45.391404Z","bundle_sha256":"f4f5be4a0143a2cb1ed3f10436ef75a3206eab748169b8cf21b9a87a0c6063aa"}}