{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7Y2WZP2QCKP6A3IIIBEUMA2QK5","short_pith_number":"pith:7Y2WZP2Q","canonical_record":{"source":{"id":"1512.06202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T07:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"0deb2bc6d2df7fb2b2f5400f08718129412483978adf7f8bad72221bc2b96deb","abstract_canon_sha256":"b257218b0318e08b8c791fb1eeaf952e61291dec0fc16442ea1a9c4b9737ce07"},"schema_version":"1.0"},"canonical_sha256":"fe356cbf50129fe06d084049460350577ec40b70069205b493de7e8335b455f1","source":{"kind":"arxiv","id":"1512.06202","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06202","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06202v2","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06202","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"7Y2WZP2QCKP6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7Y2WZP2QCKP6A3II","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7Y2WZP2Q","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7Y2WZP2QCKP6A3IIIBEUMA2QK5","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T07:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"0deb2bc6d2df7fb2b2f5400f08718129412483978adf7f8bad72221bc2b96deb","abstract_canon_sha256":"b257218b0318e08b8c791fb1eeaf952e61291dec0fc16442ea1a9c4b9737ce07"},"schema_version":"1.0"},"canonical_sha256":"fe356cbf50129fe06d084049460350577ec40b70069205b493de7e8335b455f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:31.041077Z","signature_b64":"8KBbC0hHhTuxxR4W5hGoRp+rdwi3bpswnFy+eeCDn0BEM3s+A1zW1Mg/40rAV7DzKO+CGVLiPNmHFAr5uFoUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe356cbf50129fe06d084049460350577ec40b70069205b493de7e8335b455f1","last_reissued_at":"2026-05-18T01:04:31.040351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:31.040351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06202","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-05-18T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5n/ORKKmr5u/3S2bdUI6TySc8nujSPc55yFgjHcBhM/amnpPWnqTXNKoRvkQ+25mDVbPzTs+fCePNAs20FigBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:30:23.308174Z"},"content_sha256":"2e504ba1cdbafca95ff654bfcf6f13bd60a2970e14a9cd0ad47e8140c5ad0421","schema_version":"1.0","event_id":"sha256:2e504ba1cdbafca95ff654bfcf6f13bd60a2970e14a9cd0ad47e8140c5ad0421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7Y2WZP2QCKP6A3IIIBEUMA2QK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Bipartite Subgraphs and Triangle-independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Honghai Xu","submitted_at":"2015-12-19T07:45:53Z","abstract_excerpt":"Let $\\alpha_{1} (G)$ denote the maximum size of an edge set that contains at most one edge from each triangle of $G$. Let $\\tau_{B} (G)$ denote the minimum size of an edge set whose deletion makes $G$ bipartite. It was conjectured by Lehel and independently by Puleo that $\\alpha_{1} (G) + \\tau_{B} (G) \\le n^2/4$ for every $n$-vertex graph $G$. Puleo showed that $\\alpha_{1} (G) + \\tau_{B} (G) \\le 5n^2/16$ for every $n$-vertex graph $G$. In this note, we improve the bound by showing that $\\alpha_{1} (G) + \\tau_{B} (G) \\le 4403n^2/15000$ for every $n$-vertex graph $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06202","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":""},"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-18T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0SMGhVJZQrEZ4eZowmDyH+L1lquPS7OYZs4bJYsVyzlRpX7i0PDatEml/hDKua4Qk0Sfkw90DcD9JlMa+dQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:30:23.308543Z"},"content_sha256":"900a383e1a6544b9441c52eb41fdeee41b3131cc46f557a0cc4d2a0083a3f187","schema_version":"1.0","event_id":"sha256:900a383e1a6544b9441c52eb41fdeee41b3131cc46f557a0cc4d2a0083a3f187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/bundle.json","state_url":"https://pith.science/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/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-25T10:30:23Z","links":{"resolver":"https://pith.science/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5","bundle":"https://pith.science/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/bundle.json","state":"https://pith.science/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Y2WZP2QCKP6A3IIIBEUMA2QK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7Y2WZP2QCKP6A3IIIBEUMA2QK5","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":"b257218b0318e08b8c791fb1eeaf952e61291dec0fc16442ea1a9c4b9737ce07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T07:45:53Z","title_canon_sha256":"0deb2bc6d2df7fb2b2f5400f08718129412483978adf7f8bad72221bc2b96deb"},"schema_version":"1.0","source":{"id":"1512.06202","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06202","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06202v2","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06202","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"7Y2WZP2QCKP6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7Y2WZP2QCKP6A3II","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7Y2WZP2Q","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:900a383e1a6544b9441c52eb41fdeee41b3131cc46f557a0cc4d2a0083a3f187","target":"graph","created_at":"2026-05-18T01:04:31Z","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"},"paper":{"abstract_excerpt":"Let $\\alpha_{1} (G)$ denote the maximum size of an edge set that contains at most one edge from each triangle of $G$. Let $\\tau_{B} (G)$ denote the minimum size of an edge set whose deletion makes $G$ bipartite. It was conjectured by Lehel and independently by Puleo that $\\alpha_{1} (G) + \\tau_{B} (G) \\le n^2/4$ for every $n$-vertex graph $G$. Puleo showed that $\\alpha_{1} (G) + \\tau_{B} (G) \\le 5n^2/16$ for every $n$-vertex graph $G$. In this note, we improve the bound by showing that $\\alpha_{1} (G) + \\tau_{B} (G) \\le 4403n^2/15000$ for every $n$-vertex graph $G$.","authors_text":"Honghai Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T07:45:53Z","title":"A Note on Bipartite Subgraphs and Triangle-independent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06202","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:2e504ba1cdbafca95ff654bfcf6f13bd60a2970e14a9cd0ad47e8140c5ad0421","target":"record","created_at":"2026-05-18T01:04:31Z","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":"b257218b0318e08b8c791fb1eeaf952e61291dec0fc16442ea1a9c4b9737ce07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T07:45:53Z","title_canon_sha256":"0deb2bc6d2df7fb2b2f5400f08718129412483978adf7f8bad72221bc2b96deb"},"schema_version":"1.0","source":{"id":"1512.06202","kind":"arxiv","version":2}},"canonical_sha256":"fe356cbf50129fe06d084049460350577ec40b70069205b493de7e8335b455f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe356cbf50129fe06d084049460350577ec40b70069205b493de7e8335b455f1","first_computed_at":"2026-05-18T01:04:31.040351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:31.040351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8KBbC0hHhTuxxR4W5hGoRp+rdwi3bpswnFy+eeCDn0BEM3s+A1zW1Mg/40rAV7DzKO+CGVLiPNmHFAr5uFoUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:31.041077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06202","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e504ba1cdbafca95ff654bfcf6f13bd60a2970e14a9cd0ad47e8140c5ad0421","sha256:900a383e1a6544b9441c52eb41fdeee41b3131cc46f557a0cc4d2a0083a3f187"],"state_sha256":"ec484fc6e6560165ee953c7206f877cb9b0d8e30a3ecea3be7bce939c8d0ff11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYF2vpsImFWwIU++XOCbI+rfdG6BcSNPbJjr96BdoqeTU/cwaMd0mj5wzNN1yhCqE/dGONAOgLueo76t2pzJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:30:23.310507Z","bundle_sha256":"0cc503ebbba9e19f69d900f8bf8f3006b798b45523fe598cda6152ba053ccbda"}}