{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QAUTEZQOPC3A5REMHP22VEEVZK","short_pith_number":"pith:QAUTEZQO","schema_version":"1.0","canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","source":{"kind":"arxiv","id":"1711.05216","version":1},"attestation_state":"computed","paper":{"title":"Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francesco Scarcello, Georg Gottlob, Gianlugi Greco","submitted_at":"2017-11-14T17:30:08Z","abstract_excerpt":"Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views, whose solutions are either already available or can be computed efficiently. The goal is to arrange portions of these views in a tree-like structure, called tree projection, which determines an efficiently solvable CSP instance equivalent to the original one. Deciding whether a tree projection exists is NP-hard. Solution methods have therefore been proposed in"},"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":"1711.05216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-14T17:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"02c360e88c42f6203886446171e5cec390aa49be080ce8d5040208568892fe98","abstract_canon_sha256":"4378786aab9bd6513ee9f90e2f0408377770a53ded7da211171c35c9fefae9ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.484818Z","signature_b64":"DR1lZEQZwWjMe3lkkWrRIOUDPJvqysEISQxvMWW75hEElICYlwL8+zY3glUeRU9mzryz/rV/2eSZ8e8QdKAVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","last_reissued_at":"2026-05-18T00:30:34.484217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.484217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francesco Scarcello, Georg Gottlob, Gianlugi Greco","submitted_at":"2017-11-14T17:30:08Z","abstract_excerpt":"Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views, whose solutions are either already available or can be computed efficiently. The goal is to arrange portions of these views in a tree-like structure, called tree projection, which determines an efficiently solvable CSP instance equivalent to the original one. Deciding whether a tree projection exists is NP-hard. Solution methods have therefore been proposed in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05216","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":"1711.05216","created_at":"2026-05-18T00:30:34.484300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05216v1","created_at":"2026-05-18T00:30:34.484300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05216","created_at":"2026-05-18T00:30:34.484300+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAUTEZQOPC3A","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAUTEZQOPC3A5REM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAUTEZQO","created_at":"2026-05-18T12:31:37.085036+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/QAUTEZQOPC3A5REMHP22VEEVZK","json":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK.json","graph_json":"https://pith.science/api/pith-number/QAUTEZQOPC3A5REMHP22VEEVZK/graph.json","events_json":"https://pith.science/api/pith-number/QAUTEZQOPC3A5REMHP22VEEVZK/events.json","paper":"https://pith.science/paper/QAUTEZQO"},"agent_actions":{"view_html":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK","download_json":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK.json","view_paper":"https://pith.science/paper/QAUTEZQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05216&json=true","fetch_graph":"https://pith.science/api/pith-number/QAUTEZQOPC3A5REMHP22VEEVZK/graph.json","fetch_events":"https://pith.science/api/pith-number/QAUTEZQOPC3A5REMHP22VEEVZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/action/storage_attestation","attest_author":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/action/author_attestation","sign_citation":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/action/citation_signature","submit_replication":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/action/replication_record"}},"created_at":"2026-05-18T00:30:34.484300+00:00","updated_at":"2026-05-18T00:30:34.484300+00:00"}