{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZJFDHMAHXOX777UIMTY3Y52SVF","short_pith_number":"pith:ZJFDHMAH","canonical_record":{"source":{"id":"2401.11525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-21T15:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd7dd6fbfd478fab0e446199e1ea1e6b4b370c95fb073c7a49bc336f066b7119","abstract_canon_sha256":"dab1538bf865668da8c6fa5af7bf6d5d9230ec579709ed6ab97bad632a8e0ddf"},"schema_version":"1.0"},"canonical_sha256":"ca4a33b007bbaffffe8864f1bc7752a974c8f198934cedbb7f5aae151f11a7dd","source":{"kind":"arxiv","id":"2401.11525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11525","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11525v1","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11525","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZJFDHMAHXOX7","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZJFDHMAHXOX777UI","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZJFDHMAH","created_at":"2026-07-05T09:57:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZJFDHMAHXOX777UIMTY3Y52SVF","target":"record","payload":{"canonical_record":{"source":{"id":"2401.11525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-21T15:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd7dd6fbfd478fab0e446199e1ea1e6b4b370c95fb073c7a49bc336f066b7119","abstract_canon_sha256":"dab1538bf865668da8c6fa5af7bf6d5d9230ec579709ed6ab97bad632a8e0ddf"},"schema_version":"1.0"},"canonical_sha256":"ca4a33b007bbaffffe8864f1bc7752a974c8f198934cedbb7f5aae151f11a7dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:19.087081Z","signature_b64":"hLaSCgjWbncccUPOH1pq2AX7TY8hVHrmecYxrcf+I5Bt0yv4uZd6MUzpgOuD7l7sP45sbl12QzjHYavr8ojXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca4a33b007bbaffffe8864f1bc7752a974c8f198934cedbb7f5aae151f11a7dd","last_reissued_at":"2026-07-05T09:57:19.086564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:19.086564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.11525","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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hQKoN2UYszZ6+j8iG07JYJu0B6jIYfYYWTLg0WhdgAK6dxNjFnexIx8kw0vpt4hIK1FOWAxgk7JeeFaDOqQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T21:36:33.948680Z"},"content_sha256":"bfdb2ad662daa3feff33c412babf957cfbd449d63751592228d702366bd7e3d4","schema_version":"1.0","event_id":"sha256:bfdb2ad662daa3feff33c412babf957cfbd449d63751592228d702366bd7e3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZJFDHMAHXOX777UIMTY3Y52SVF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weak rainbow saturation numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianying Xie, Xihe Li","submitted_at":"2024-01-21T15:37:47Z","abstract_excerpt":"For a fixed graph $H$, we say that an edge-colored graph $G$ is \\emph{weakly $H$-rainbow saturated} if there exists an ordering $e_1, e_2, \\ldots, e_m$ of $E\\left(\\overline{G}\\right)$ such that, for any list $c_1, c_2, \\ldots, c_m$ of pairwise distinct colors from $\\mathbb{N}$, the non-edges $e_i$ in color $c_i$ can be added to $G$, one at a time, so that every added edge creates a new rainbow copy of $H$. The \\emph{weak rainbow saturation number} of $H$, denoted by $rwsat(n,H)$, is the minimum number of edges in a weakly $H$-rainbow saturated graph on $n$ vertices. In this paper, we show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11525","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/2401.11525/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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBd8/9wltIjSvRvJRTaO0n0XbsHF9rpFppjHY0b2j3+ERe3g22573d0kDdYCXoygS0huRwZLUfwZqbMRxZuqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T21:36:33.949250Z"},"content_sha256":"6faa9214a5342f4aaec577905e156066f1595efb25d9a775dcae59a7c1eff37b","schema_version":"1.0","event_id":"sha256:6faa9214a5342f4aaec577905e156066f1595efb25d9a775dcae59a7c1eff37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/bundle.json","state_url":"https://pith.science/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/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-31T21:36:33Z","links":{"resolver":"https://pith.science/pith/ZJFDHMAHXOX777UIMTY3Y52SVF","bundle":"https://pith.science/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/bundle.json","state":"https://pith.science/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJFDHMAHXOX777UIMTY3Y52SVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZJFDHMAHXOX777UIMTY3Y52SVF","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":"dab1538bf865668da8c6fa5af7bf6d5d9230ec579709ed6ab97bad632a8e0ddf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-21T15:37:47Z","title_canon_sha256":"cd7dd6fbfd478fab0e446199e1ea1e6b4b370c95fb073c7a49bc336f066b7119"},"schema_version":"1.0","source":{"id":"2401.11525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11525","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11525v1","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11525","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZJFDHMAHXOX7","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZJFDHMAHXOX777UI","created_at":"2026-07-05T09:57:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZJFDHMAH","created_at":"2026-07-05T09:57:19Z"}],"graph_snapshots":[{"event_id":"sha256:6faa9214a5342f4aaec577905e156066f1595efb25d9a775dcae59a7c1eff37b","target":"graph","created_at":"2026-07-05T09:57:19Z","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/2401.11525/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a fixed graph $H$, we say that an edge-colored graph $G$ is \\emph{weakly $H$-rainbow saturated} if there exists an ordering $e_1, e_2, \\ldots, e_m$ of $E\\left(\\overline{G}\\right)$ such that, for any list $c_1, c_2, \\ldots, c_m$ of pairwise distinct colors from $\\mathbb{N}$, the non-edges $e_i$ in color $c_i$ can be added to $G$, one at a time, so that every added edge creates a new rainbow copy of $H$. The \\emph{weak rainbow saturation number} of $H$, denoted by $rwsat(n,H)$, is the minimum number of edges in a weakly $H$-rainbow saturated graph on $n$ vertices. In this paper, we show that","authors_text":"Jie Ma, Tianying Xie, Xihe Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-21T15:37:47Z","title":"Weak rainbow saturation numbers of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11525","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:bfdb2ad662daa3feff33c412babf957cfbd449d63751592228d702366bd7e3d4","target":"record","created_at":"2026-07-05T09:57:19Z","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":"dab1538bf865668da8c6fa5af7bf6d5d9230ec579709ed6ab97bad632a8e0ddf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-21T15:37:47Z","title_canon_sha256":"cd7dd6fbfd478fab0e446199e1ea1e6b4b370c95fb073c7a49bc336f066b7119"},"schema_version":"1.0","source":{"id":"2401.11525","kind":"arxiv","version":1}},"canonical_sha256":"ca4a33b007bbaffffe8864f1bc7752a974c8f198934cedbb7f5aae151f11a7dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca4a33b007bbaffffe8864f1bc7752a974c8f198934cedbb7f5aae151f11a7dd","first_computed_at":"2026-07-05T09:57:19.086564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:19.086564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLaSCgjWbncccUPOH1pq2AX7TY8hVHrmecYxrcf+I5Bt0yv4uZd6MUzpgOuD7l7sP45sbl12QzjHYavr8ojXAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:19.087081Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfdb2ad662daa3feff33c412babf957cfbd449d63751592228d702366bd7e3d4","sha256:6faa9214a5342f4aaec577905e156066f1595efb25d9a775dcae59a7c1eff37b"],"state_sha256":"cd1956d61369e8af3dd3e5d2a744bb933c519f074c5aa0fdfb1fca2ba1340b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXnamASO1jMUeE6sv1Jv1Eg0RmYuhRY+jsOsBPRJpirSAOheSybmbctCV6r2W4Lx2Zx2/oXH4ULYesQ1gvCaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T21:36:33.954417Z","bundle_sha256":"0a32e66aae60ae1482f78931622a981beae7044b4fc10781c3dbec79f86fc1cb"}}