{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AMSSHGOFNBTS3Y7DFEFZHW6KD6","short_pith_number":"pith:AMSSHGOF","canonical_record":{"source":{"id":"1209.3419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.AI","submitted_at":"2012-09-15T16:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"d87413cf4e158046ff5aec23af12d23230c644e30d3862d315dd8de817ecf841","abstract_canon_sha256":"5463c6b2d95195490541ab5f0196c65b6e2f3d3afc463b7244a5985cca4145ef"},"schema_version":"1.0"},"canonical_sha256":"03252399c568672de3e3290b93dbca1fb5c0f0278a9c255b640dc10a60eb7d62","source":{"kind":"arxiv","id":"1209.3419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3419","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3419v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3419","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"AMSSHGOFNBTS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AMSSHGOFNBTS3Y7D","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AMSSHGOF","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AMSSHGOFNBTS3Y7DFEFZHW6KD6","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.AI","submitted_at":"2012-09-15T16:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"d87413cf4e158046ff5aec23af12d23230c644e30d3862d315dd8de817ecf841","abstract_canon_sha256":"5463c6b2d95195490541ab5f0196c65b6e2f3d3afc463b7244a5985cca4145ef"},"schema_version":"1.0"},"canonical_sha256":"03252399c568672de3e3290b93dbca1fb5c0f0278a9c255b640dc10a60eb7d62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:31.020699Z","signature_b64":"Mw/xwQ13FNfy18Zp3Nn1dcHt+DMOkmZoRaV7bocMCEn2mSNnri6pVLR2O471NNgjr4ZbXiQLJJGDpdJI8mI5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03252399c568672de3e3290b93dbca1fb5c0f0278a9c255b640dc10a60eb7d62","last_reissued_at":"2026-05-18T03:45:31.020183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:31.020183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3419","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:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLP8jxULXL3dt+pdmyYYo88+KEKDo88MOoI46iSJfjBn4OYpXyq4BadMXQ54F7ZAx79o9yPBa6qS8lZki7QzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:43:46.984271Z"},"content_sha256":"08ca34b78f810833981df2e4cb855ad28cfc4024a09c5d0d6452f064453e42c2","schema_version":"1.0","event_id":"sha256:08ca34b78f810833981df2e4cb855ad28cfc4024a09c5d0d6452f064453e42c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AMSSHGOFNBTS3Y7DFEFZHW6KD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractable Optimization Problems through Hypergraph-Based Structural Restrictions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francesco Scarcello, Georg Gottlob, Gianluigi Greco","submitted_at":"2012-09-15T16:40:19Z","abstract_excerpt":"Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal solution is an NP-hard problem in general; yet, when restricted over classes of instances whose constraint interactions can be modelled via (nearly-)acyclic graphs, this problem is known to be solvable in polynomial time. In this paper, larger classes of tractable instances are singled out, by discussing solution approaches based on exploiting hypergraph acyc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3419","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:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDWJuYlp9cyk/U1ylyZDY20Zsf2HLW9yR1fptk77eSidUXPb/TrflsmkENU+60F38QUVQRRmtzgUyPrR+GyUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:43:46.984627Z"},"content_sha256":"e05996b9ba162c0e48febed6f4cd2dd4307a9b58f4931b6165e3411713551dd0","schema_version":"1.0","event_id":"sha256:e05996b9ba162c0e48febed6f4cd2dd4307a9b58f4931b6165e3411713551dd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/bundle.json","state_url":"https://pith.science/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/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-27T19:43:46Z","links":{"resolver":"https://pith.science/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6","bundle":"https://pith.science/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/bundle.json","state":"https://pith.science/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMSSHGOFNBTS3Y7DFEFZHW6KD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AMSSHGOFNBTS3Y7DFEFZHW6KD6","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":"5463c6b2d95195490541ab5f0196c65b6e2f3d3afc463b7244a5985cca4145ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.AI","submitted_at":"2012-09-15T16:40:19Z","title_canon_sha256":"d87413cf4e158046ff5aec23af12d23230c644e30d3862d315dd8de817ecf841"},"schema_version":"1.0","source":{"id":"1209.3419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3419","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3419v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3419","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"AMSSHGOFNBTS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AMSSHGOFNBTS3Y7D","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AMSSHGOF","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:e05996b9ba162c0e48febed6f4cd2dd4307a9b58f4931b6165e3411713551dd0","target":"graph","created_at":"2026-05-18T03:45:31Z","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":"Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal solution is an NP-hard problem in general; yet, when restricted over classes of instances whose constraint interactions can be modelled via (nearly-)acyclic graphs, this problem is known to be solvable in polynomial time. In this paper, larger classes of tractable instances are singled out, by discussing solution approaches based on exploiting hypergraph acyc","authors_text":"Francesco Scarcello, Georg Gottlob, Gianluigi Greco","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.AI","submitted_at":"2012-09-15T16:40:19Z","title":"Tractable Optimization Problems through Hypergraph-Based Structural Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3419","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:08ca34b78f810833981df2e4cb855ad28cfc4024a09c5d0d6452f064453e42c2","target":"record","created_at":"2026-05-18T03:45:31Z","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":"5463c6b2d95195490541ab5f0196c65b6e2f3d3afc463b7244a5985cca4145ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.AI","submitted_at":"2012-09-15T16:40:19Z","title_canon_sha256":"d87413cf4e158046ff5aec23af12d23230c644e30d3862d315dd8de817ecf841"},"schema_version":"1.0","source":{"id":"1209.3419","kind":"arxiv","version":1}},"canonical_sha256":"03252399c568672de3e3290b93dbca1fb5c0f0278a9c255b640dc10a60eb7d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03252399c568672de3e3290b93dbca1fb5c0f0278a9c255b640dc10a60eb7d62","first_computed_at":"2026-05-18T03:45:31.020183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:31.020183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mw/xwQ13FNfy18Zp3Nn1dcHt+DMOkmZoRaV7bocMCEn2mSNnri6pVLR2O471NNgjr4ZbXiQLJJGDpdJI8mI5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:31.020699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08ca34b78f810833981df2e4cb855ad28cfc4024a09c5d0d6452f064453e42c2","sha256:e05996b9ba162c0e48febed6f4cd2dd4307a9b58f4931b6165e3411713551dd0"],"state_sha256":"53e4e3eb0889416b3705604368fd8e45bff5492e046ef27d5c233be639163ba6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCRhrmtTzOAnrVD5ulAQVElE6+Ong/OFsGDgQVx4BVnNI5s4SK2/YZRxmakiB+FIZ60hlxDN+gcFk2nBm7VqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:43:46.987337Z","bundle_sha256":"c87eed23b388246e8a915935ebdcc0459d2a235efa8569887bebdd5773b1a9c1"}}