{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HLKNDHSXB5T5IAAJKC2YFMALCD","short_pith_number":"pith:HLKNDHSX","canonical_record":{"source":{"id":"1607.06658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T12:53:37Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"a4b982e56038bf09571620c0ed3c536e5ded88e4183286397abbe79425bda84e","abstract_canon_sha256":"b45c09b0996b040e79cc906018b3bc309c31643f92c4a243498ff806130080e5"},"schema_version":"1.0"},"canonical_sha256":"3ad4d19e570f67d4000950b582b00b10f96ef917be7149aaaea7c86b8b72494e","source":{"kind":"arxiv","id":"1607.06658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06658","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06658v1","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06658","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"HLKNDHSXB5T5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HLKNDHSXB5T5IAAJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HLKNDHSX","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HLKNDHSXB5T5IAAJKC2YFMALCD","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T12:53:37Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"a4b982e56038bf09571620c0ed3c536e5ded88e4183286397abbe79425bda84e","abstract_canon_sha256":"b45c09b0996b040e79cc906018b3bc309c31643f92c4a243498ff806130080e5"},"schema_version":"1.0"},"canonical_sha256":"3ad4d19e570f67d4000950b582b00b10f96ef917be7149aaaea7c86b8b72494e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.350647Z","signature_b64":"9GwmPmLfiD7k7uTwvMB+oJCD8jJs6nc6kQq4medGKqDsn754j1FlzU2HZ+RM+5ffp6zUe7zPZTVesgSMrQVJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ad4d19e570f67d4000950b582b00b10f96ef917be7149aaaea7c86b8b72494e","last_reissued_at":"2026-05-18T01:10:39.350229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.350229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06658","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-18T01:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XF4FKQYZ+yMjD/WSOL/QwnbyC+10YymW+8Wq8RrLgtgdfBmm1lXtLWKGSv7BU/cDQGolfEQ3csog55fmuk3+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:47:19.229364Z"},"content_sha256":"bce43124607b201019352591612cb9f178e8c722ea8960058f65cecfff13fdf5","schema_version":"1.0","event_id":"sha256:bce43124607b201019352591612cb9f178e8c722ea8960058f65cecfff13fdf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HLKNDHSXB5T5IAAJKC2YFMALCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cloud Service Matchmaking using Constraint Programming","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DC","authors_text":"Axel K\\\"upper, Beg\\\"um \\.Ilke Zilci, Mathias Slawik","submitted_at":"2016-07-22T12:53:37Z","abstract_excerpt":"Service requesters with limited technical knowledge should be able to compare services based on their quality of service (QoS) requirements in cloud service marketplaces. Existing service matching approaches focus on QoS requirements as discrete numeric values and intervals. The analysis of existing research on non-functional properties reveals two improvement opportunities: list-typed QoS properties as well as explicit handling of preferences for lower or higher property values. We develop a concept and constraint models for a service matcher which contributes to existing approaches by addres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06658","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-18T01:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhL+W1aJzBuyrJ77JiwL1DuPjZgPUufQ2ugqckOVYoqqZg1YmTRta06Cb0+tuYiA5sxosZgEvPoQ+WySwvzBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:47:19.229721Z"},"content_sha256":"5cf25a77c53c73a88d56de4ae7fc56724ab27efd681111ba13092cd126d0dd94","schema_version":"1.0","event_id":"sha256:5cf25a77c53c73a88d56de4ae7fc56724ab27efd681111ba13092cd126d0dd94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/bundle.json","state_url":"https://pith.science/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/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-06-24T13:47:19Z","links":{"resolver":"https://pith.science/pith/HLKNDHSXB5T5IAAJKC2YFMALCD","bundle":"https://pith.science/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/bundle.json","state":"https://pith.science/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLKNDHSXB5T5IAAJKC2YFMALCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HLKNDHSXB5T5IAAJKC2YFMALCD","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":"b45c09b0996b040e79cc906018b3bc309c31643f92c4a243498ff806130080e5","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T12:53:37Z","title_canon_sha256":"a4b982e56038bf09571620c0ed3c536e5ded88e4183286397abbe79425bda84e"},"schema_version":"1.0","source":{"id":"1607.06658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06658","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06658v1","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06658","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"HLKNDHSXB5T5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HLKNDHSXB5T5IAAJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HLKNDHSX","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:5cf25a77c53c73a88d56de4ae7fc56724ab27efd681111ba13092cd126d0dd94","target":"graph","created_at":"2026-05-18T01:10:39Z","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":"Service requesters with limited technical knowledge should be able to compare services based on their quality of service (QoS) requirements in cloud service marketplaces. Existing service matching approaches focus on QoS requirements as discrete numeric values and intervals. The analysis of existing research on non-functional properties reveals two improvement opportunities: list-typed QoS properties as well as explicit handling of preferences for lower or higher property values. We develop a concept and constraint models for a service matcher which contributes to existing approaches by addres","authors_text":"Axel K\\\"upper, Beg\\\"um \\.Ilke Zilci, Mathias Slawik","cross_cats":["cs.SE"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T12:53:37Z","title":"Cloud Service Matchmaking using Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06658","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:bce43124607b201019352591612cb9f178e8c722ea8960058f65cecfff13fdf5","target":"record","created_at":"2026-05-18T01:10:39Z","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":"b45c09b0996b040e79cc906018b3bc309c31643f92c4a243498ff806130080e5","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T12:53:37Z","title_canon_sha256":"a4b982e56038bf09571620c0ed3c536e5ded88e4183286397abbe79425bda84e"},"schema_version":"1.0","source":{"id":"1607.06658","kind":"arxiv","version":1}},"canonical_sha256":"3ad4d19e570f67d4000950b582b00b10f96ef917be7149aaaea7c86b8b72494e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ad4d19e570f67d4000950b582b00b10f96ef917be7149aaaea7c86b8b72494e","first_computed_at":"2026-05-18T01:10:39.350229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:39.350229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9GwmPmLfiD7k7uTwvMB+oJCD8jJs6nc6kQq4medGKqDsn754j1FlzU2HZ+RM+5ffp6zUe7zPZTVesgSMrQVJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:39.350647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bce43124607b201019352591612cb9f178e8c722ea8960058f65cecfff13fdf5","sha256:5cf25a77c53c73a88d56de4ae7fc56724ab27efd681111ba13092cd126d0dd94"],"state_sha256":"890345a043b3dbea2f608f347cdab6f814a5a5cacddd71f961fba2e51a6c363d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tus+i/QT0uuHqcYurru179wPxnGuqYK1sybRx9pzmYHihY1zEB3tYtm+AXBPEOagJZ3V37JG3UUl3Qw2v3QvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:47:19.231811Z","bundle_sha256":"1f44bcdc0c4673a6a5648d8475264605c72dfa0d1fecd51f23088ed4b9310b41"}}