{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OJB4YKJ2Q2JR2HOJHWY6IOUEL2","short_pith_number":"pith:OJB4YKJ2","canonical_record":{"source":{"id":"1212.2314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-11T07:02:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"050af01203fbd1577e08d8ca18d9c94a5f2c4573369883e8eabce4731c32d53f","abstract_canon_sha256":"8795efc9858585341682a9df57aee1ec26da898d1c852650fd05dc021bb5afba"},"schema_version":"1.0"},"canonical_sha256":"7243cc293a86931d1dc93db1e43a845ea153bc618e0732373c85220e1fcbc77b","source":{"kind":"arxiv","id":"1212.2314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2314","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2314v1","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2314","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"OJB4YKJ2Q2JR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OJB4YKJ2Q2JR2HOJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OJB4YKJ2","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OJB4YKJ2Q2JR2HOJHWY6IOUEL2","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-11T07:02:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"050af01203fbd1577e08d8ca18d9c94a5f2c4573369883e8eabce4731c32d53f","abstract_canon_sha256":"8795efc9858585341682a9df57aee1ec26da898d1c852650fd05dc021bb5afba"},"schema_version":"1.0"},"canonical_sha256":"7243cc293a86931d1dc93db1e43a845ea153bc618e0732373c85220e1fcbc77b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:45.325775Z","signature_b64":"NylUyBInpXCNN996Z2x8ueS7cFRs7bGLP5UMCi3bHibVNM5/bFv2QOZu9+QdKaIEs6Kbr45cKRDirzFVR+0SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7243cc293a86931d1dc93db1e43a845ea153bc618e0732373c85220e1fcbc77b","last_reissued_at":"2026-05-18T03:38:45.324976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:45.324976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2314","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-18T03:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1aPpisSmeTAoWD+X9guu2KF3M68hP2b0NixhhpeX7Pxaq3zN3MUyYqHMHjg5b08EmZOWoQnzS4IQ9qvpIaqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:51:45.246677Z"},"content_sha256":"24eb3578ba6bb6d85a17fbdcd3d4ec6b09bfb507d763ae4e62fd24e3acaaee79","schema_version":"1.0","event_id":"sha256:24eb3578ba6bb6d85a17fbdcd3d4ec6b09bfb507d763ae4e62fd24e3acaaee79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OJB4YKJ2Q2JR2HOJHWY6IOUEL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Projections and Structural Decomposition Methods: Minimality and Game-Theoretic Characterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DM","authors_text":"Francesco Scarcello, Gianluigi Greco","submitted_at":"2012-12-11T07:02:31Z","abstract_excerpt":"Tree projections provide a mathematical framework that encompasses all the various (purely) structural decomposition methods that have been proposed in the literature to single out classes of nearly-acyclic (hyper)graphs, such as the tree decomposition method, which is the most powerful decomposition method on graphs, and the (generalized) hypertree decomposition method, which is its natural counterpart on arbitrary hypergraphs. The paper analyzes this framework, by focusing in particular on \"minimal\" tree projections, that is, on tree projections without useless redundancies. First, it is sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2314","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-18T03:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxuh4N5xvnwxU0fPam5hNDn8Fiy/mdF6IdwqRMUbP9r2yf+cwWuYQAl3IMOwxBhEhmHEt1Ap1K+DuLmpWDNvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:51:45.247021Z"},"content_sha256":"4586cf5c5bf08b931d75e9ecf78c9b8ac6770d0f29612a9f1ed5560ef9ac33e3","schema_version":"1.0","event_id":"sha256:4586cf5c5bf08b931d75e9ecf78c9b8ac6770d0f29612a9f1ed5560ef9ac33e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/bundle.json","state_url":"https://pith.science/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/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-27T16:51:45Z","links":{"resolver":"https://pith.science/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2","bundle":"https://pith.science/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/bundle.json","state":"https://pith.science/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJB4YKJ2Q2JR2HOJHWY6IOUEL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OJB4YKJ2Q2JR2HOJHWY6IOUEL2","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":"8795efc9858585341682a9df57aee1ec26da898d1c852650fd05dc021bb5afba","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-11T07:02:31Z","title_canon_sha256":"050af01203fbd1577e08d8ca18d9c94a5f2c4573369883e8eabce4731c32d53f"},"schema_version":"1.0","source":{"id":"1212.2314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2314","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2314v1","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2314","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"OJB4YKJ2Q2JR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OJB4YKJ2Q2JR2HOJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OJB4YKJ2","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4586cf5c5bf08b931d75e9ecf78c9b8ac6770d0f29612a9f1ed5560ef9ac33e3","target":"graph","created_at":"2026-05-18T03:38:45Z","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 mathematical framework that encompasses all the various (purely) structural decomposition methods that have been proposed in the literature to single out classes of nearly-acyclic (hyper)graphs, such as the tree decomposition method, which is the most powerful decomposition method on graphs, and the (generalized) hypertree decomposition method, which is its natural counterpart on arbitrary hypergraphs. The paper analyzes this framework, by focusing in particular on \"minimal\" tree projections, that is, on tree projections without useless redundancies. First, it is sho","authors_text":"Francesco Scarcello, Gianluigi Greco","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-11T07:02:31Z","title":"Tree Projections and Structural Decomposition Methods: Minimality and Game-Theoretic Characterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2314","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:24eb3578ba6bb6d85a17fbdcd3d4ec6b09bfb507d763ae4e62fd24e3acaaee79","target":"record","created_at":"2026-05-18T03:38:45Z","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":"8795efc9858585341682a9df57aee1ec26da898d1c852650fd05dc021bb5afba","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-11T07:02:31Z","title_canon_sha256":"050af01203fbd1577e08d8ca18d9c94a5f2c4573369883e8eabce4731c32d53f"},"schema_version":"1.0","source":{"id":"1212.2314","kind":"arxiv","version":1}},"canonical_sha256":"7243cc293a86931d1dc93db1e43a845ea153bc618e0732373c85220e1fcbc77b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7243cc293a86931d1dc93db1e43a845ea153bc618e0732373c85220e1fcbc77b","first_computed_at":"2026-05-18T03:38:45.324976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:45.324976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NylUyBInpXCNN996Z2x8ueS7cFRs7bGLP5UMCi3bHibVNM5/bFv2QOZu9+QdKaIEs6Kbr45cKRDirzFVR+0SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:45.325775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24eb3578ba6bb6d85a17fbdcd3d4ec6b09bfb507d763ae4e62fd24e3acaaee79","sha256:4586cf5c5bf08b931d75e9ecf78c9b8ac6770d0f29612a9f1ed5560ef9ac33e3"],"state_sha256":"796e2879763b90b08398d9a53b28e8ab1fea447475f8f6af5c24f64d6dcd0efa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfn3wfZxkPI2PyPFrjvS0xjSCq32yvvutHeE1CnFVE2ugiOyBPD120kIEVn/rz4WwozfiBg2zcnO1tvpV8uIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:51:45.248856Z","bundle_sha256":"cdda04fe9fa44e1000a8345a6d37b12e8af736f4f05648c1732df9732fe3edfb"}}