{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:LCQPOWCVHKYET5GMBXDHMQ6CLH","short_pith_number":"pith:LCQPOWCV","schema_version":"1.0","canonical_sha256":"58a0f758553ab049f4cc0dc67643c259f3897340596385183ccacdd21fcf7f57","source":{"kind":"arxiv","id":"cs/0701184","version":2},"attestation_state":"computed","paper":{"title":"Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in<br> SAT-Based Planning","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Selman, Carla Gomes, Joerg Hoffmann","submitted_at":"2007-01-29T12:47:08Z","abstract_excerpt":"In Verification and in (optimal) AI Planning, a successful method is to formulate the application as boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of understanding of why this works so well. Focussing on the Planning context, we identify a form of problem structure concerned with the symmetrical or asymmetrical nature of the cost of achieving the individual planning goals. We quantify this sort of structure with a simple numeric parameter called AsymRatio, ranging between 0 and 1. We run experiments in 10 benchmark domains from the Inte"},"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":"cs/0701184","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2007-01-29T12:47:08Z","cross_cats_sorted":[],"title_canon_sha256":"d57c9379e458f2db830cb9fa5bd6ce195dbaa22a1c01a3ca873d0a070e945b70","abstract_canon_sha256":"f3afa66107673c3f8d59cef0acddb454e647b3dd5744743add0c8f253e44830b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.233209Z","signature_b64":"snlbmC2H+yxEaf8JkLm40J4aK95Jo6L0iPX5RHlSroXiFg0sxkNADsFoyD0PlsjeGhtue0rDXJwzCBkW4SEACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a0f758553ab049f4cc0dc67643c259f3897340596385183ccacdd21fcf7f57","last_reissued_at":"2026-05-18T00:53:03.232790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.232790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in<br> SAT-Based Planning","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Selman, Carla Gomes, Joerg Hoffmann","submitted_at":"2007-01-29T12:47:08Z","abstract_excerpt":"In Verification and in (optimal) AI Planning, a successful method is to formulate the application as boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of understanding of why this works so well. Focussing on the Planning context, we identify a form of problem structure concerned with the symmetrical or asymmetrical nature of the cost of achieving the individual planning goals. We quantify this sort of structure with a simple numeric parameter called AsymRatio, ranging between 0 and 1. We run experiments in 10 benchmark domains from the Inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701184","kind":"arxiv","version":2},"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":"cs/0701184","created_at":"2026-05-18T00:53:03.232853+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701184v2","created_at":"2026-05-18T00:53:03.232853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701184","created_at":"2026-05-18T00:53:03.232853+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCQPOWCVHKYE","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCQPOWCVHKYET5GM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCQPOWCV","created_at":"2026-05-18T12:25:55.427421+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/LCQPOWCVHKYET5GMBXDHMQ6CLH","json":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH.json","graph_json":"https://pith.science/api/pith-number/LCQPOWCVHKYET5GMBXDHMQ6CLH/graph.json","events_json":"https://pith.science/api/pith-number/LCQPOWCVHKYET5GMBXDHMQ6CLH/events.json","paper":"https://pith.science/paper/LCQPOWCV"},"agent_actions":{"view_html":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH","download_json":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH.json","view_paper":"https://pith.science/paper/LCQPOWCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701184&json=true","fetch_graph":"https://pith.science/api/pith-number/LCQPOWCVHKYET5GMBXDHMQ6CLH/graph.json","fetch_events":"https://pith.science/api/pith-number/LCQPOWCVHKYET5GMBXDHMQ6CLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH/action/storage_attestation","attest_author":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH/action/author_attestation","sign_citation":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH/action/citation_signature","submit_replication":"https://pith.science/pith/LCQPOWCVHKYET5GMBXDHMQ6CLH/action/replication_record"}},"created_at":"2026-05-18T00:53:03.232853+00:00","updated_at":"2026-05-18T00:53:03.232853+00:00"}