{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6W7CSTCW2SHSYTFYP6LR3YOLXJ","short_pith_number":"pith:6W7CSTCW","canonical_record":{"source":{"id":"1608.08799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-08-31T10:30:39Z","cross_cats_sorted":[],"title_canon_sha256":"e365d61cecf0a4abb2f0ecca4826256ad2f5e9975ee0a7a844c6a3e015890935","abstract_canon_sha256":"ff6ed90121e71a0756e799838fa7c91cf188e5ffffaeb8578cbd2578f9704377"},"schema_version":"1.0"},"canonical_sha256":"f5be294c56d48f2c4cb87f971de1cbba41595f0ab3752198bf4b232d64a5d77a","source":{"kind":"arxiv","id":"1608.08799","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08799","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08799v2","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08799","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"6W7CSTCW2SHS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6W7CSTCW2SHSYTFY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6W7CSTCW","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6W7CSTCW2SHSYTFYP6LR3YOLXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-08-31T10:30:39Z","cross_cats_sorted":[],"title_canon_sha256":"e365d61cecf0a4abb2f0ecca4826256ad2f5e9975ee0a7a844c6a3e015890935","abstract_canon_sha256":"ff6ed90121e71a0756e799838fa7c91cf188e5ffffaeb8578cbd2578f9704377"},"schema_version":"1.0"},"canonical_sha256":"f5be294c56d48f2c4cb87f971de1cbba41595f0ab3752198bf4b232d64a5d77a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.557122Z","signature_b64":"ljYiR1YKPh5KkqO+QlZ0bCOr4Cx/slrLZdfWJC0aN3snEG13m4IVgKBnaZDEYjN3ByK8Lhy3fGXo6AiIioTYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5be294c56d48f2c4cb87f971de1cbba41595f0ab3752198bf4b232d64a5d77a","last_reissued_at":"2026-05-18T00:12:11.556570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.556570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08799","source_version":2,"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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TQ+Ku6U9o9cUs9FSGST3+Dbgv87CiTQyRGjzKpbegkuCxj81r9oXDgYQIllgQRKDO1THpr3U6MGugtw8rHoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:38:46.881405Z"},"content_sha256":"ce7f30ac67afc5d03ebead58ff0901ca4f09240df9199c9190f098f6445dbf56","schema_version":"1.0","event_id":"sha256:ce7f30ac67afc5d03ebead58ff0901ca4f09240df9199c9190f098f6445dbf56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6W7CSTCW2SHSYTFYP6LR3YOLXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QoS constrained Large Scale Web Service Composition using Abstraction Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ansuman Banerjee, Soumi Chattopadhyay","submitted_at":"2016-08-31T10:30:39Z","abstract_excerpt":"Efficient service composition in real time while providing necessary Quality of Service (QoS) guarantees has been a challenging research problem with ever growing complexity. Several heuristic based approaches with diverse proposals for taming the scale and complexity of web service composition, have been proposed in literature. In this paper, we present a new approach for efficient service composition based on abstraction refinement. Instead of considering individual services during composition, we propose several abstractions to form service groups and the composition is done on these abstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08799","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"},"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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zHiLeETKT25HHOWo2zaN67uCQdVhokzo06spNBbh6VZaHFA7AdU7J1yEvaPKELIOVAe/BzO+dvv+pSx1TBwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:38:46.882050Z"},"content_sha256":"9b13e766e83d85b20795e559b6327249d4c2e1a9f0008f25f95b78a486f9f0a5","schema_version":"1.0","event_id":"sha256:9b13e766e83d85b20795e559b6327249d4c2e1a9f0008f25f95b78a486f9f0a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/bundle.json","state_url":"https://pith.science/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/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-26T02:38:46Z","links":{"resolver":"https://pith.science/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ","bundle":"https://pith.science/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/bundle.json","state":"https://pith.science/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W7CSTCW2SHSYTFYP6LR3YOLXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6W7CSTCW2SHSYTFYP6LR3YOLXJ","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":"ff6ed90121e71a0756e799838fa7c91cf188e5ffffaeb8578cbd2578f9704377","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-08-31T10:30:39Z","title_canon_sha256":"e365d61cecf0a4abb2f0ecca4826256ad2f5e9975ee0a7a844c6a3e015890935"},"schema_version":"1.0","source":{"id":"1608.08799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08799","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08799v2","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08799","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"6W7CSTCW2SHS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6W7CSTCW2SHSYTFY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6W7CSTCW","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:9b13e766e83d85b20795e559b6327249d4c2e1a9f0008f25f95b78a486f9f0a5","target":"graph","created_at":"2026-05-18T00:12:11Z","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":"Efficient service composition in real time while providing necessary Quality of Service (QoS) guarantees has been a challenging research problem with ever growing complexity. Several heuristic based approaches with diverse proposals for taming the scale and complexity of web service composition, have been proposed in literature. In this paper, we present a new approach for efficient service composition based on abstraction refinement. Instead of considering individual services during composition, we propose several abstractions to form service groups and the composition is done on these abstra","authors_text":"Ansuman Banerjee, Soumi Chattopadhyay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-08-31T10:30:39Z","title":"QoS constrained Large Scale Web Service Composition using Abstraction Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08799","kind":"arxiv","version":2},"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:ce7f30ac67afc5d03ebead58ff0901ca4f09240df9199c9190f098f6445dbf56","target":"record","created_at":"2026-05-18T00:12:11Z","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":"ff6ed90121e71a0756e799838fa7c91cf188e5ffffaeb8578cbd2578f9704377","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-08-31T10:30:39Z","title_canon_sha256":"e365d61cecf0a4abb2f0ecca4826256ad2f5e9975ee0a7a844c6a3e015890935"},"schema_version":"1.0","source":{"id":"1608.08799","kind":"arxiv","version":2}},"canonical_sha256":"f5be294c56d48f2c4cb87f971de1cbba41595f0ab3752198bf4b232d64a5d77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5be294c56d48f2c4cb87f971de1cbba41595f0ab3752198bf4b232d64a5d77a","first_computed_at":"2026-05-18T00:12:11.556570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:11.556570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ljYiR1YKPh5KkqO+QlZ0bCOr4Cx/slrLZdfWJC0aN3snEG13m4IVgKBnaZDEYjN3ByK8Lhy3fGXo6AiIioTYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:11.557122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce7f30ac67afc5d03ebead58ff0901ca4f09240df9199c9190f098f6445dbf56","sha256:9b13e766e83d85b20795e559b6327249d4c2e1a9f0008f25f95b78a486f9f0a5"],"state_sha256":"291baad497cf42414578a3098eb0ac04e467cf20699d3d47f88237e7ede0e649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBkYjI3NfhSr6Ek6Ail6yXmd0fSQDydHNgGSd8PivgLa7lQ/pJKn7odziu+eR7ZzMw4qjU/IIeWzKQZir9avBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:38:46.885573Z","bundle_sha256":"0fc1f68cedd719cebb3c7bf2be8872e480ccbc53c8109b4dff3dc7c0a57a9077"}}