{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:3VONJSA5HSXY55DMHVHPFJRDDZ","short_pith_number":"pith:3VONJSA5","schema_version":"1.0","canonical_sha256":"dd5cd4c81d3caf8ef46c3d4ef2a6231e7fb12c702e2d58ae88cbda739e4e6152","source":{"kind":"arxiv","id":"0804.3105","version":2},"attestation_state":"computed","paper":{"title":"A lower bound on web services composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anca Muscholl, Igor Walukiewicz","submitted_at":"2008-04-18T21:15:47Z","abstract_excerpt":"A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper bound. Our result also applies to richer models of web services, such as the Roman model."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0804.3105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-04-18T21:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"837868a476a80135deeeae821ffa51215b22233efd2e19e195884fc817f11562","abstract_canon_sha256":"5a7577ff576c2fd893317c41d5baeaac05a102377608188f94f136625d5fda88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.474368Z","signature_b64":"J9O5i6/rMeUrgBY8Mtsgx0bpl1gKJlttBf99YaXw1sVn+fvfM6Q+ltHVkTfugnVXe3xha/MAVFA5h8sfNnqeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd5cd4c81d3caf8ef46c3d4ef2a6231e7fb12c702e2d58ae88cbda739e4e6152","last_reissued_at":"2026-05-18T01:37:42.473800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.473800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on web services composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anca Muscholl, Igor Walukiewicz","submitted_at":"2008-04-18T21:15:47Z","abstract_excerpt":"A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper bound. Our result also applies to richer models of web services, such as the Roman model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.3105","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0804.3105","created_at":"2026-05-18T01:37:42.473894+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.3105v2","created_at":"2026-05-18T01:37:42.473894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.3105","created_at":"2026-05-18T01:37:42.473894+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VONJSA5HSXY","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VONJSA5HSXY55DM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VONJSA5","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ","json":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ.json","graph_json":"https://pith.science/api/pith-number/3VONJSA5HSXY55DMHVHPFJRDDZ/graph.json","events_json":"https://pith.science/api/pith-number/3VONJSA5HSXY55DMHVHPFJRDDZ/events.json","paper":"https://pith.science/paper/3VONJSA5"},"agent_actions":{"view_html":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ","download_json":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ.json","view_paper":"https://pith.science/paper/3VONJSA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.3105&json=true","fetch_graph":"https://pith.science/api/pith-number/3VONJSA5HSXY55DMHVHPFJRDDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VONJSA5HSXY55DMHVHPFJRDDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ/action/storage_attestation","attest_author":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ/action/author_attestation","sign_citation":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ/action/citation_signature","submit_replication":"https://pith.science/pith/3VONJSA5HSXY55DMHVHPFJRDDZ/action/replication_record"}},"created_at":"2026-05-18T01:37:42.473894+00:00","updated_at":"2026-05-18T01:37:42.473894+00:00"}