{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZRLTCAO7TUIEWYCPYB43YRQ2PY","short_pith_number":"pith:ZRLTCAO7","canonical_record":{"source":{"id":"2605.14499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"892c44f7c22756dd1daf270084526279826f90703fbf6a1bca9cab893fd5ad3e","abstract_canon_sha256":"f434d680cb49f07d37717a213b94d62451753a0be2a6cd9111786a092966c33b"},"schema_version":"1.0"},"canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","source":{"kind":"arxiv","id":"2605.14499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14499","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14499v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14499","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZRLTCAO7TUIE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZRLTCAO7TUIEWYCP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZRLTCAO7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZRLTCAO7TUIEWYCPYB43YRQ2PY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"892c44f7c22756dd1daf270084526279826f90703fbf6a1bca9cab893fd5ad3e","abstract_canon_sha256":"f434d680cb49f07d37717a213b94d62451753a0be2a6cd9111786a092966c33b"},"schema_version":"1.0"},"canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.337856Z","signature_b64":"sdz+/2iRaNjGuHO4CCaleSASiKCCVJ0mZ40VIJMxt6kxkiXHWhIbhkghKHAnc6nBh/WMfkgqI2GLPvwaF82RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","last_reissued_at":"2026-05-17T23:39:06.337154Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.337154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14499","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-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pWIs24UmY52dxyHkkalXZszXF0c7Ij9wgkgRBbyNJUFEky9mHeNRhj3SlfFdYPYOfeMu+514vDfxeGddqC9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:02:14.604011Z"},"content_sha256":"c3a5c09f0205d06321ccfaa29c5cea178b134d9d2373c7ccc2abc0f94bd6797c","schema_version":"1.0","event_id":"sha256:c3a5c09f0205d06321ccfaa29c5cea178b134d9d2373c7ccc2abc0f94bd6797c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZRLTCAO7TUIEWYCPYB43YRQ2PY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting Axis-Parallel Segments with Weighted Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jatin Yadav, Rajiv Raman, Siddhartha Sarkar","submitted_at":"2026-05-14T07:38:53Z","abstract_excerpt":"We study a geometric hitting-set problem in which the input consists of a set $P$ of weighted points and a family $S=H\\cup V$ of axis-parallel segments in the plane. The goal is to select a minimum-weight subset of $P$ that hits every segment in $S$. Even restricted geometric hitting-set problems are known to be computationally hard, and for axis-parallel segments the standard decomposition into horizontal and vertical sub-instances yields only a simple factor-$2$ approximation.\n  We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a random"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c31ff41486780d14e61ae45da56ea8860db0f8ea942348c6edb38b60943860c4"},"source":{"id":"2605.14499","kind":"arxiv","version":1},"verdict":{"id":"e5f08f6d-769e-407b-bbd9-cc3bc666878e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:10:53.806777Z","strongest_claim":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances.","one_line_summary":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism.","pith_extraction_headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier."},"references":{"count":34,"sample":[{"doi":"","year":2019,"title":"Approximationschemesforindependent set and sparse subsets of polygons.Journal of the ACM, 66(4):29:1–29:40, 2019","work_id":"8b2999d8-49e2-4601-9e26-22ea57dc1177","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"A non-linear lower bound for planar epsilon-nets.Discret","work_id":"20aecde9-b3dd-4ed4-ab34-20b83222306b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Small-sizeϵ-nets for axis-parallel rectangles and boxes.SIAM J","work_id":"a59230f4-3ca2-4e4e-a022-8ecfd1ebaa06","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Katz, Gila Morgenstern, and Yelena Yuditsky","work_id":"c3afed10-afbc-4cf1-b508-a02ae7220bd0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"On the number of points in general position in the plane","work_id":"2db04dd3-3eac-4738-a324-652cf1cdb30b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":34,"snapshot_sha256":"23ef8044d10a4bf6980b7cd5e290253318e2b863e5089860bdc20e4d45b55b9e","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":"e5f08f6d-769e-407b-bbd9-cc3bc666878e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MdHn+83oJwb4dXCxCktHrpqvadzZuSjpnnCwCE/z7Lu4gBYxE9pHv4x+PWRAUlZmhF2pmjG1Uw17n4rI76FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:02:14.605013Z"},"content_sha256":"818b6e6ba333bdbc493459eeb90b78bcdf921f42c05fba65512958a7d014a628","schema_version":"1.0","event_id":"sha256:818b6e6ba333bdbc493459eeb90b78bcdf921f42c05fba65512958a7d014a628"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/bundle.json","state_url":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/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-22T04:02:14Z","links":{"resolver":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY","bundle":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/bundle.json","state":"https://pith.science/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRLTCAO7TUIEWYCPYB43YRQ2PY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZRLTCAO7TUIEWYCPYB43YRQ2PY","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":"f434d680cb49f07d37717a213b94d62451753a0be2a6cd9111786a092966c33b","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","title_canon_sha256":"892c44f7c22756dd1daf270084526279826f90703fbf6a1bca9cab893fd5ad3e"},"schema_version":"1.0","source":{"id":"2605.14499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14499","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14499v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14499","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZRLTCAO7TUIE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZRLTCAO7TUIEWYCP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZRLTCAO7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:818b6e6ba333bdbc493459eeb90b78bcdf921f42c05fba65512958a7d014a628","target":"graph","created_at":"2026-05-17T23:39:06Z","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":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier."}],"snapshot_sha256":"c31ff41486780d14e61ae45da56ea8860db0f8ea942348c6edb38b60943860c4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study a geometric hitting-set problem in which the input consists of a set $P$ of weighted points and a family $S=H\\cup V$ of axis-parallel segments in the plane. The goal is to select a minimum-weight subset of $P$ that hits every segment in $S$. Even restricted geometric hitting-set problems are known to be computationally hard, and for axis-parallel segments the standard decomposition into horizontal and vertical sub-instances yields only a simple factor-$2$ approximation.\n  We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a random","authors_text":"Jatin Yadav, Rajiv Raman, Siddhartha Sarkar","cross_cats":["cs.DS"],"headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","title":"Hitting Axis-Parallel Segments with Weighted Points"},"references":{"count":34,"internal_anchors":0,"resolved_work":34,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Approximationschemesforindependent set and sparse subsets of polygons.Journal of the ACM, 66(4):29:1–29:40, 2019","work_id":"8b2999d8-49e2-4601-9e26-22ea57dc1177","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A non-linear lower bound for planar epsilon-nets.Discret","work_id":"20aecde9-b3dd-4ed4-ab34-20b83222306b","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Small-sizeϵ-nets for axis-parallel rectangles and boxes.SIAM J","work_id":"a59230f4-3ca2-4e4e-a022-8ecfd1ebaa06","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Katz, Gila Morgenstern, and Yelena Yuditsky","work_id":"c3afed10-afbc-4cf1-b508-a02ae7220bd0","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On the number of points in general position in the plane","work_id":"2db04dd3-3eac-4738-a324-652cf1cdb30b","year":2018}],"snapshot_sha256":"23ef8044d10a4bf6980b7cd5e290253318e2b863e5089860bdc20e4d45b55b9e"},"source":{"id":"2605.14499","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:10:53.806777Z","id":"e5f08f6d-769e-407b-bbd9-cc3bc666878e","model_set":{"reader":"grok-4.3"},"one_line_summary":"An LP-rounding algorithm yields a randomized (1 + 2/e)-approximation for weighted hitting set of axis-parallel segments, with a (1 + 1/(e-1)) bound in the unweighted case and 1 + 1/e when one orientation consists of lines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An LP-rounding algorithm achieves a randomized (1 + 2/e)-approximation for hitting weighted axis-parallel segments, breaking the factor-2 barrier.","strongest_claim":"We present an LP-rounding algorithm that breaks the factor-2 barrier. For the weighted problem, we obtain a randomized (1+2/e)-approximation by combining systematic rounding on horizontal lines with an exact repair step on residual vertical sub-instances.","weakest_assumption":"The LP relaxation admits an efficient solution whose fractional optimum is within a constant factor of the integral optimum, and that the rounding analysis holds without additional assumptions on point or segment positions beyond axis-parallelism."}},"verdict_id":"e5f08f6d-769e-407b-bbd9-cc3bc666878e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3a5c09f0205d06321ccfaa29c5cea178b134d9d2373c7ccc2abc0f94bd6797c","target":"record","created_at":"2026-05-17T23:39:06Z","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":"f434d680cb49f07d37717a213b94d62451753a0be2a6cd9111786a092966c33b","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T07:38:53Z","title_canon_sha256":"892c44f7c22756dd1daf270084526279826f90703fbf6a1bca9cab893fd5ad3e"},"schema_version":"1.0","source":{"id":"2605.14499","kind":"arxiv","version":1}},"canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc573101df9d104b604fc079bc461a7e0d79edf1573de58378c17b95ae5028df","first_computed_at":"2026-05-17T23:39:06.337154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.337154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sdz+/2iRaNjGuHO4CCaleSASiKCCVJ0mZ40VIJMxt6kxkiXHWhIbhkghKHAnc6nBh/WMfkgqI2GLPvwaF82RDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.337856Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a5c09f0205d06321ccfaa29c5cea178b134d9d2373c7ccc2abc0f94bd6797c","sha256:818b6e6ba333bdbc493459eeb90b78bcdf921f42c05fba65512958a7d014a628"],"state_sha256":"f187eb75c5302902e213959f3d837c46dcb643b6358ec906fee80977a51c1509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmY9fEyhRTGQLA0gtVSK/lYQETBnpSSsjW9kLEICCCiZEnkm3wt7Erou7ElDaQ8VfMeJ6+JTXJMwEBDGYE1LBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:02:14.609704Z","bundle_sha256":"81f37103f070824b875af160947611a7a13239d07b83bc67968f7da92da1e351"}}