{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VMDOF6HM32535B4FJL75NMD4YI","short_pith_number":"pith:VMDOF6HM","canonical_record":{"source":{"id":"2411.19267","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T16:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"23d869d17fd1a009427780a0f8ac994e25832f7f4fc4b70808a9af2d5e216202","abstract_canon_sha256":"c9032b46fda77bea7e33849ec1d73db4f21b06c1db6ee852ab88e35b2e9313e8"},"schema_version":"1.0"},"canonical_sha256":"ab06e2f8ecdebbbe87854affd6b07cc227527924e0fbd77203466312c090d6f0","source":{"kind":"arxiv","id":"2411.19267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19267","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19267v1","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19267","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"VMDOF6HM3253","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_16","alias_value":"VMDOF6HM32535B4F","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_8","alias_value":"VMDOF6HM","created_at":"2026-07-05T09:42:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VMDOF6HM32535B4FJL75NMD4YI","target":"record","payload":{"canonical_record":{"source":{"id":"2411.19267","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T16:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"23d869d17fd1a009427780a0f8ac994e25832f7f4fc4b70808a9af2d5e216202","abstract_canon_sha256":"c9032b46fda77bea7e33849ec1d73db4f21b06c1db6ee852ab88e35b2e9313e8"},"schema_version":"1.0"},"canonical_sha256":"ab06e2f8ecdebbbe87854affd6b07cc227527924e0fbd77203466312c090d6f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:00.057624Z","signature_b64":"A7p73PDVBsohYyDGusoZpMxiKim2CHa/hMJAFPkpBCWR3I0EGIC2kBOMaNPIiCBZzv96QXBgY1JdsK0PTy4jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab06e2f8ecdebbbe87854affd6b07cc227527924e0fbd77203466312c090d6f0","last_reissued_at":"2026-07-05T09:42:00.057137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:00.057137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.19267","source_version":1,"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-05T09:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GreoN/mLOgrgSUIvqRdZrdT0oNebTF6+z46Yndn8tTdznFpsPfY8Jn8bcakVChjr00w5OuGXKwrBXtlhnHDjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:58:56.346922Z"},"content_sha256":"c32d7fe0b4daf8cf47dd07e07a3ac10ee30e0751afca0594cdc35424f3b58bc9","schema_version":"1.0","event_id":"sha256:c32d7fe0b4daf8cf47dd07e07a3ac10ee30e0751afca0594cdc35424f3b58bc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VMDOF6HM32535B4FJL75NMD4YI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asier Calbet","submitted_at":"2024-11-28T16:59:57Z","abstract_excerpt":"We say that two vertices are twins if they have the same neighbourhood and that a graph is $K_r$-saturated if it does not contain $K_r$ but adding any new edge to it creates a $K_r$. In 1964, Erd\\H{o}s, Hajnal and Moon showed that $sat(n,K_r)=(r-2)n+o(n)$ for $r \\geq 3$, where $sat(n,K_r)$ is the minimum number of edges in a $K_r$-saturated graph on $n$ vertices, and determined the unique extremal graph. This graph has many twins, leading us to define $tsat(n,K_r)$ to be the minimum number of edges in a twin-free $K_r$-saturated graph on $n$ vertices. We show that $(5 +2/3)n + o(n) \\leq tsat(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19267","kind":"arxiv","version":1},"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/2411.19267/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-05T09:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knO8MUJ6Zh++IYoAdpChcTKmGEfQNq1BJ0W+PZuzPXdBdAHqh18NI26VtjgCiGRaChbzFb+p9aG0P+ycZdZKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:58:56.347580Z"},"content_sha256":"d000458c6f2e20601feac009fd6bbf5d02bc181841cf30449c383ce670388b1a","schema_version":"1.0","event_id":"sha256:d000458c6f2e20601feac009fd6bbf5d02bc181841cf30449c383ce670388b1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMDOF6HM32535B4FJL75NMD4YI/bundle.json","state_url":"https://pith.science/pith/VMDOF6HM32535B4FJL75NMD4YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMDOF6HM32535B4FJL75NMD4YI/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-08-20T05:58:56Z","links":{"resolver":"https://pith.science/pith/VMDOF6HM32535B4FJL75NMD4YI","bundle":"https://pith.science/pith/VMDOF6HM32535B4FJL75NMD4YI/bundle.json","state":"https://pith.science/pith/VMDOF6HM32535B4FJL75NMD4YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMDOF6HM32535B4FJL75NMD4YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VMDOF6HM32535B4FJL75NMD4YI","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":"c9032b46fda77bea7e33849ec1d73db4f21b06c1db6ee852ab88e35b2e9313e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T16:59:57Z","title_canon_sha256":"23d869d17fd1a009427780a0f8ac994e25832f7f4fc4b70808a9af2d5e216202"},"schema_version":"1.0","source":{"id":"2411.19267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19267","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19267v1","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19267","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"VMDOF6HM3253","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_16","alias_value":"VMDOF6HM32535B4F","created_at":"2026-07-05T09:42:00Z"},{"alias_kind":"pith_short_8","alias_value":"VMDOF6HM","created_at":"2026-07-05T09:42:00Z"}],"graph_snapshots":[{"event_id":"sha256:d000458c6f2e20601feac009fd6bbf5d02bc181841cf30449c383ce670388b1a","target":"graph","created_at":"2026-07-05T09:42:00Z","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/2411.19267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We say that two vertices are twins if they have the same neighbourhood and that a graph is $K_r$-saturated if it does not contain $K_r$ but adding any new edge to it creates a $K_r$. In 1964, Erd\\H{o}s, Hajnal and Moon showed that $sat(n,K_r)=(r-2)n+o(n)$ for $r \\geq 3$, where $sat(n,K_r)$ is the minimum number of edges in a $K_r$-saturated graph on $n$ vertices, and determined the unique extremal graph. This graph has many twins, leading us to define $tsat(n,K_r)$ to be the minimum number of edges in a twin-free $K_r$-saturated graph on $n$ vertices. We show that $(5 +2/3)n + o(n) \\leq tsat(n","authors_text":"Asier Calbet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19267","kind":"arxiv","version":1},"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:c32d7fe0b4daf8cf47dd07e07a3ac10ee30e0751afca0594cdc35424f3b58bc9","target":"record","created_at":"2026-07-05T09:42:00Z","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":"c9032b46fda77bea7e33849ec1d73db4f21b06c1db6ee852ab88e35b2e9313e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T16:59:57Z","title_canon_sha256":"23d869d17fd1a009427780a0f8ac994e25832f7f4fc4b70808a9af2d5e216202"},"schema_version":"1.0","source":{"id":"2411.19267","kind":"arxiv","version":1}},"canonical_sha256":"ab06e2f8ecdebbbe87854affd6b07cc227527924e0fbd77203466312c090d6f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab06e2f8ecdebbbe87854affd6b07cc227527924e0fbd77203466312c090d6f0","first_computed_at":"2026-07-05T09:42:00.057137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:00.057137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7p73PDVBsohYyDGusoZpMxiKim2CHa/hMJAFPkpBCWR3I0EGIC2kBOMaNPIiCBZzv96QXBgY1JdsK0PTy4jBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:00.057624Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c32d7fe0b4daf8cf47dd07e07a3ac10ee30e0751afca0594cdc35424f3b58bc9","sha256:d000458c6f2e20601feac009fd6bbf5d02bc181841cf30449c383ce670388b1a"],"state_sha256":"a1e5c524583bb3276539ff0b07ed66be694e0ce4ea293e34be4e94b1526d019e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoTdTF97V0wEDFILm45kWq/oqkVqlLaReYYBIwe9iK0xsw4Jaw+8nA5zY2BKslBGSKz44deN5qMqIBdEqNIMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T05:58:56.353596Z","bundle_sha256":"fc1ebaaa2adf15992cd7a6f394095f7aff1b739417c0ffa18ccc9a1ef3cf9708"}}