{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DUOZWFH5PB4KFSRV34LVHGNVHE","short_pith_number":"pith:DUOZWFH5","canonical_record":{"source":{"id":"1811.03167","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-07T22:13:04Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0da44763d188ed36e2705c8087ca0ffa960075b108df6e5d5816537a4d77cefa","abstract_canon_sha256":"8425b34efa67ed3f0dd6e29e88ac49f48002a41cb8405197bf29d25e868d06bc"},"schema_version":"1.0"},"canonical_sha256":"1d1d9b14fd7878a2ca35df175399b53931a3607bc35197f12a4f5cd225afc414","source":{"kind":"arxiv","id":"1811.03167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03167","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03167v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03167","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"DUOZWFH5PB4K","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUOZWFH5PB4KFSRV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUOZWFH5","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DUOZWFH5PB4KFSRV34LVHGNVHE","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03167","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-07T22:13:04Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0da44763d188ed36e2705c8087ca0ffa960075b108df6e5d5816537a4d77cefa","abstract_canon_sha256":"8425b34efa67ed3f0dd6e29e88ac49f48002a41cb8405197bf29d25e868d06bc"},"schema_version":"1.0"},"canonical_sha256":"1d1d9b14fd7878a2ca35df175399b53931a3607bc35197f12a4f5cd225afc414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:18.948253Z","signature_b64":"Wsr/zxdFJz+anJ3/9ROm4sB0PrT8rAz/Z5P6krk9TlapbYZ8c42cCixQnx4JCCZWHXOusp0BBynWACWyVxHBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1d9b14fd7878a2ca35df175399b53931a3607bc35197f12a4f5cd225afc414","last_reissued_at":"2026-05-18T00:01:18.947814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:18.947814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03167","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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfyBE/LkSOy0BB+qrterUSXXSTMVrKzfAr7LtU7lXuZwjd99V3Q2NIZULKcq5MXDkehnTraxR/OlH7RhFoISDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:04:38.199500Z"},"content_sha256":"93566364f048e7165a63151b94eabaddbb88c8448d3040d0e66c9f8299788f1c","schema_version":"1.0","event_id":"sha256:93566364f048e7165a63151b94eabaddbb88c8448d3040d0e66c9f8299788f1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DUOZWFH5PB4KFSRV34LVHGNVHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Anthony W. Lin, Matthew Hague, Philipp R\\\"ummer, Taolue Chen, Zhilin Wu","submitted_at":"2018-11-07T22:13:04Z","abstract_excerpt":"The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, whose applications include symbolic execution and automated detection of cross-site scripting (XSS) vulnerabilities. A (symbolic) path is a finite sequence of assignments and assertions (i.e. without loops), and checking its feasibility amounts to determining the existence of inputs that yield a successful execution.\n  We give two general semantic conditions which together ensure the decidability of path feasibility: (1) each assertion admits regular monad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03167","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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUWpTOwi2/wIUK4IsALD0mT3AJAKCmw6BqV0Xzdp0ndrD0epZrDwgg6PR1N4X8QCV9lNyiWPzddf9ohBpx+BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:04:38.200164Z"},"content_sha256":"2d40bbf41ff01560ea989c9f0f872635f31b1e2496be523f0d4db1e47e8b78a2","schema_version":"1.0","event_id":"sha256:2d40bbf41ff01560ea989c9f0f872635f31b1e2496be523f0d4db1e47e8b78a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/bundle.json","state_url":"https://pith.science/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/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-26T08:04:38Z","links":{"resolver":"https://pith.science/pith/DUOZWFH5PB4KFSRV34LVHGNVHE","bundle":"https://pith.science/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/bundle.json","state":"https://pith.science/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUOZWFH5PB4KFSRV34LVHGNVHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DUOZWFH5PB4KFSRV34LVHGNVHE","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":"8425b34efa67ed3f0dd6e29e88ac49f48002a41cb8405197bf29d25e868d06bc","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-07T22:13:04Z","title_canon_sha256":"0da44763d188ed36e2705c8087ca0ffa960075b108df6e5d5816537a4d77cefa"},"schema_version":"1.0","source":{"id":"1811.03167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03167","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03167v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03167","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"DUOZWFH5PB4K","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUOZWFH5PB4KFSRV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUOZWFH5","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:2d40bbf41ff01560ea989c9f0f872635f31b1e2496be523f0d4db1e47e8b78a2","target":"graph","created_at":"2026-05-18T00:01:18Z","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":"The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, whose applications include symbolic execution and automated detection of cross-site scripting (XSS) vulnerabilities. A (symbolic) path is a finite sequence of assignments and assertions (i.e. without loops), and checking its feasibility amounts to determining the existence of inputs that yield a successful execution.\n  We give two general semantic conditions which together ensure the decidability of path feasibility: (1) each assertion admits regular monad","authors_text":"Anthony W. Lin, Matthew Hague, Philipp R\\\"ummer, Taolue Chen, Zhilin Wu","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-07T22:13:04Z","title":"Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03167","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:93566364f048e7165a63151b94eabaddbb88c8448d3040d0e66c9f8299788f1c","target":"record","created_at":"2026-05-18T00:01:18Z","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":"8425b34efa67ed3f0dd6e29e88ac49f48002a41cb8405197bf29d25e868d06bc","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-07T22:13:04Z","title_canon_sha256":"0da44763d188ed36e2705c8087ca0ffa960075b108df6e5d5816537a4d77cefa"},"schema_version":"1.0","source":{"id":"1811.03167","kind":"arxiv","version":1}},"canonical_sha256":"1d1d9b14fd7878a2ca35df175399b53931a3607bc35197f12a4f5cd225afc414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1d9b14fd7878a2ca35df175399b53931a3607bc35197f12a4f5cd225afc414","first_computed_at":"2026-05-18T00:01:18.947814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:18.947814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wsr/zxdFJz+anJ3/9ROm4sB0PrT8rAz/Z5P6krk9TlapbYZ8c42cCixQnx4JCCZWHXOusp0BBynWACWyVxHBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:18.948253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93566364f048e7165a63151b94eabaddbb88c8448d3040d0e66c9f8299788f1c","sha256:2d40bbf41ff01560ea989c9f0f872635f31b1e2496be523f0d4db1e47e8b78a2"],"state_sha256":"a2949a2e7714a29199d5eb76128207ca6cecf301f9f1944af12039d87b3d7169"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OTzkhAQo5qp66KpYsxOQ5LXCkLYOlhOWfjIV/dKz3xikXRTuTXH2e+YMtPlI9lXXIjS6b26Xm7pPQrkKsakDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:04:38.203878Z","bundle_sha256":"eedd05a8d3df5185cb1cde613ff1c583b53ddd6abe8a704b59d83a7d27d16c5a"}}