{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","short_pith_number":"pith:52I5OWJO","canonical_record":{"source":{"id":"2605.20421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b4d4247973282e2e533e4c044c7daf7d2970217aa506be31baa5c768d7098ae1","abstract_canon_sha256":"98049f13bca8e7b42ec79590a19109fc0e4109be7d884c01d1bebda6d9a46c34"},"schema_version":"1.0"},"canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","source":{"kind":"arxiv","id":"2605.20421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20421","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20421v1","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20421","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"52I5OWJOIZHX","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"52I5OWJOIZHXA27J","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"52I5OWJO","created_at":"2026-05-21T01:04:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b4d4247973282e2e533e4c044c7daf7d2970217aa506be31baa5c768d7098ae1","abstract_canon_sha256":"98049f13bca8e7b42ec79590a19109fc0e4109be7d884c01d1bebda6d9a46c34"},"schema_version":"1.0"},"canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:37.309889Z","signature_b64":"x5Yh1MUJa3fNOzsGAbBStRIr2fntamZmR18Bo+r3mgBvuO4BYJwnNy+zo5FdSQ6lPmYL0LXFYKmLmnItGO2wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","last_reissued_at":"2026-05-21T01:04:37.309240Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:37.309240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20421","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-21T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuJwxn5Ip6UA9bgDow3/xrSqJ3qWGgaCaYD7U4qy4QC4dxX6qfZ/ZmS116PfEidp8kZG11mPdrx3dq4lojzVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:11.105259Z"},"content_sha256":"8f5e4b23da2b16970d6d7ee613030c1c76120da0dd3ca24a357b68d59f3b4ad2","schema_version":"1.0","event_id":"sha256:8f5e4b23da2b16970d6d7ee613030c1c76120da0dd3ca24a357b68d59f3b4ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intersecting Dense Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Dmitry Chistikov, Neha Rino","submitted_at":"2026-05-19T19:18:01Z","abstract_excerpt":"We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the product of two NFA may have $\\Theta(m^2)$ transitions if these NFA have at most $n$ states and $m$ transitions each.\n  We describe alternative constructions with $O(m n)$ transitions: or $O(m n^{k-1})$ for the intersection of $k$ NFA (for fixed $k \\ge 2$ and alphabet $\\Sigma$). This gives a faster algorithm for deciding NFA intersection emptiness. The new algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20421","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/2605.20421/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-05-21T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhHWKzx5OwaMiHJh1ORIKPvmx6j4LMIdSq4++gjux4zlYRSd5wKA5IWjqeW4oC8Jx7onfFVtcA8+dE9Q0Yu/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:11.105914Z"},"content_sha256":"69950870579c4d0163d16c71fae0d003c060a1a3555909ffb42ec42a35fc9b7a","schema_version":"1.0","event_id":"sha256:69950870579c4d0163d16c71fae0d003c060a1a3555909ffb42ec42a35fc9b7a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.tcs.2007.02.063.17) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Juraj Hromkovic and Georg Schnitger. Comparing the size of NF As with and without ε-transitions. Theor. Comput. Sci. , 380(1-2):100–114, 2007. URL: https://doi.org/10.1016/j.tcs.2007.02. 063. 17","arxiv_id":"2605.20421","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Juraj Hromkovic and Georg Schnitger. Comparing the size of NF As with and without ε-transitions. Theor. Comput. Sci. , 380(1-2):100–114, 2007. URL: https://doi.org/10.1016/j.tcs.2007.02. 063. 17","reconstructed_doi":"10.1016/j.tcs.2007.02.063.17"},"severity":"advisory","ref_index":26,"audited_at":"2026-05-21T06:34:12.497893Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.tcs.2007.02.063.17","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6d23c639051553827fbe5ef510306180d06683b67bfc7c9cec92d4c09bba2b6e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5801,"payload_sha256":"860e7bee1c60cbdb4d8d2c432f7e3a1273850fca6b2518e8e24dd2b47901c518","signature_b64":"EPmDPckBT22Im4ntygmyiOEFKbMlEyUrrWfARQdhLimPlmxG2oaHhqB+vJlbupU4Gf6Y5EedRMGHKghOkRHECg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T06: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":"WyNceSTU1k14hZQD4+3ye8YjqjiKGZ2uiTJHwMdLGHsEA8BRM4xpTsg5X7HoexZnq4kZtuBOT8bmdp/YsE9PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:11.107425Z"},"content_sha256":"30a7e5100f22ac8141b9c9920de129af8e71def5bf9bb21fa0e0d1bac1609136","schema_version":"1.0","event_id":"sha256:30a7e5100f22ac8141b9c9920de129af8e71def5bf9bb21fa0e0d1bac1609136"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.STACS.2019.4.16) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Karl Bringmann. Fine-grained complexity theory (tutorial). In 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 , volume 126 of LIPIcs, pages 4:1–4:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019","arxiv_id":"2605.20421","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Karl Bringmann. Fine-grained complexity theory (tutorial). In 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 , volume 126 of LIPIcs, pages 4:1–4:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019","reconstructed_doi":"10.4230/LIPIcs.STACS.2019.4.16"},"severity":"advisory","ref_index":8,"audited_at":"2026-05-21T06:34:12.497893Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.STACS.2019.4.16","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5f893445b3a757dee245556fd82f0fc8fc6f5f2a16ccd96e1aaee7ad467b56bc","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5800,"payload_sha256":"651d2f92995b4d30c315f6c4f947cbbf91071882cbf6612eff47350d78242fe7","signature_b64":"yvOR45PX8uMS5CQ5eVC1Y5r7gOgHgzWEZ7jbXh+CjyWVW6nWYjExOHA2S6RC9Oco18ecMPFJcCwx2zfSZbhhAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T06: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":"h5xUqEyFMDR4AynfXqlZG4zFraDB2ZzJZoEp3A3Hyyz1wa5VZ80OTa54lJbp8cR5BaSI7oRGuQ7PWRZ+K547BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:46:11.107841Z"},"content_sha256":"136fe3ad462ef33feb39dfc56a13ab0cc2f9f487927bd3a16ea77918ac97959d","schema_version":"1.0","event_id":"sha256:136fe3ad462ef33feb39dfc56a13ab0cc2f9f487927bd3a16ea77918ac97959d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/bundle.json","state_url":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52I5OWJOIZHXA27JLAVDMMXNKP/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-26T01:46:11Z","links":{"resolver":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP","bundle":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/bundle.json","state":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52I5OWJOIZHXA27JLAVDMMXNKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"98049f13bca8e7b42ec79590a19109fc0e4109be7d884c01d1bebda6d9a46c34","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","title_canon_sha256":"b4d4247973282e2e533e4c044c7daf7d2970217aa506be31baa5c768d7098ae1"},"schema_version":"1.0","source":{"id":"2605.20421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20421","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20421v1","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20421","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"52I5OWJOIZHX","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"52I5OWJOIZHXA27J","created_at":"2026-05-21T01:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"52I5OWJO","created_at":"2026-05-21T01:04:37Z"}],"graph_snapshots":[{"event_id":"sha256:69950870579c4d0163d16c71fae0d003c060a1a3555909ffb42ec42a35fc9b7a","target":"graph","created_at":"2026-05-21T01:04:37Z","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/2605.20421/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the product of two NFA may have $\\Theta(m^2)$ transitions if these NFA have at most $n$ states and $m$ transitions each.\n  We describe alternative constructions with $O(m n)$ transitions: or $O(m n^{k-1})$ for the intersection of $k$ NFA (for fixed $k \\ge 2$ and alphabet $\\Sigma$). This gives a faster algorithm for deciding NFA intersection emptiness. The new algo","authors_text":"Dmitry Chistikov, Neha Rino","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","title":"Intersecting Dense Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20421","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:8f5e4b23da2b16970d6d7ee613030c1c76120da0dd3ca24a357b68d59f3b4ad2","target":"record","created_at":"2026-05-21T01:04:37Z","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":"98049f13bca8e7b42ec79590a19109fc0e4109be7d884c01d1bebda6d9a46c34","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","title_canon_sha256":"b4d4247973282e2e533e4c044c7daf7d2970217aa506be31baa5c768d7098ae1"},"schema_version":"1.0","source":{"id":"2605.20421","kind":"arxiv","version":1}},"canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","first_computed_at":"2026-05-21T01:04:37.309240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:37.309240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x5Yh1MUJa3fNOzsGAbBStRIr2fntamZmR18Bo+r3mgBvuO4BYJwnNy+zo5FdSQ6lPmYL0LXFYKmLmnItGO2wCg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:37.309889Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20421","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:136fe3ad462ef33feb39dfc56a13ab0cc2f9f487927bd3a16ea77918ac97959d","sha256:30a7e5100f22ac8141b9c9920de129af8e71def5bf9bb21fa0e0d1bac1609136"]}],"invalid_events":[],"applied_event_ids":["sha256:8f5e4b23da2b16970d6d7ee613030c1c76120da0dd3ca24a357b68d59f3b4ad2","sha256:69950870579c4d0163d16c71fae0d003c060a1a3555909ffb42ec42a35fc9b7a"],"state_sha256":"ff255f20e767c7153e85891a6702d7d006294a85d8c53e23a4d915ff7c8109d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXcd+cInFSrQDHDXoqtG8MARlIauvivtlXMzOzoUZbebq5WR4hW/8AnRef0si4GP+85ZWUtD2UCs4Xa+Gi4qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:46:11.111182Z","bundle_sha256":"3b5d2ab005295f2e380579c89fbd287cb0b83361a068364e47fdbc5e1ee6c08f"}}