{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RUI67RIWEXKJXWPFHTH3D5W2KY","short_pith_number":"pith:RUI67RIW","canonical_record":{"source":{"id":"2605.13299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T10:13:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e401756958e668504b3b09e20c563c1d223ae8a52eb306e247e1a512b7c22894","abstract_canon_sha256":"cf35c419ebe748131ac7a76d0f046512d08b4b1f6d53d83c04ba7ac6a5ac939a"},"schema_version":"1.0"},"canonical_sha256":"8d11efc51625d49bd9e53ccfb1f6da56358fb8e061b32caaaf0573a6b0622b10","source":{"kind":"arxiv","id":"2605.13299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13299","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13299v1","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13299","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"RUI67RIWEXKJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RUI67RIWEXKJXWPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RUI67RIW","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RUI67RIWEXKJXWPFHTH3D5W2KY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T10:13:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e401756958e668504b3b09e20c563c1d223ae8a52eb306e247e1a512b7c22894","abstract_canon_sha256":"cf35c419ebe748131ac7a76d0f046512d08b4b1f6d53d83c04ba7ac6a5ac939a"},"schema_version":"1.0"},"canonical_sha256":"8d11efc51625d49bd9e53ccfb1f6da56358fb8e061b32caaaf0573a6b0622b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:49.058583Z","signature_b64":"1KCm7+Wzbs1Us9GWyXEJNmMJj6ZgRu4G7qPWotH8fFoeyPDmTBX21ng8yzhlx+/PhxPPQiF260MiECAMjDPABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d11efc51625d49bd9e53ccfb1f6da56358fb8e061b32caaaf0573a6b0622b10","last_reissued_at":"2026-05-18T02:44:49.058184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:49.058184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13299","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-05-18T02:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpqNLYi9/evipYg/jlqBGTpT66xQodTDINCAxprNJ7dyPhSXN7S32hf3jWyj431QwYv/feSElJ28Kjy+dWi+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:57:30.445501Z"},"content_sha256":"57305ab3395d88996dc32dcda9c146e8f9c8568ea672e6f078bf1d9658f5c72d","schema_version":"1.0","event_id":"sha256:57305ab3395d88996dc32dcda9c146e8f9c8568ea672e6f078bf1d9658f5c72d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RUI67RIWEXKJXWPFHTH3D5W2KY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t.","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Samuel German","submitted_at":"2026-05-13T10:13:01Z","abstract_excerpt":"A vertex-coloring of a connected graph $G$ is a strong conflict-free vertex-connection coloring if every two distinct vertices are joined by a shortest path on which some color appears exactly once. The minimum number of colors in such a coloring is the strong conflict-free vertex-connection number $\\operatorname{svcfc}(G)$. We study this problem under the parameter twin cover.\n  Let $X$ be a twin cover of $G$ of size $t$, and let $k$ be the target number of colors. In our first result, given $(G,k)$ together with a twin cover $X$, we reduce in polynomial time to an equivalent annotated instan"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Given (G,k) together with a twin cover X of size t, we reduce in polynomial time to an equivalent annotated instance on at most max{2,t+(t+1)k 2^{t+k-1}} vertices. Every connected graph G with twin cover X of size t satisfies χ(G) ≤ svcfc(G) ≤ χ(G) + t.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The kernelization result assumes a twin cover X is supplied as part of the input; the FPT claim for tc(G) + k therefore depends on either the cover being given or on the complexity of computing it separately.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5b766251d78386c90c3028ae89282a95889195e111b68e4bfd27fec2f999fcf3"},"source":{"id":"2605.13299","kind":"arxiv","version":1},"verdict":{"id":"11e280b8-7e99-4e73-9bc7-47d1c235229b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:02:45.963381Z","strongest_claim":"Given (G,k) together with a twin cover X of size t, we reduce in polynomial time to an equivalent annotated instance on at most max{2,t+(t+1)k 2^{t+k-1}} vertices. Every connected graph G with twin cover X of size t satisfies χ(G) ≤ svcfc(G) ≤ χ(G) + t.","one_line_summary":"Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The kernelization result assumes a twin cover X is supplied as part of the input; the FPT claim for tc(G) + k therefore depends on either the cover being given or on the complexity of computing it separately.","pith_extraction_headline":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t."},"references":{"count":11,"sample":[{"doi":"10.1016/j.dam.2024.03.021","year":2024,"title":"Discrete Applied Mathematics352, 88–104 (2024)","work_id":"7512394d-3307-4727-b596-0b1f2d9dfbab","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.7151/dmgt.2036","year":2018,"title":"Discussiones Mathematicae Graph Theory38(4), 911–920 (2018)","work_id":"80096e22-90d9-44fe-bd92-681d0555cdd0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/s0097539702431840","year":2003,"title":"SIAM Journal on Computing33(1), 94–136 (2003)","work_id":"0895d1b1-b83f-4305-9bb9-ccab69387e97","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.dam.2025.12.025","year":2026,"title":"Discrete Applied Mathematics383, 85–93 (2026)","work_id":"ed16aaec-6e9d-4626-9bb4-b6d44b7f2641","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.46298/dmtcs.2136","year":2015,"title":"Discrete Mathematics & Theoretical Computer Science17(2), 77–100 (2015)","work_id":"e05ab08c-e76c-427e-ae89-5c01ae5c0f81","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":11,"snapshot_sha256":"dcfdefb5c8c12d3a4cec0e3c097d6a1982e061f4b617d34d9376f60035239f2d","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"b48e3de948d75832b114bc363b10a8cfaad3c0a185d1a37bc738b4f47f624648"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"11e280b8-7e99-4e73-9bc7-47d1c235229b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGvzccd4UJmpn0BM8Y0o6FfnpxObiZQn1S4KtWD7NNZ2DuNr/NZeWxM6c2J/FUnAsi4Xu6aawO7vHauzcb/0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:57:30.446681Z"},"content_sha256":"ce0dfbbee91807f630416d7f3cd1a69f66a6a398e2b35afbacdba77c337c2053","schema_version":"1.0","event_id":"sha256:ce0dfbbee91807f630416d7f3cd1a69f66a6a398e2b35afbacdba77c337c2053"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/bundle.json","state_url":"https://pith.science/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/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-05-25T00:57:30Z","links":{"resolver":"https://pith.science/pith/RUI67RIWEXKJXWPFHTH3D5W2KY","bundle":"https://pith.science/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/bundle.json","state":"https://pith.science/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUI67RIWEXKJXWPFHTH3D5W2KY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RUI67RIWEXKJXWPFHTH3D5W2KY","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":"cf35c419ebe748131ac7a76d0f046512d08b4b1f6d53d83c04ba7ac6a5ac939a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T10:13:01Z","title_canon_sha256":"e401756958e668504b3b09e20c563c1d223ae8a52eb306e247e1a512b7c22894"},"schema_version":"1.0","source":{"id":"2605.13299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13299","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13299v1","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13299","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"RUI67RIWEXKJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RUI67RIWEXKJXWPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RUI67RIW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ce0dfbbee91807f630416d7f3cd1a69f66a6a398e2b35afbacdba77c337c2053","target":"graph","created_at":"2026-05-18T02:44:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Given (G,k) together with a twin cover X of size t, we reduce in polynomial time to an equivalent annotated instance on at most max{2,t+(t+1)k 2^{t+k-1}} vertices. Every connected graph G with twin cover X of size t satisfies χ(G) ≤ svcfc(G) ≤ χ(G) + t."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The kernelization result assumes a twin cover X is supplied as part of the input; the FPT claim for tc(G) + k therefore depends on either the cover being given or on the complexity of computing it separately."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t."}],"snapshot_sha256":"5b766251d78386c90c3028ae89282a95889195e111b68e4bfd27fec2f999fcf3"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"b48e3de948d75832b114bc363b10a8cfaad3c0a185d1a37bc738b4f47f624648"},"paper":{"abstract_excerpt":"A vertex-coloring of a connected graph $G$ is a strong conflict-free vertex-connection coloring if every two distinct vertices are joined by a shortest path on which some color appears exactly once. The minimum number of colors in such a coloring is the strong conflict-free vertex-connection number $\\operatorname{svcfc}(G)$. We study this problem under the parameter twin cover.\n  Let $X$ be a twin cover of $G$ of size $t$, and let $k$ be the target number of colors. In our first result, given $(G,k)$ together with a twin cover $X$, we reduce in polynomial time to an equivalent annotated instan","authors_text":"Samuel German","cross_cats":["cs.DS"],"headline":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T10:13:01Z","title":"Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds"},"references":{"count":11,"internal_anchors":0,"resolved_work":11,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.dam.2024.03.021","is_internal_anchor":false,"ref_index":1,"title":"Discrete Applied Mathematics352, 88–104 (2024)","work_id":"7512394d-3307-4727-b596-0b1f2d9dfbab","year":2024},{"cited_arxiv_id":"","doi":"10.7151/dmgt.2036","is_internal_anchor":false,"ref_index":2,"title":"Discussiones Mathematicae Graph Theory38(4), 911–920 (2018)","work_id":"80096e22-90d9-44fe-bd92-681d0555cdd0","year":2018},{"cited_arxiv_id":"","doi":"10.1137/s0097539702431840","is_internal_anchor":false,"ref_index":3,"title":"SIAM Journal on Computing33(1), 94–136 (2003)","work_id":"0895d1b1-b83f-4305-9bb9-ccab69387e97","year":2003},{"cited_arxiv_id":"","doi":"10.1016/j.dam.2025.12.025","is_internal_anchor":false,"ref_index":4,"title":"Discrete Applied Mathematics383, 85–93 (2026)","work_id":"ed16aaec-6e9d-4626-9bb4-b6d44b7f2641","year":2026},{"cited_arxiv_id":"","doi":"10.46298/dmtcs.2136","is_internal_anchor":false,"ref_index":5,"title":"Discrete Mathematics & Theoretical Computer Science17(2), 77–100 (2015)","work_id":"e05ab08c-e76c-427e-ae89-5c01ae5c0f81","year":2015}],"snapshot_sha256":"dcfdefb5c8c12d3a4cec0e3c097d6a1982e061f4b617d34d9376f60035239f2d"},"source":{"id":"2605.13299","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:02:45.963381Z","id":"11e280b8-7e99-4e73-9bc7-47d1c235229b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A graph with twin cover of size t has strong conflict-free vertex-connection number at most its chromatic number plus t.","strongest_claim":"Given (G,k) together with a twin cover X of size t, we reduce in polynomial time to an equivalent annotated instance on at most max{2,t+(t+1)k 2^{t+k-1}} vertices. Every connected graph G with twin cover X of size t satisfies χ(G) ≤ svcfc(G) ≤ χ(G) + t.","weakest_assumption":"The kernelization result assumes a twin cover X is supplied as part of the input; the FPT claim for tc(G) + k therefore depends on either the cover being given or on the complexity of computing it separately."}},"verdict_id":"11e280b8-7e99-4e73-9bc7-47d1c235229b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57305ab3395d88996dc32dcda9c146e8f9c8568ea672e6f078bf1d9658f5c72d","target":"record","created_at":"2026-05-18T02:44:49Z","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":"cf35c419ebe748131ac7a76d0f046512d08b4b1f6d53d83c04ba7ac6a5ac939a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T10:13:01Z","title_canon_sha256":"e401756958e668504b3b09e20c563c1d223ae8a52eb306e247e1a512b7c22894"},"schema_version":"1.0","source":{"id":"2605.13299","kind":"arxiv","version":1}},"canonical_sha256":"8d11efc51625d49bd9e53ccfb1f6da56358fb8e061b32caaaf0573a6b0622b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d11efc51625d49bd9e53ccfb1f6da56358fb8e061b32caaaf0573a6b0622b10","first_computed_at":"2026-05-18T02:44:49.058184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:49.058184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1KCm7+Wzbs1Us9GWyXEJNmMJj6ZgRu4G7qPWotH8fFoeyPDmTBX21ng8yzhlx+/PhxPPQiF260MiECAMjDPABA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:49.058583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57305ab3395d88996dc32dcda9c146e8f9c8568ea672e6f078bf1d9658f5c72d","sha256:ce0dfbbee91807f630416d7f3cd1a69f66a6a398e2b35afbacdba77c337c2053"],"state_sha256":"335fa0fc4c980f7ac53e259aecd7aed7fb092b7e5685806785870424ca02f10f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCvNUObULYeUZE5VOdYLysfcoVLxibA2+4TOrOS1kKVNqDH8d8gQdMfbi+i76F3bKEY2UWU7H7ZvqkYcruW8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T00:57:30.451205Z","bundle_sha256":"00a79eba4fadcd276073c599207fee35095801301684c688a5039c9dc37da796"}}