{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QAUTEZQOPC3A5REMHP22VEEVZK","short_pith_number":"pith:QAUTEZQO","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"},"canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","source":{"kind":"arxiv","id":"1711.05216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05216","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05216v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05216","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"QAUTEZQOPC3A","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAUTEZQOPC3A5REM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAUTEZQO","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QAUTEZQOPC3A5REMHP22VEEVZK","target":"record","payload":{"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"},"canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","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"},"source_kind":"arxiv","source_id":"1711.05216","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dutj7CniT2pP2O5wJw+Zcnh0AM85L+/Zjl06k4pv2ujV93HADbtXbMV6bk+pacLL9ECUUCDkVm2kf6+mq1JtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:33:56.659121Z"},"content_sha256":"6873f0d26b6df62360c492ce2ae16411664b6c39b83e874ca2293163b1d61bc7","schema_version":"1.0","event_id":"sha256:6873f0d26b6df62360c492ce2ae16411664b6c39b83e874ca2293163b1d61bc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QAUTEZQOPC3A5REMHP22VEEVZK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1ihfd/dCbmBHpOC2wtPtCd4n8qbiMvgOyjOWxyDAfrCQanFIptOPpzc9JgyPVEqe8h3AD1K/b/HTrJA4dI+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:33:56.659483Z"},"content_sha256":"7222f26145f3592e6337ab45ba9db8e3a930bbc15145ad49f39e8832e5ebf448","schema_version":"1.0","event_id":"sha256:7222f26145f3592e6337ab45ba9db8e3a930bbc15145ad49f39e8832e5ebf448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/bundle.json","state_url":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAUTEZQOPC3A5REMHP22VEEVZK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T21:33:56Z","links":{"resolver":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK","bundle":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/bundle.json","state":"https://pith.science/pith/QAUTEZQOPC3A5REMHP22VEEVZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAUTEZQOPC3A5REMHP22VEEVZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QAUTEZQOPC3A5REMHP22VEEVZK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4378786aab9bd6513ee9f90e2f0408377770a53ded7da211171c35c9fefae9ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-14T17:30:08Z","title_canon_sha256":"02c360e88c42f6203886446171e5cec390aa49be080ce8d5040208568892fe98"},"schema_version":"1.0","source":{"id":"1711.05216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05216","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05216v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05216","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"QAUTEZQOPC3A","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAUTEZQOPC3A5REM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAUTEZQO","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:7222f26145f3592e6337ab45ba9db8e3a930bbc15145ad49f39e8832e5ebf448","target":"graph","created_at":"2026-05-18T00:30:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Francesco Scarcello, Georg Gottlob, Gianlugi Greco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-14T17:30:08Z","title":"Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05216","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6873f0d26b6df62360c492ce2ae16411664b6c39b83e874ca2293163b1d61bc7","target":"record","created_at":"2026-05-18T00:30:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4378786aab9bd6513ee9f90e2f0408377770a53ded7da211171c35c9fefae9ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-14T17:30:08Z","title_canon_sha256":"02c360e88c42f6203886446171e5cec390aa49be080ce8d5040208568892fe98"},"schema_version":"1.0","source":{"id":"1711.05216","kind":"arxiv","version":1}},"canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"802932660e78b60ec48c3bf5aa9095cab3b4a9f332702e76c483105d22d10d57","first_computed_at":"2026-05-18T00:30:34.484217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:34.484217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DR1lZEQZwWjMe3lkkWrRIOUDPJvqysEISQxvMWW75hEElICYlwL8+zY3glUeRU9mzryz/rV/2eSZ8e8QdKAVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:34.484818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6873f0d26b6df62360c492ce2ae16411664b6c39b83e874ca2293163b1d61bc7","sha256:7222f26145f3592e6337ab45ba9db8e3a930bbc15145ad49f39e8832e5ebf448"],"state_sha256":"e4febc67eabb572edce2dc7952b74c109990be73b60e7fda424647454a3c9b6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuENSgYQ2ZUCJzS1+JDZ9k6akaYpWJP8qjP573xW5ptfs1zNYUsFFsVhNRj8OvxxL0I/QAstflLDN8+RPUBfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:33:56.661410Z","bundle_sha256":"09ce7c70fc5470649d01f851aede726bc94cdb34ea8abbbff50dd6268241b100"}}