{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IB45KI6NKDT6JIDQH37WFDJPX6","short_pith_number":"pith:IB45KI6N","schema_version":"1.0","canonical_sha256":"4079d523cd50e7e4a0703eff628d2fbf82dc23ec7621100b028f4b8cd41f47a6","source":{"kind":"arxiv","id":"2103.06741","version":1},"attestation_state":"computed","paper":{"title":"Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fabio Gadducci, Francesco Santini","submitted_at":"2021-03-11T15:39:48Z","abstract_excerpt":"Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key requirement is the presence of an aggregator operator for combining preferences. Given a residuated monoid of preferences, the paper first shows how to build a new residuated monoid of (possibly infinite) tuples, which is based on the lexicographic order. Second, it introduces a variant of an approximation technique (known as Mini-bucket) that exploits the presence o"},"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":"2103.06741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-03-11T15:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"71ac993afb208b35769c3210b2af73d1228222e3230b141beb94d806bb0ddbde","abstract_canon_sha256":"024a6541fbf7d4d59146a84b7c206b02d6fc1fdc69baffa50fd61552229aa967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:18.831712Z","signature_b64":"rra0HWN4tUwTOlAzxg62PRY4Z0Dg20OiHXurChxpsKzl0JIli3RB7K8p4rRryP2FCGiA40IvZf3mBxHa7RN1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4079d523cd50e7e4a0703eff628d2fbf82dc23ec7621100b028f4b8cd41f47a6","last_reissued_at":"2026-07-05T02:22:18.831275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:18.831275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fabio Gadducci, Francesco Santini","submitted_at":"2021-03-11T15:39:48Z","abstract_excerpt":"Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key requirement is the presence of an aggregator operator for combining preferences. Given a residuated monoid of preferences, the paper first shows how to build a new residuated monoid of (possibly infinite) tuples, which is based on the lexicographic order. Second, it introduces a variant of an approximation technique (known as Mini-bucket) that exploits the presence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.06741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.06741","created_at":"2026-07-05T02:22:18.831344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.06741v1","created_at":"2026-07-05T02:22:18.831344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06741","created_at":"2026-07-05T02:22:18.831344+00:00"},{"alias_kind":"pith_short_12","alias_value":"IB45KI6NKDT6","created_at":"2026-07-05T02:22:18.831344+00:00"},{"alias_kind":"pith_short_16","alias_value":"IB45KI6NKDT6JIDQ","created_at":"2026-07-05T02:22:18.831344+00:00"},{"alias_kind":"pith_short_8","alias_value":"IB45KI6N","created_at":"2026-07-05T02:22:18.831344+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/IB45KI6NKDT6JIDQH37WFDJPX6","json":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6.json","graph_json":"https://pith.science/api/pith-number/IB45KI6NKDT6JIDQH37WFDJPX6/graph.json","events_json":"https://pith.science/api/pith-number/IB45KI6NKDT6JIDQH37WFDJPX6/events.json","paper":"https://pith.science/paper/IB45KI6N"},"agent_actions":{"view_html":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6","download_json":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6.json","view_paper":"https://pith.science/paper/IB45KI6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.06741&json=true","fetch_graph":"https://pith.science/api/pith-number/IB45KI6NKDT6JIDQH37WFDJPX6/graph.json","fetch_events":"https://pith.science/api/pith-number/IB45KI6NKDT6JIDQH37WFDJPX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6/action/storage_attestation","attest_author":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6/action/author_attestation","sign_citation":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6/action/citation_signature","submit_replication":"https://pith.science/pith/IB45KI6NKDT6JIDQH37WFDJPX6/action/replication_record"}},"created_at":"2026-07-05T02:22:18.831344+00:00","updated_at":"2026-07-05T02:22:18.831344+00:00"}