{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QERFTZGSXYSNVBWSS7BBOGS3S5","short_pith_number":"pith:QERFTZGS","schema_version":"1.0","canonical_sha256":"812259e4d2be24da86d297c2171a5b9741c92d458104a425d8a4449e716aeb45","source":{"kind":"arxiv","id":"1804.01710","version":1},"attestation_state":"computed","paper":{"title":"Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Caterina Viola, Manuel Bodirsky, Marcello Mamino","submitted_at":"2018-04-05T07:49:13Z","abstract_excerpt":"Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs depending on a fixed set of allowed cost functions in the input. Recently, the computational complexity of all VCSPs for finite sets of cost functions over finite domains has been classified in this sense. Many natural optimisation problems, however, cannot be formulated as VCSPs over a finite domain. We initiate the systematic investigation of infinite-domain VCSPs by studying the complexity of VCSPs for piecewise linear ho"},"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":"1804.01710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-04-05T07:49:13Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"928b30cd2e7bffe104f216b4c61ae90f03fbfe5533820f769164f2edaafcfd53","abstract_canon_sha256":"4ad21790ab9a0a945cfcce678662e64ccaa1c2fa696a67f86eef88b28a02a8b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.231607Z","signature_b64":"BZ6EXyoyQ/MdPXxjqZSM3NEJSZSL/HEDp2Ydm0wZxxT6nxZZDW1OPKiTuxpf9CuGYA2L5aMG3BnL+9chMe8RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812259e4d2be24da86d297c2171a5b9741c92d458104a425d8a4449e716aeb45","last_reissued_at":"2026-05-18T00:19:10.231066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.231066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Caterina Viola, Manuel Bodirsky, Marcello Mamino","submitted_at":"2018-04-05T07:49:13Z","abstract_excerpt":"Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs depending on a fixed set of allowed cost functions in the input. Recently, the computational complexity of all VCSPs for finite sets of cost functions over finite domains has been classified in this sense. Many natural optimisation problems, however, cannot be formulated as VCSPs over a finite domain. We initiate the systematic investigation of infinite-domain VCSPs by studying the complexity of VCSPs for piecewise linear ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01710","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.01710","created_at":"2026-05-18T00:19:10.231151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01710v1","created_at":"2026-05-18T00:19:10.231151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01710","created_at":"2026-05-18T00:19:10.231151+00:00"},{"alias_kind":"pith_short_12","alias_value":"QERFTZGSXYSN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QERFTZGSXYSNVBWS","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QERFTZGS","created_at":"2026-05-18T12:32:46.962924+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/QERFTZGSXYSNVBWSS7BBOGS3S5","json":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5.json","graph_json":"https://pith.science/api/pith-number/QERFTZGSXYSNVBWSS7BBOGS3S5/graph.json","events_json":"https://pith.science/api/pith-number/QERFTZGSXYSNVBWSS7BBOGS3S5/events.json","paper":"https://pith.science/paper/QERFTZGS"},"agent_actions":{"view_html":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5","download_json":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5.json","view_paper":"https://pith.science/paper/QERFTZGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01710&json=true","fetch_graph":"https://pith.science/api/pith-number/QERFTZGSXYSNVBWSS7BBOGS3S5/graph.json","fetch_events":"https://pith.science/api/pith-number/QERFTZGSXYSNVBWSS7BBOGS3S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5/action/storage_attestation","attest_author":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5/action/author_attestation","sign_citation":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5/action/citation_signature","submit_replication":"https://pith.science/pith/QERFTZGSXYSNVBWSS7BBOGS3S5/action/replication_record"}},"created_at":"2026-05-18T00:19:10.231151+00:00","updated_at":"2026-05-18T00:19:10.231151+00:00"}