{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NLKYRHYYFLQ6KCGB52OS5CIXUO","short_pith_number":"pith:NLKYRHYY","schema_version":"1.0","canonical_sha256":"6ad5889f182ae1e508c1ee9d2e8917a38578524003dfbdcbfb942636232a19ab","source":{"kind":"arxiv","id":"1608.00730","version":1},"attestation_state":"computed","paper":{"title":"Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems (Application Paper)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Benjamin Musitsch, Carmine Dodaro, Francesco Ricca, Kostyantyn Shchekotykhin, Nicola Leone, Philip Gasteiger","submitted_at":"2016-08-02T08:36:08Z","abstract_excerpt":"Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf"},"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":"1608.00730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-02T08:36:08Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"8d4bf9eb7fb1433fd5b31a8ef0906b4989b6f66ef948189481cbc379ddbddbf9","abstract_canon_sha256":"52a7855d93c9a05b8d582683cc57cce0677d55103f1e2d6533ecedca9b3bf84d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:01.211479Z","signature_b64":"dXSoMvli8yzLDbhQBa2zwA2ce+CikBtdMjGQSyGA7UiyEmo5rS4fDhjyHH80ZWyJhk/0DbIEEw6DyAMhzPGCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad5889f182ae1e508c1ee9d2e8917a38578524003dfbdcbfb942636232a19ab","last_reissued_at":"2026-05-18T01:10:01.210703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:01.210703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems (Application Paper)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Benjamin Musitsch, Carmine Dodaro, Francesco Ricca, Kostyantyn Shchekotykhin, Nicola Leone, Philip Gasteiger","submitted_at":"2016-08-02T08:36:08Z","abstract_excerpt":"Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00730","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":"1608.00730","created_at":"2026-05-18T01:10:01.210817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00730v1","created_at":"2026-05-18T01:10:01.210817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00730","created_at":"2026-05-18T01:10:01.210817+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLKYRHYYFLQ6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLKYRHYYFLQ6KCGB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLKYRHYY","created_at":"2026-05-18T12:30:32.724797+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/NLKYRHYYFLQ6KCGB52OS5CIXUO","json":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO.json","graph_json":"https://pith.science/api/pith-number/NLKYRHYYFLQ6KCGB52OS5CIXUO/graph.json","events_json":"https://pith.science/api/pith-number/NLKYRHYYFLQ6KCGB52OS5CIXUO/events.json","paper":"https://pith.science/paper/NLKYRHYY"},"agent_actions":{"view_html":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO","download_json":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO.json","view_paper":"https://pith.science/paper/NLKYRHYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00730&json=true","fetch_graph":"https://pith.science/api/pith-number/NLKYRHYYFLQ6KCGB52OS5CIXUO/graph.json","fetch_events":"https://pith.science/api/pith-number/NLKYRHYYFLQ6KCGB52OS5CIXUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO/action/storage_attestation","attest_author":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO/action/author_attestation","sign_citation":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO/action/citation_signature","submit_replication":"https://pith.science/pith/NLKYRHYYFLQ6KCGB52OS5CIXUO/action/replication_record"}},"created_at":"2026-05-18T01:10:01.210817+00:00","updated_at":"2026-05-18T01:10:01.210817+00:00"}