{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FRTBCSQDSFLOUWPLJZOBASTZI5","short_pith_number":"pith:FRTBCSQD","schema_version":"1.0","canonical_sha256":"2c66114a039156ea59eb4e5c104a79477b91d88b1b7f5b9001b0e26504fdd320","source":{"kind":"arxiv","id":"1108.3260","version":1},"attestation_state":"computed","paper":{"title":"Finding Similar/Diverse Solutions in Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Esra Erdem, Halit Erdogan, Michael Fink, Thomas Eiter","submitted_at":"2011-08-16T14:59:44Z","abstract_excerpt":"For some computational problems (e.g., product configuration, planning, diagnosis, query answering, phylogeny reconstruction) computing a set of similar/diverse solutions may be desirable for better decision-making. With this motivation, we studied several decision/optimization versions of this problem in the context of Answer Set Programming (ASP), analyzed their computational complexity, and introduced offline/online methods to compute similar/diverse solutions of such computational problems with respect to a given distance function. All these methods rely on the idea of computing solutions "},"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":"1108.3260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-16T14:59:44Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"c09b656d3f1c3f85a72e4f49a684b2336a41a12ea0dbaf6cd148adb6dd88e24a","abstract_canon_sha256":"22a6c58d3d069c07b6006a4d9bcb2b72b39928e093b119651b4ed9150c2a8861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:00.598078Z","signature_b64":"+0QrD8VtOE5TZyqf/Y+Osbg7m3GFMI1/5QZuMVP8V1kfnvF5P++eeAIE5he8FAfeHT8jNfpugaSHM9ZA+otmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c66114a039156ea59eb4e5c104a79477b91d88b1b7f5b9001b0e26504fdd320","last_reissued_at":"2026-05-18T03:13:00.597524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:00.597524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Similar/Diverse Solutions in Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Esra Erdem, Halit Erdogan, Michael Fink, Thomas Eiter","submitted_at":"2011-08-16T14:59:44Z","abstract_excerpt":"For some computational problems (e.g., product configuration, planning, diagnosis, query answering, phylogeny reconstruction) computing a set of similar/diverse solutions may be desirable for better decision-making. With this motivation, we studied several decision/optimization versions of this problem in the context of Answer Set Programming (ASP), analyzed their computational complexity, and introduced offline/online methods to compute similar/diverse solutions of such computational problems with respect to a given distance function. All these methods rely on the idea of computing solutions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3260","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":"1108.3260","created_at":"2026-05-18T03:13:00.597608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3260v1","created_at":"2026-05-18T03:13:00.597608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3260","created_at":"2026-05-18T03:13:00.597608+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRTBCSQDSFLO","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRTBCSQDSFLOUWPL","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRTBCSQD","created_at":"2026-05-18T12:26:28.662955+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/FRTBCSQDSFLOUWPLJZOBASTZI5","json":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5.json","graph_json":"https://pith.science/api/pith-number/FRTBCSQDSFLOUWPLJZOBASTZI5/graph.json","events_json":"https://pith.science/api/pith-number/FRTBCSQDSFLOUWPLJZOBASTZI5/events.json","paper":"https://pith.science/paper/FRTBCSQD"},"agent_actions":{"view_html":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5","download_json":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5.json","view_paper":"https://pith.science/paper/FRTBCSQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3260&json=true","fetch_graph":"https://pith.science/api/pith-number/FRTBCSQDSFLOUWPLJZOBASTZI5/graph.json","fetch_events":"https://pith.science/api/pith-number/FRTBCSQDSFLOUWPLJZOBASTZI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5/action/storage_attestation","attest_author":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5/action/author_attestation","sign_citation":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5/action/citation_signature","submit_replication":"https://pith.science/pith/FRTBCSQDSFLOUWPLJZOBASTZI5/action/replication_record"}},"created_at":"2026-05-18T03:13:00.597608+00:00","updated_at":"2026-05-18T03:13:00.597608+00:00"}