{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DNTOOJBYCO4N7REQBQDLKEBIHH","short_pith_number":"pith:DNTOOJBY","canonical_record":{"source":{"id":"2412.17962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T20:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"49e47639ce2c33dfb31b02e53d28ce8ad7e4d0d559d878cbae3186effa994634","abstract_canon_sha256":"978ee8d4de1f02e4d3c39b988f5ffc1c2cfd8d58026ba5bdfa71a1e8a267b49b"},"schema_version":"1.0"},"canonical_sha256":"1b66e7243813b8dfc4900c06b5102839ef350a95c0146be92b7d3c68b27360cf","source":{"kind":"arxiv","id":"2412.17962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17962","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17962v1","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17962","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"DNTOOJBYCO4N","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"DNTOOJBYCO4N7REQ","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"DNTOOJBY","created_at":"2026-07-05T09:53:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DNTOOJBYCO4N7REQBQDLKEBIHH","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T20:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"49e47639ce2c33dfb31b02e53d28ce8ad7e4d0d559d878cbae3186effa994634","abstract_canon_sha256":"978ee8d4de1f02e4d3c39b988f5ffc1c2cfd8d58026ba5bdfa71a1e8a267b49b"},"schema_version":"1.0"},"canonical_sha256":"1b66e7243813b8dfc4900c06b5102839ef350a95c0146be92b7d3c68b27360cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:31.444041Z","signature_b64":"KwWfMdimkb+dGbupGlIRVMPsKqiW75WkE/bcxSVyPMXcLxF9tuY2IB9AdFfijQxseOlBnmSKFGan4BvNmJT4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b66e7243813b8dfc4900c06b5102839ef350a95c0146be92b7d3c68b27360cf","last_reissued_at":"2026-07-05T09:53:31.443627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:31.443627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17962","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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3a6vs5EqiuMq75jJYPVQ1PsLNjmGPWafhvhuyD0e1Vwob6OFFFhx9nLG9fjA8q2gK/TRcx2MKIRvsCsPk1sWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:42:33.470413Z"},"content_sha256":"f815f0494cce7ebebdeeed0f76f4cadee16879bab9e119e1c4b26b3531ae8fda","schema_version":"1.0","event_id":"sha256:f815f0494cce7ebebdeeed0f76f4cadee16879bab9e119e1c4b26b3531ae8fda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DNTOOJBYCO4N7REQBQDLKEBIHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniquely $C_{4}^{+}$-saturated graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, Kexiang Xu, Wenzhong Liu, Yuying Li","submitted_at":"2024-12-23T20:19:02Z","abstract_excerpt":"A graph $G$ is uniquely $H$-saturated if it contains no copy of a graph $H$ as a subgraph, but adding any new edge into $G$ creates exactly one copy of $H$. Let $C_{4}^{+}$ be the diamond graph consisting of a $4$-cycle $C_{4}$ with one chord and $C_{3}^{*}$ be the graph consisting of a triangle with a pendant edge. In this paper we prove that a nontrivial uniquely $C_{4}^{+}$-saturated graph $G$ has girth $3$ or $4$. Further, $G$ has girth $4$ if and only if it is a strongly regular graph with special parameters. For $n>18k^{2}-24k+10$ with $k\\geq2$, there are no uniquely $C_{4}^{+}$-saturate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17962","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/2412.17962/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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5yxR/SOtdUzJF6xiWvzRY4oMwr99rV4o+fxU+auum6G6Po8o9MOkatNS7XGsYUSWavm7B/VN5p7cwRQWbHtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:42:33.470980Z"},"content_sha256":"9f987a9d4a6968805118a770a316748c86a31757ba861448b3a9f84744d6cdcc","schema_version":"1.0","event_id":"sha256:9f987a9d4a6968805118a770a316748c86a31757ba861448b3a9f84744d6cdcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/bundle.json","state_url":"https://pith.science/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/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-24T03:42:33Z","links":{"resolver":"https://pith.science/pith/DNTOOJBYCO4N7REQBQDLKEBIHH","bundle":"https://pith.science/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/bundle.json","state":"https://pith.science/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNTOOJBYCO4N7REQBQDLKEBIHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DNTOOJBYCO4N7REQBQDLKEBIHH","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":"978ee8d4de1f02e4d3c39b988f5ffc1c2cfd8d58026ba5bdfa71a1e8a267b49b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T20:19:02Z","title_canon_sha256":"49e47639ce2c33dfb31b02e53d28ce8ad7e4d0d559d878cbae3186effa994634"},"schema_version":"1.0","source":{"id":"2412.17962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17962","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17962v1","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17962","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"DNTOOJBYCO4N","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"DNTOOJBYCO4N7REQ","created_at":"2026-07-05T09:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"DNTOOJBY","created_at":"2026-07-05T09:53:31Z"}],"graph_snapshots":[{"event_id":"sha256:9f987a9d4a6968805118a770a316748c86a31757ba861448b3a9f84744d6cdcc","target":"graph","created_at":"2026-07-05T09:53: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/2412.17962/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is uniquely $H$-saturated if it contains no copy of a graph $H$ as a subgraph, but adding any new edge into $G$ creates exactly one copy of $H$. Let $C_{4}^{+}$ be the diamond graph consisting of a $4$-cycle $C_{4}$ with one chord and $C_{3}^{*}$ be the graph consisting of a triangle with a pendant edge. In this paper we prove that a nontrivial uniquely $C_{4}^{+}$-saturated graph $G$ has girth $3$ or $4$. Further, $G$ has girth $4$ if and only if it is a strongly regular graph with special parameters. For $n>18k^{2}-24k+10$ with $k\\geq2$, there are no uniquely $C_{4}^{+}$-saturate","authors_text":"D\\'aniel Gerbner, Kexiang Xu, Wenzhong Liu, Yuying Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T20:19:02Z","title":"Uniquely $C_{4}^{+}$-saturated graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17962","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:f815f0494cce7ebebdeeed0f76f4cadee16879bab9e119e1c4b26b3531ae8fda","target":"record","created_at":"2026-07-05T09:53: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":"978ee8d4de1f02e4d3c39b988f5ffc1c2cfd8d58026ba5bdfa71a1e8a267b49b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T20:19:02Z","title_canon_sha256":"49e47639ce2c33dfb31b02e53d28ce8ad7e4d0d559d878cbae3186effa994634"},"schema_version":"1.0","source":{"id":"2412.17962","kind":"arxiv","version":1}},"canonical_sha256":"1b66e7243813b8dfc4900c06b5102839ef350a95c0146be92b7d3c68b27360cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b66e7243813b8dfc4900c06b5102839ef350a95c0146be92b7d3c68b27360cf","first_computed_at":"2026-07-05T09:53:31.443627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:31.443627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KwWfMdimkb+dGbupGlIRVMPsKqiW75WkE/bcxSVyPMXcLxF9tuY2IB9AdFfijQxseOlBnmSKFGan4BvNmJT4Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:31.444041Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f815f0494cce7ebebdeeed0f76f4cadee16879bab9e119e1c4b26b3531ae8fda","sha256:9f987a9d4a6968805118a770a316748c86a31757ba861448b3a9f84744d6cdcc"],"state_sha256":"67732e78d94856d99ba43c0d2558aba83160ef3c074755a7b062288f6efcaca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBikWSS/x+BbT+filj6Du8w/MDgu62xPiM9X0ca0sByZiGgX+g4p0FN4m0rdsuArNgzkGoh3xAgG9Ca73FwGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:42:33.476124Z","bundle_sha256":"a58176586c8e466b5f9397b100cd664c9d5f57f353ad445efeef7d7951101ec2"}}