{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KWQ3KBUEUFWOEBCHLEH3ICB3MJ","short_pith_number":"pith:KWQ3KBUE","canonical_record":{"source":{"id":"1312.5248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T18:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"4cb856883ee05902e32e0186b9c61e528dc5b82f66891255acbcf5a4bbb1813f","abstract_canon_sha256":"ee0a3aa8ef91dd5cdb70609374a8c848389e86294906e950e2480ccb484a28f0"},"schema_version":"1.0"},"canonical_sha256":"55a1b50684a16ce20447590fb4083b6240aba1fa3784fd6d4140526bb95e9e53","source":{"kind":"arxiv","id":"1312.5248","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5248","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5248v2","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5248","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"KWQ3KBUEUFWO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KWQ3KBUEUFWOEBCH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KWQ3KBUE","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KWQ3KBUEUFWOEBCHLEH3ICB3MJ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T18:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"4cb856883ee05902e32e0186b9c61e528dc5b82f66891255acbcf5a4bbb1813f","abstract_canon_sha256":"ee0a3aa8ef91dd5cdb70609374a8c848389e86294906e950e2480ccb484a28f0"},"schema_version":"1.0"},"canonical_sha256":"55a1b50684a16ce20447590fb4083b6240aba1fa3784fd6d4140526bb95e9e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:52.234323Z","signature_b64":"yCkeLwf+etH8t97Z2PwlBwBHZTa9jj/Q56t68lmGF9xXYSL9Mreb0jswPwYJD0xwanNk40xWUyLMw7A6fw5vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a1b50684a16ce20447590fb4083b6240aba1fa3784fd6d4140526bb95e9e53","last_reissued_at":"2026-05-18T02:35:52.233873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:52.233873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5248","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:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KH1wQMRyrQ9nmv2phsHNUKjxjgBciGgHCnNm7HrwUGGqZTG+bMaj2oQK1Qx2U/UfqVNGMaPg3XY2U2VGii3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:28:08.502043Z"},"content_sha256":"fd737e221e41f570907f47c7fd479afdcb1ff7b2b482ac0a679ddaa607316b43","schema_version":"1.0","event_id":"sha256:fd737e221e41f570907f47c7fd479afdcb1ff7b2b482ac0a679ddaa607316b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KWQ3KBUEUFWOEBCHLEH3ICB3MJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of $K_4$-saturating edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh","submitted_at":"2013-12-18T18:00:48Z","abstract_excerpt":"Let $G$ be a $K_4$-free graph, an edge in its complement is a $K_4$-\\emph{saturating} edge if the addition of this edge to $G$ creates a copy of $K_4$. Erd\\H{o}s and Tuza conjectured that for any $n$-vertex $K_4$-free graph $G$ with $\\lfloor n^2/4\\rfloor+1$ edges, one can find at least $(1+o(1))\\frac{n^2}{16}$ $K_4$-saturating edges. We construct a graph with only $\\frac{2n^2}{33}$ $K_4$-saturating edges. Furthermore, we prove that it is best possible, i.e., one can always find at least $(1+o(1))\\frac{2n^2}{33}$ $K_4$-saturating edges in an $n$-vertex $K_4$-free graph with $\\lfloor n^2/4\\rfloo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5248","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:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXg4eG+jMmWUTD8IJreaYtsYvd1M/lnMmfz5Fg9vLMtWihtS2iYYHoKbB98oGCNMTkUXzxUShAJVwPMoRo6GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:28:08.502399Z"},"content_sha256":"c997e369e46053b6cc211efa0a8afa6846386412aab1b00345543d73d7e1f439","schema_version":"1.0","event_id":"sha256:c997e369e46053b6cc211efa0a8afa6846386412aab1b00345543d73d7e1f439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/bundle.json","state_url":"https://pith.science/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/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-05T00:28:08Z","links":{"resolver":"https://pith.science/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ","bundle":"https://pith.science/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/bundle.json","state":"https://pith.science/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWQ3KBUEUFWOEBCHLEH3ICB3MJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KWQ3KBUEUFWOEBCHLEH3ICB3MJ","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":"ee0a3aa8ef91dd5cdb70609374a8c848389e86294906e950e2480ccb484a28f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T18:00:48Z","title_canon_sha256":"4cb856883ee05902e32e0186b9c61e528dc5b82f66891255acbcf5a4bbb1813f"},"schema_version":"1.0","source":{"id":"1312.5248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5248","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5248v2","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5248","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"KWQ3KBUEUFWO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KWQ3KBUEUFWOEBCH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KWQ3KBUE","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:c997e369e46053b6cc211efa0a8afa6846386412aab1b00345543d73d7e1f439","target":"graph","created_at":"2026-05-18T02:35:52Z","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 $G$ be a $K_4$-free graph, an edge in its complement is a $K_4$-\\emph{saturating} edge if the addition of this edge to $G$ creates a copy of $K_4$. Erd\\H{o}s and Tuza conjectured that for any $n$-vertex $K_4$-free graph $G$ with $\\lfloor n^2/4\\rfloor+1$ edges, one can find at least $(1+o(1))\\frac{n^2}{16}$ $K_4$-saturating edges. We construct a graph with only $\\frac{2n^2}{33}$ $K_4$-saturating edges. Furthermore, we prove that it is best possible, i.e., one can always find at least $(1+o(1))\\frac{2n^2}{33}$ $K_4$-saturating edges in an $n$-vertex $K_4$-free graph with $\\lfloor n^2/4\\rfloo","authors_text":"Hong Liu, J\\'ozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T18:00:48Z","title":"On the number of $K_4$-saturating edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5248","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:fd737e221e41f570907f47c7fd479afdcb1ff7b2b482ac0a679ddaa607316b43","target":"record","created_at":"2026-05-18T02:35:52Z","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":"ee0a3aa8ef91dd5cdb70609374a8c848389e86294906e950e2480ccb484a28f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T18:00:48Z","title_canon_sha256":"4cb856883ee05902e32e0186b9c61e528dc5b82f66891255acbcf5a4bbb1813f"},"schema_version":"1.0","source":{"id":"1312.5248","kind":"arxiv","version":2}},"canonical_sha256":"55a1b50684a16ce20447590fb4083b6240aba1fa3784fd6d4140526bb95e9e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55a1b50684a16ce20447590fb4083b6240aba1fa3784fd6d4140526bb95e9e53","first_computed_at":"2026-05-18T02:35:52.233873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:52.233873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCkeLwf+etH8t97Z2PwlBwBHZTa9jj/Q56t68lmGF9xXYSL9Mreb0jswPwYJD0xwanNk40xWUyLMw7A6fw5vBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:52.234323Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd737e221e41f570907f47c7fd479afdcb1ff7b2b482ac0a679ddaa607316b43","sha256:c997e369e46053b6cc211efa0a8afa6846386412aab1b00345543d73d7e1f439"],"state_sha256":"665cac578dbb99d4f93ac3d4f06534af854c2eac2e2f11146b5be77e19140603"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYhxQoD41ZpqHkAIgUmKqh5lcarfoqrosDr36gvxanRGlWws3GOrl/Kb9HBsBohRd1qtZ/SrZuaIVUprULpxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:28:08.504657Z","bundle_sha256":"2337f4882e3a5f2cb03defeb6c9b03d56cdcb834201715bf3c47605a126a8560"}}