{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UB4LIIPC5DPFRGJXBFVQNWRVDZ","short_pith_number":"pith:UB4LIIPC","canonical_record":{"source":{"id":"1906.11718","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T15:03:20Z","cross_cats_sorted":[],"title_canon_sha256":"0bcf2383a27d393bf762f1123f0759c3d811ee98c828d637be2b1d1d7a557ce0","abstract_canon_sha256":"a593a1130e47703c00f0cfe0ad5dadd7131855910f47c41dec921f15691e0e3b"},"schema_version":"1.0"},"canonical_sha256":"a078b421e2e8de589937096b06da351e4c7829aa5b2674d72cd0819b7cead77c","source":{"kind":"arxiv","id":"1906.11718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11718","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11718v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11718","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"UB4LIIPC5DPF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UB4LIIPC5DPFRGJX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UB4LIIPC","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UB4LIIPC5DPFRGJXBFVQNWRVDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11718","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T15:03:20Z","cross_cats_sorted":[],"title_canon_sha256":"0bcf2383a27d393bf762f1123f0759c3d811ee98c828d637be2b1d1d7a557ce0","abstract_canon_sha256":"a593a1130e47703c00f0cfe0ad5dadd7131855910f47c41dec921f15691e0e3b"},"schema_version":"1.0"},"canonical_sha256":"a078b421e2e8de589937096b06da351e4c7829aa5b2674d72cd0819b7cead77c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.015936Z","signature_b64":"KiHJ+hokw1Zp57rMEo69A7tyxHERezHxnkVVz4BxFaAYio10B6w91Zr7+BpRYyD4F4XkCfDR1tMSiPrMAOm5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a078b421e2e8de589937096b06da351e4c7829aa5b2674d72cd0819b7cead77c","last_reissued_at":"2026-05-17T23:42:04.015176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.015176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11718","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:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWNViztfw1UVWmQPpf5Hi96MjeyrakcK9oakUgo25N3KaZZkiLFN2MdD8UIBhacxTJ2ujdUHIhIZB/ywthtNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:20:23.281977Z"},"content_sha256":"354c4310acc943b39db043398aa9e649ec0b146bb9c11c19f217d9ee432ebec0","schema_version":"1.0","event_id":"sha256:354c4310acc943b39db043398aa9e649ec0b146bb9c11c19f217d9ee432ebec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UB4LIIPC5DPFRGJXBFVQNWRVDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving Word Equations Using SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Danny B{\\o}gsted Poulsen, Dirk Nowotka, Florin Manea, Joel D. Day, Mitja Kulczynski, Thorsten Ehlers","submitted_at":"2019-06-27T15:03:20Z","abstract_excerpt":"We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by reformulating the satisfiability of bounded word equations as a reachability problem for nondeterministic finite automata, and then carefully encoding this as a propositional satisfiability problem, which we then solve using the well-known Glucose SAT-solver. This approach has the advantage of allowing for the natural inclusion of additional linear length constraints. Our solver obtains reliable and competitive results an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11718","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":""},"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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PriAPBG8bQKjldGHS1ZSCxqIegozkkA9aYRjk66MqpAcTS6PTbyFzwy3EdZWsv4SBuKUPfRHqIYGmwVIjWE+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:20:23.282342Z"},"content_sha256":"04e0e52cbb366d1dedd92b751e22604e8ad9a85a5962794b1a1e897a3993e63c","schema_version":"1.0","event_id":"sha256:04e0e52cbb366d1dedd92b751e22604e8ad9a85a5962794b1a1e897a3993e63c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/bundle.json","state_url":"https://pith.science/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/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-28T03:20:23Z","links":{"resolver":"https://pith.science/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ","bundle":"https://pith.science/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/bundle.json","state":"https://pith.science/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UB4LIIPC5DPFRGJXBFVQNWRVDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UB4LIIPC5DPFRGJXBFVQNWRVDZ","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":"a593a1130e47703c00f0cfe0ad5dadd7131855910f47c41dec921f15691e0e3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T15:03:20Z","title_canon_sha256":"0bcf2383a27d393bf762f1123f0759c3d811ee98c828d637be2b1d1d7a557ce0"},"schema_version":"1.0","source":{"id":"1906.11718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11718","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11718v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11718","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"UB4LIIPC5DPF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UB4LIIPC5DPFRGJX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UB4LIIPC","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:04e0e52cbb366d1dedd92b751e22604e8ad9a85a5962794b1a1e897a3993e63c","target":"graph","created_at":"2026-05-17T23:42:04Z","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"},"paper":{"abstract_excerpt":"We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by reformulating the satisfiability of bounded word equations as a reachability problem for nondeterministic finite automata, and then carefully encoding this as a propositional satisfiability problem, which we then solve using the well-known Glucose SAT-solver. This approach has the advantage of allowing for the natural inclusion of additional linear length constraints. Our solver obtains reliable and competitive results an","authors_text":"Danny B{\\o}gsted Poulsen, Dirk Nowotka, Florin Manea, Joel D. Day, Mitja Kulczynski, Thorsten Ehlers","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T15:03:20Z","title":"On Solving Word Equations Using SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11718","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:354c4310acc943b39db043398aa9e649ec0b146bb9c11c19f217d9ee432ebec0","target":"record","created_at":"2026-05-17T23:42:04Z","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":"a593a1130e47703c00f0cfe0ad5dadd7131855910f47c41dec921f15691e0e3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-06-27T15:03:20Z","title_canon_sha256":"0bcf2383a27d393bf762f1123f0759c3d811ee98c828d637be2b1d1d7a557ce0"},"schema_version":"1.0","source":{"id":"1906.11718","kind":"arxiv","version":1}},"canonical_sha256":"a078b421e2e8de589937096b06da351e4c7829aa5b2674d72cd0819b7cead77c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a078b421e2e8de589937096b06da351e4c7829aa5b2674d72cd0819b7cead77c","first_computed_at":"2026-05-17T23:42:04.015176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:04.015176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiHJ+hokw1Zp57rMEo69A7tyxHERezHxnkVVz4BxFaAYio10B6w91Zr7+BpRYyD4F4XkCfDR1tMSiPrMAOm5Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:04.015936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:354c4310acc943b39db043398aa9e649ec0b146bb9c11c19f217d9ee432ebec0","sha256:04e0e52cbb366d1dedd92b751e22604e8ad9a85a5962794b1a1e897a3993e63c"],"state_sha256":"6b5cb8a47b66b2c50e6e3b8baeed6db32d2d41e09e680899884a2f06146dee61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9MI5VNfl6D8cfOrgHNmxfoUfQPWof1e8kmiLGM6z1cxRAmoJcq4usfHvjqYsyH3IOlyKUduqNrGqDhf28lbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:20:23.284273Z","bundle_sha256":"b0e0583fa2c44f80e078e005c21d07425b92d696e926a92c5fbf94e9ddc03ca2"}}