{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CSONSQ34XGJUGHGQ5BYOMMGJMM","short_pith_number":"pith:CSONSQ34","canonical_record":{"source":{"id":"1810.11739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T01:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"60e7555415d334b31b2a5e42cd1778853753ba154c2455e4a16aae7b62bf25ba","abstract_canon_sha256":"4f06ba206d9b1b9e372d7a2b5edbd29f21986c3c7436bdd504d6716cf7feab20"},"schema_version":"1.0"},"canonical_sha256":"149cd9437cb993431cd0e870e630c963385ca8b51370a893e0929e5ef62cd5ba","source":{"kind":"arxiv","id":"1810.11739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11739","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11739v3","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11739","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"CSONSQ34XGJU","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_16","alias_value":"CSONSQ34XGJUGHGQ","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_8","alias_value":"CSONSQ34","created_at":"2026-07-05T00:38:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CSONSQ34XGJUGHGQ5BYOMMGJMM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T01:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"60e7555415d334b31b2a5e42cd1778853753ba154c2455e4a16aae7b62bf25ba","abstract_canon_sha256":"4f06ba206d9b1b9e372d7a2b5edbd29f21986c3c7436bdd504d6716cf7feab20"},"schema_version":"1.0"},"canonical_sha256":"149cd9437cb993431cd0e870e630c963385ca8b51370a893e0929e5ef62cd5ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:31.635999Z","signature_b64":"ksb8i0CmM5tWX515at+PUu/VEJ5nDq/7keFAb/OWvImBAyT9vcakwla3+BQkj3vKm96tQe/pcSM3+g0cW3vKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149cd9437cb993431cd0e870e630c963385ca8b51370a893e0929e5ef62cd5ba","last_reissued_at":"2026-07-05T00:38:31.635569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:31.635569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11739","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-07-05T00:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQcWw0T6bTBV+h9V8bxLlRUmUqwVcbUVTtP+CjrRg1grDUPcP6qwOchWiGK7HW76SzghZTFGEMvHJu2gwJVYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:38:39.171120Z"},"content_sha256":"7ffb6fbe2995ac17eca5662f22817370bd096f31537cdeef03551b99db82f552","schema_version":"1.0","event_id":"sha256:7ffb6fbe2995ac17eca5662f22817370bd096f31537cdeef03551b99db82f552"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CSONSQ34XGJUGHGQ5BYOMMGJMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large triangle packings and Tuza's conjecture in sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Patrick Bennett, Shira Zerbib","submitted_at":"2018-10-28T01:14:24Z","abstract_excerpt":"The triangle packing number $\\nu(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2\\nu(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random graph $G=G(n,m)$, when $m \\le 0.2403n^{3/2}$ or $m\\ge 2.1243n^{3/2}$. This is done by analyzing a greedy algorithm for finding large triangle packings in random graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11739","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.11739/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-05T00:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dxcwOoDSl/TS/HJq+abPO8O1j46qqxp+9K9UzGN3fxfilbTP3BHKH6aD6cKOIAqxBiFhbXKU/Yz+Qxv1JCPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:38:39.171810Z"},"content_sha256":"db06b94fe4e630049be74158ba99b02ffd2112cf397936848826563084311d91","schema_version":"1.0","event_id":"sha256:db06b94fe4e630049be74158ba99b02ffd2112cf397936848826563084311d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/bundle.json","state_url":"https://pith.science/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/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-07-07T14:38:39Z","links":{"resolver":"https://pith.science/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM","bundle":"https://pith.science/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/bundle.json","state":"https://pith.science/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSONSQ34XGJUGHGQ5BYOMMGJMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CSONSQ34XGJUGHGQ5BYOMMGJMM","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":"4f06ba206d9b1b9e372d7a2b5edbd29f21986c3c7436bdd504d6716cf7feab20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T01:14:24Z","title_canon_sha256":"60e7555415d334b31b2a5e42cd1778853753ba154c2455e4a16aae7b62bf25ba"},"schema_version":"1.0","source":{"id":"1810.11739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11739","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11739v3","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11739","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"CSONSQ34XGJU","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_16","alias_value":"CSONSQ34XGJUGHGQ","created_at":"2026-07-05T00:38:31Z"},{"alias_kind":"pith_short_8","alias_value":"CSONSQ34","created_at":"2026-07-05T00:38:31Z"}],"graph_snapshots":[{"event_id":"sha256:db06b94fe4e630049be74158ba99b02ffd2112cf397936848826563084311d91","target":"graph","created_at":"2026-07-05T00:38: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.11739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The triangle packing number $\\nu(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2\\nu(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random graph $G=G(n,m)$, when $m \\le 0.2403n^{3/2}$ or $m\\ge 2.1243n^{3/2}$. This is done by analyzing a greedy algorithm for finding large triangle packings in random graphs.","authors_text":"Andrzej Dudek, Patrick Bennett, Shira Zerbib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T01:14:24Z","title":"Large triangle packings and Tuza's conjecture in sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11739","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:7ffb6fbe2995ac17eca5662f22817370bd096f31537cdeef03551b99db82f552","target":"record","created_at":"2026-07-05T00:38: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":"4f06ba206d9b1b9e372d7a2b5edbd29f21986c3c7436bdd504d6716cf7feab20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T01:14:24Z","title_canon_sha256":"60e7555415d334b31b2a5e42cd1778853753ba154c2455e4a16aae7b62bf25ba"},"schema_version":"1.0","source":{"id":"1810.11739","kind":"arxiv","version":3}},"canonical_sha256":"149cd9437cb993431cd0e870e630c963385ca8b51370a893e0929e5ef62cd5ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"149cd9437cb993431cd0e870e630c963385ca8b51370a893e0929e5ef62cd5ba","first_computed_at":"2026-07-05T00:38:31.635569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:31.635569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ksb8i0CmM5tWX515at+PUu/VEJ5nDq/7keFAb/OWvImBAyT9vcakwla3+BQkj3vKm96tQe/pcSM3+g0cW3vKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:31.635999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ffb6fbe2995ac17eca5662f22817370bd096f31537cdeef03551b99db82f552","sha256:db06b94fe4e630049be74158ba99b02ffd2112cf397936848826563084311d91"],"state_sha256":"8f5815cb5b5749e4a13e65d908d151e3fb70a1044c1b07d67d544c0fca65d424"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfahRrrg61a+O6t/fYDhUf7L0BZRlgi3Uk9/WMso0ntPkj8K/urnGaT/uoiKvFwdFcrwM0NE2r0nDsbj5uVAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:38:39.173759Z","bundle_sha256":"90862ccd46126a6ea76a30f53f784331db09efd4a35712e71b79f0e7d2305c48"}}