{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:GCQWHWDQ3GL5C5JSVBWVMI7ODH","short_pith_number":"pith:GCQWHWDQ","canonical_record":{"source":{"id":"cs/0208008","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2002-08-06T19:08:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5dba7fcb459eab1235d6f08f329be9b410035d988602b4de19367fd2f507b5d5","abstract_canon_sha256":"cbc62c310c7daddc6bb306c764f9162b0bf642d5de6717f59334bad06fbb93fc"},"schema_version":"1.0"},"canonical_sha256":"30a163d870d997d17532a86d5623ee19caa0a671ed3e7180eec4aec37261ad05","source":{"kind":"arxiv","id":"cs/0208008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0208008","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0208008v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0208008","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"GCQWHWDQ3GL5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GCQWHWDQ3GL5C5JS","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GCQWHWDQ","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:GCQWHWDQ3GL5C5JSVBWVMI7ODH","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0208008","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2002-08-06T19:08:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5dba7fcb459eab1235d6f08f329be9b410035d988602b4de19367fd2f507b5d5","abstract_canon_sha256":"cbc62c310c7daddc6bb306c764f9162b0bf642d5de6717f59334bad06fbb93fc"},"schema_version":"1.0"},"canonical_sha256":"30a163d870d997d17532a86d5623ee19caa0a671ed3e7180eec4aec37261ad05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.556064Z","signature_b64":"mvy7UqbieFczdUrZ6jL3exkQGftWRj819tHOlVp2ksFNpNH3Yhx7PqQFE9ObaM5aU12+/YPtL6cfNnUg/lwBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a163d870d997d17532a86d5623ee19caa0a671ed3e7180eec4aec37261ad05","last_reissued_at":"2026-05-18T00:22:33.555555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.555555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0208008","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:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgNyXH8rv924idJecSD74zQeCY/NiU1x8PnOR60f6nqVxZtlJfSWclQ6HLoAt0+Re+vpYI30k/iBcWGLfoOHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:04:25.996501Z"},"content_sha256":"abe1df0038aad3ff2b2dc097dc24b44863921425faa352316ef44909cf726a6d","schema_version":"1.0","event_id":"sha256:abe1df0038aad3ff2b2dc097dc24b44863921425faa352316ef44909cf726a6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:GCQWHWDQ3GL5C5JSVBWVMI7ODH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Soft Concurrent Constraint Programming","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"(2) Dipartimento di Informatica, (3) Dipartimento di Matematica Pura ed Applicata, C.N.R., F. Rossi (3) ((1) Istituto di Informatica e Telematica, Italy, Italy), Pisa, S. Bistarelli (1), U. Montanari (2), Universita di Padova, Universita di Pisa","submitted_at":"2002-08-06T19:08:55Z","abstract_excerpt":"Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this paper we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0208008","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:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XliN0oxXql8/cbYvqw1SRvnBdrGind0C0V/uNjUwftsd3SfvVm0M+xz2e3RirylKYjJrEkSWLXqpoTCIAXE0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:04:25.996853Z"},"content_sha256":"1a4ab97f7f4d56d14c2d368a89a3064328c8360836931768a065fba80da2a09b","schema_version":"1.0","event_id":"sha256:1a4ab97f7f4d56d14c2d368a89a3064328c8360836931768a065fba80da2a09b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/bundle.json","state_url":"https://pith.science/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/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-12T10:04:25Z","links":{"resolver":"https://pith.science/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH","bundle":"https://pith.science/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/bundle.json","state":"https://pith.science/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCQWHWDQ3GL5C5JSVBWVMI7ODH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:GCQWHWDQ3GL5C5JSVBWVMI7ODH","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":"cbc62c310c7daddc6bb306c764f9162b0bf642d5de6717f59334bad06fbb93fc","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.PL","submitted_at":"2002-08-06T19:08:55Z","title_canon_sha256":"5dba7fcb459eab1235d6f08f329be9b410035d988602b4de19367fd2f507b5d5"},"schema_version":"1.0","source":{"id":"cs/0208008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0208008","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0208008v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0208008","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"GCQWHWDQ3GL5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GCQWHWDQ3GL5C5JS","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GCQWHWDQ","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:1a4ab97f7f4d56d14c2d368a89a3064328c8360836931768a065fba80da2a09b","target":"graph","created_at":"2026-05-18T00:22:33Z","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":"Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this paper we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believ","authors_text":"(2) Dipartimento di Informatica, (3) Dipartimento di Matematica Pura ed Applicata, C.N.R., F. Rossi (3) ((1) Istituto di Informatica e Telematica, Italy, Italy), Pisa, S. Bistarelli (1), U. Montanari (2), Universita di Padova, Universita di Pisa","cross_cats":["cs.AI"],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2002-08-06T19:08:55Z","title":"Soft Concurrent Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0208008","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:abe1df0038aad3ff2b2dc097dc24b44863921425faa352316ef44909cf726a6d","target":"record","created_at":"2026-05-18T00:22:33Z","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":"cbc62c310c7daddc6bb306c764f9162b0bf642d5de6717f59334bad06fbb93fc","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.PL","submitted_at":"2002-08-06T19:08:55Z","title_canon_sha256":"5dba7fcb459eab1235d6f08f329be9b410035d988602b4de19367fd2f507b5d5"},"schema_version":"1.0","source":{"id":"cs/0208008","kind":"arxiv","version":1}},"canonical_sha256":"30a163d870d997d17532a86d5623ee19caa0a671ed3e7180eec4aec37261ad05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a163d870d997d17532a86d5623ee19caa0a671ed3e7180eec4aec37261ad05","first_computed_at":"2026-05-18T00:22:33.555555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:33.555555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvy7UqbieFczdUrZ6jL3exkQGftWRj819tHOlVp2ksFNpNH3Yhx7PqQFE9ObaM5aU12+/YPtL6cfNnUg/lwBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:33.556064Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0208008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abe1df0038aad3ff2b2dc097dc24b44863921425faa352316ef44909cf726a6d","sha256:1a4ab97f7f4d56d14c2d368a89a3064328c8360836931768a065fba80da2a09b"],"state_sha256":"531575f1cf6667a76b30f76333aa9993dbc3e59605862529d7ed45666939fb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poONhOpUkGuauN2MhUPVQZn3rW5aA4eJMM8Rca+J+Z5W61mYzqCINLNohQ2cTCVqYYtIGgF4E/8K8+W6CKW9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:04:25.998820Z","bundle_sha256":"fb36c6f7898bcf64bb568847b8ac1da15b0d70023371a4fbb1e049ac4f503551"}}