{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VBFACPXFZZ6NHY5VZT35EKQNZ6","short_pith_number":"pith:VBFACPXF","canonical_record":{"source":{"id":"1012.0372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-02T02:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"c9285afd6ca15cde67e2ad9bb2ce4a4744ccd5119fe92d6bbc69b73895ed751c","abstract_canon_sha256":"39197579ee1c03e5e51f0306cdfe71f997f3f40f076a24ac80d01889d46b7e31"},"schema_version":"1.0"},"canonical_sha256":"a84a013ee5ce7cd3e3b5ccf7d22a0dcf9696834ef85a9904b77612cadb998ff0","source":{"kind":"arxiv","id":"1012.0372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0372","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0372v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0372","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"VBFACPXFZZ6N","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBFACPXFZZ6NHY5V","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBFACPXF","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VBFACPXFZZ6NHY5VZT35EKQNZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1012.0372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-02T02:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"c9285afd6ca15cde67e2ad9bb2ce4a4744ccd5119fe92d6bbc69b73895ed751c","abstract_canon_sha256":"39197579ee1c03e5e51f0306cdfe71f997f3f40f076a24ac80d01889d46b7e31"},"schema_version":"1.0"},"canonical_sha256":"a84a013ee5ce7cd3e3b5ccf7d22a0dcf9696834ef85a9904b77612cadb998ff0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:45.568216Z","signature_b64":"YgwXDngG6JDw1FlIADHdf48zVLXQZY6iY3nrNV6cPp8gp1eJgw97WTptMJ0wjsj+Qchzj+lDCWFKhnwDArWWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84a013ee5ce7cd3e3b5ccf7d22a0dcf9696834ef85a9904b77612cadb998ff0","last_reissued_at":"2026-05-18T02:03:45.567864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:45.567864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.0372","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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7abJZzt5M3XMAWL5q9b3LJP6xapXpIH6ei6C8KXc+dqcm+IQPhshHD7Ax039IUIuHwN5x6BiYt0mJ1U93aGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:48:35.051935Z"},"content_sha256":"558e0eb00ebd5fb6dba604c831b81e54f8eef86232987901ea60207d89c6181a","schema_version":"1.0","event_id":"sha256:558e0eb00ebd5fb6dba604c831b81e54f8eef86232987901ea60207d89c6181a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VBFACPXFZZ6NHY5VZT35EKQNZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing triangles in weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Diego Scheide, Guillaume Chapuy, Jessica McDonald, Matt DeVos","submitted_at":"2010-12-02T02:46:52Z","abstract_excerpt":"Tuza conjectured that for every graph $G$, the maximum size $\\nu$ of a set of edge-disjoint triangles and minimum size $\\tau$ of a set of edges meeting all triangles satisfy $\\tau \\leq 2\\nu$. We consider an edge-weighted version of this conjecture, which amounts to packing and covering triangles in multigraphs. Several known results about the original problem are shown to be true in this context, and some are improved. In particular, we answer a question of Krivelevich who proved that $\\tau \\leq 2\\nu^*$ (where $\\nu^*$ is the fractional version of $\\nu$), and asked if this is tight. We prove th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0372","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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3rMuu8jvTK3nGaL/LYMqjLO11Zv0bFKamd5CHkHuIwwN64c1LdWM9bquys1B3SAV3JxcexZYaxK5kI3mdn+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:48:35.052740Z"},"content_sha256":"5c26a49035529dc32ecde97e172eff80d999424798081de3b5bc64739cd87121","schema_version":"1.0","event_id":"sha256:5c26a49035529dc32ecde97e172eff80d999424798081de3b5bc64739cd87121"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/bundle.json","state_url":"https://pith.science/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/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-31T12:48:35Z","links":{"resolver":"https://pith.science/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6","bundle":"https://pith.science/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/bundle.json","state":"https://pith.science/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBFACPXFZZ6NHY5VZT35EKQNZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VBFACPXFZZ6NHY5VZT35EKQNZ6","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":"39197579ee1c03e5e51f0306cdfe71f997f3f40f076a24ac80d01889d46b7e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-02T02:46:52Z","title_canon_sha256":"c9285afd6ca15cde67e2ad9bb2ce4a4744ccd5119fe92d6bbc69b73895ed751c"},"schema_version":"1.0","source":{"id":"1012.0372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0372","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0372v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0372","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"VBFACPXFZZ6N","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBFACPXFZZ6NHY5V","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBFACPXF","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:5c26a49035529dc32ecde97e172eff80d999424798081de3b5bc64739cd87121","target":"graph","created_at":"2026-05-18T02:03:45Z","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":"Tuza conjectured that for every graph $G$, the maximum size $\\nu$ of a set of edge-disjoint triangles and minimum size $\\tau$ of a set of edges meeting all triangles satisfy $\\tau \\leq 2\\nu$. We consider an edge-weighted version of this conjecture, which amounts to packing and covering triangles in multigraphs. Several known results about the original problem are shown to be true in this context, and some are improved. In particular, we answer a question of Krivelevich who proved that $\\tau \\leq 2\\nu^*$ (where $\\nu^*$ is the fractional version of $\\nu$), and asked if this is tight. We prove th","authors_text":"Bojan Mohar, Diego Scheide, Guillaume Chapuy, Jessica McDonald, Matt DeVos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-02T02:46:52Z","title":"Packing triangles in weighted graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0372","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:558e0eb00ebd5fb6dba604c831b81e54f8eef86232987901ea60207d89c6181a","target":"record","created_at":"2026-05-18T02:03:45Z","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":"39197579ee1c03e5e51f0306cdfe71f997f3f40f076a24ac80d01889d46b7e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-02T02:46:52Z","title_canon_sha256":"c9285afd6ca15cde67e2ad9bb2ce4a4744ccd5119fe92d6bbc69b73895ed751c"},"schema_version":"1.0","source":{"id":"1012.0372","kind":"arxiv","version":2}},"canonical_sha256":"a84a013ee5ce7cd3e3b5ccf7d22a0dcf9696834ef85a9904b77612cadb998ff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a84a013ee5ce7cd3e3b5ccf7d22a0dcf9696834ef85a9904b77612cadb998ff0","first_computed_at":"2026-05-18T02:03:45.567864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:45.567864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YgwXDngG6JDw1FlIADHdf48zVLXQZY6iY3nrNV6cPp8gp1eJgw97WTptMJ0wjsj+Qchzj+lDCWFKhnwDArWWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:45.568216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:558e0eb00ebd5fb6dba604c831b81e54f8eef86232987901ea60207d89c6181a","sha256:5c26a49035529dc32ecde97e172eff80d999424798081de3b5bc64739cd87121"],"state_sha256":"1d761ba64b6e963fb60d14c6ed741ba9c5ff8148b58f604bfd905e6b74c1521f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nORNm7GfjwWD0s9h19LSYTzUfK4b15mAhI7mzld6XLxrG0MCAeDQvCdIeaoA4rVrEVYbxuYpNdZF7NZanb+eAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:48:35.056839Z","bundle_sha256":"1f4bbfb5dd91fbddb05c3a19029356cc36cf767ff996dcbd46c42e261ec18a1e"}}