{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RPEWC5O6X7D74GSC3GX2E7RP7W","short_pith_number":"pith:RPEWC5O6","canonical_record":{"source":{"id":"1605.01816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-06T04:17:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6b76553fcc660186357db69acb91f0ac541a79f17ff19506fba24df6fd5b15a9","abstract_canon_sha256":"1edce4960d0dff61c8adafba604d01c23984c623388fd60c4e399f9299a89181"},"schema_version":"1.0"},"canonical_sha256":"8bc96175debfc7fe1a42d9afa27e2ffdb1a1d446666753155dc9cc89169e8acb","source":{"kind":"arxiv","id":"1605.01816","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01816","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01816v3","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01816","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPEWC5O6X7D7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RPEWC5O6X7D74GSC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RPEWC5O6","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RPEWC5O6X7D74GSC3GX2E7RP7W","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-06T04:17:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6b76553fcc660186357db69acb91f0ac541a79f17ff19506fba24df6fd5b15a9","abstract_canon_sha256":"1edce4960d0dff61c8adafba604d01c23984c623388fd60c4e399f9299a89181"},"schema_version":"1.0"},"canonical_sha256":"8bc96175debfc7fe1a42d9afa27e2ffdb1a1d446666753155dc9cc89169e8acb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:47.097746Z","signature_b64":"TDEUk7+cT5WX0ofuRKvp4HKZQacc/RxQ74dqcJQguURaAwx3V04VNa9xlieO8PHjLjmPisWBnliXfRO4L9GLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc96175debfc7fe1a42d9afa27e2ffdb1a1d446666753155dc9cc89169e8acb","last_reissued_at":"2026-05-18T01:13:47.097223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:47.097223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01816","source_version":3,"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3keqwDs1fycEf64ZGmD1N0f/yCyw899SRViUoOpO+bj+fQAAbnU2ReQokCX1UuZsWxoMvBec+ZzQV4wdYoRtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:38.418230Z"},"content_sha256":"9c0c55c8817827b92fe4c174ed3c2b99800703dcdf69cc2eedb3dca78c68aef3","schema_version":"1.0","event_id":"sha256:9c0c55c8817827b92fe4c174ed3c2b99800703dcdf69cc2eedb3dca78c68aef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RPEWC5O6X7D74GSC3GX2E7RP7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.GR","authors_text":"Xiaodong Hu, Xujin Chen, Zhongzheng Tang, Zhuo Diao","submitted_at":"2016-05-06T04:17:12Z","abstract_excerpt":"Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if it intersects each triangle of $G$. Let $\\nu_t(G)$ and $\\tau_t(G)$ denote the maximum number of pairwise edge-disjoint triangles in $G$ and the minimum cardinality of a triangle cover of $G$, respectively. Tuza conjectured in 1981 that $\\tau_t(G)/\\nu_t(G)\\le2$ holds for every graph $G$. In this paper, using a hypergraph approach, we design polynomial-time combinatorial algorithms for finding small triangle covers. These algorithms imply new sufficient conditions for Tuza's conjecture on covering and packing triangles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01816","kind":"arxiv","version":3},"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKqqVg/tzKus8SJwGTtbz6N/8aiCMJXTUUKpcAFBCOMaqTHFYvE/hOXeUi1WyX4Q8Gx/5dc8+pVr+kklRSTEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:38.418966Z"},"content_sha256":"b3f16a120427202580791a32df5befdb315d23fef8d20136af37e17fbc378a25","schema_version":"1.0","event_id":"sha256:b3f16a120427202580791a32df5befdb315d23fef8d20136af37e17fbc378a25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/bundle.json","state_url":"https://pith.science/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/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-26T00:37:38Z","links":{"resolver":"https://pith.science/pith/RPEWC5O6X7D74GSC3GX2E7RP7W","bundle":"https://pith.science/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/bundle.json","state":"https://pith.science/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPEWC5O6X7D74GSC3GX2E7RP7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RPEWC5O6X7D74GSC3GX2E7RP7W","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":"1edce4960d0dff61c8adafba604d01c23984c623388fd60c4e399f9299a89181","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-06T04:17:12Z","title_canon_sha256":"6b76553fcc660186357db69acb91f0ac541a79f17ff19506fba24df6fd5b15a9"},"schema_version":"1.0","source":{"id":"1605.01816","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01816","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01816v3","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01816","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPEWC5O6X7D7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RPEWC5O6X7D74GSC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RPEWC5O6","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b3f16a120427202580791a32df5befdb315d23fef8d20136af37e17fbc378a25","target":"graph","created_at":"2026-05-18T01:13:47Z","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":"Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if it intersects each triangle of $G$. Let $\\nu_t(G)$ and $\\tau_t(G)$ denote the maximum number of pairwise edge-disjoint triangles in $G$ and the minimum cardinality of a triangle cover of $G$, respectively. Tuza conjectured in 1981 that $\\tau_t(G)/\\nu_t(G)\\le2$ holds for every graph $G$. In this paper, using a hypergraph approach, we design polynomial-time combinatorial algorithms for finding small triangle covers. These algorithms imply new sufficient conditions for Tuza's conjecture on covering and packing triangles","authors_text":"Xiaodong Hu, Xujin Chen, Zhongzheng Tang, Zhuo Diao","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-06T04:17:12Z","title":"Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01816","kind":"arxiv","version":3},"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:9c0c55c8817827b92fe4c174ed3c2b99800703dcdf69cc2eedb3dca78c68aef3","target":"record","created_at":"2026-05-18T01:13:47Z","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":"1edce4960d0dff61c8adafba604d01c23984c623388fd60c4e399f9299a89181","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-05-06T04:17:12Z","title_canon_sha256":"6b76553fcc660186357db69acb91f0ac541a79f17ff19506fba24df6fd5b15a9"},"schema_version":"1.0","source":{"id":"1605.01816","kind":"arxiv","version":3}},"canonical_sha256":"8bc96175debfc7fe1a42d9afa27e2ffdb1a1d446666753155dc9cc89169e8acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bc96175debfc7fe1a42d9afa27e2ffdb1a1d446666753155dc9cc89169e8acb","first_computed_at":"2026-05-18T01:13:47.097223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:47.097223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TDEUk7+cT5WX0ofuRKvp4HKZQacc/RxQ74dqcJQguURaAwx3V04VNa9xlieO8PHjLjmPisWBnliXfRO4L9GLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:47.097746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01816","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c0c55c8817827b92fe4c174ed3c2b99800703dcdf69cc2eedb3dca78c68aef3","sha256:b3f16a120427202580791a32df5befdb315d23fef8d20136af37e17fbc378a25"],"state_sha256":"bff60b42fa3447054695e8df809e65a542df60c6231c1fbb6c077b3f150672a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zpsr7HO0B4kvlYyyN9tNWJ0k+VoUERuEd/9IDd0ntDxRcU1YZZrPp+BJIadev7hj5uA6xI1vQ/DcVaMMo7e8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:37:38.422815Z","bundle_sha256":"b4a39beef419dd8a00134af6caa0ce04ba6ed987f099b51e7a4ba9622759827b"}}