{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4ETSPCJIBM4ZSCXAGP3HNHTP6L","short_pith_number":"pith:4ETSPCJI","canonical_record":{"source":{"id":"1401.5855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-23T02:45:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f3db14c0f883afaba71ee3a74e90cdd99f581558a75dbe40c1af97c94ba30eee","abstract_canon_sha256":"2b34d7fe07f2b6af04dad497e45a46b2386f94a79bf34aeb828eb44ef7f17355"},"schema_version":"1.0"},"canonical_sha256":"e1272789280b39990ae033f6769e6ff2de21e27fb396919058e9b57124bdcc8e","source":{"kind":"arxiv","id":"1401.5855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5855","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5855v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5855","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"4ETSPCJIBM4Z","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4ETSPCJIBM4ZSCXA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4ETSPCJI","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4ETSPCJIBM4ZSCXAGP3HNHTP6L","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-23T02:45:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f3db14c0f883afaba71ee3a74e90cdd99f581558a75dbe40c1af97c94ba30eee","abstract_canon_sha256":"2b34d7fe07f2b6af04dad497e45a46b2386f94a79bf34aeb828eb44ef7f17355"},"schema_version":"1.0"},"canonical_sha256":"e1272789280b39990ae033f6769e6ff2de21e27fb396919058e9b57124bdcc8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.664917Z","signature_b64":"5wtTjjJPq8AhqYPuhT0kKbI90kygR2qef/N4J27bhVvXxIHtSBxO9REc5qxeOQzFcOPya4A7wBB5YQ1TXi+LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1272789280b39990ae033f6769e6ff2de21e27fb396919058e9b57124bdcc8e","last_reissued_at":"2026-05-18T03:01:23.664185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.664185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5855","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrSZlTV+q7MdC3LEO/Gsf7jpbPkGZzAk56zlW9x2mc6ECIqX6CTNZV5tLAqX2/NTsSLTcPKG8GEEoCHjesIiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:22:25.828634Z"},"content_sha256":"8ef4e1be6ed90d4e484511491cc87c24472a49d2ce4fb92357649d17883157e8","schema_version":"1.0","event_id":"sha256:8ef4e1be6ed90d4e484511491cc87c24472a49d2ce4fb92357649d17883157e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4ETSPCJIBM4ZSCXAGP3HNHTP6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractable Triangles and Cross-Free Convexity in Discrete Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Martin C. Cooper, Stanislav \\v{Z}ivn\\'y","submitted_at":"2014-01-23T02:45:30Z","abstract_excerpt":"The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs).\n  We study the computational complexity of classes of discrete optimisation problems given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables. We show that for several computational problems, the only non- trivial tractable classes are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5855","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnv7zs0HJP7/U5P2MMLKuoHBr2LyGHdS5oLJhdcx+97Ce6xWwXYCblg7jibCtVXVfRwqo7PMsUNXsIgPkWdWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:22:25.828979Z"},"content_sha256":"026c7469c592cdea0641fe7a548c4ca47985d1e7910f649298060fa281797b28","schema_version":"1.0","event_id":"sha256:026c7469c592cdea0641fe7a548c4ca47985d1e7910f649298060fa281797b28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/bundle.json","state_url":"https://pith.science/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/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-05T09:22:25Z","links":{"resolver":"https://pith.science/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L","bundle":"https://pith.science/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/bundle.json","state":"https://pith.science/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ETSPCJIBM4ZSCXAGP3HNHTP6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4ETSPCJIBM4ZSCXAGP3HNHTP6L","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":"2b34d7fe07f2b6af04dad497e45a46b2386f94a79bf34aeb828eb44ef7f17355","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-23T02:45:30Z","title_canon_sha256":"f3db14c0f883afaba71ee3a74e90cdd99f581558a75dbe40c1af97c94ba30eee"},"schema_version":"1.0","source":{"id":"1401.5855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5855","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5855v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5855","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"4ETSPCJIBM4Z","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4ETSPCJIBM4ZSCXA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4ETSPCJI","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:026c7469c592cdea0641fe7a548c4ca47985d1e7910f649298060fa281797b28","target":"graph","created_at":"2026-05-18T03:01:23Z","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":"The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs).\n  We study the computational complexity of classes of discrete optimisation problems given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables. We show that for several computational problems, the only non- trivial tractable classes are","authors_text":"Martin C. Cooper, Stanislav \\v{Z}ivn\\'y","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-23T02:45:30Z","title":"Tractable Triangles and Cross-Free Convexity in Discrete Optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5855","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:8ef4e1be6ed90d4e484511491cc87c24472a49d2ce4fb92357649d17883157e8","target":"record","created_at":"2026-05-18T03:01:23Z","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":"2b34d7fe07f2b6af04dad497e45a46b2386f94a79bf34aeb828eb44ef7f17355","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-23T02:45:30Z","title_canon_sha256":"f3db14c0f883afaba71ee3a74e90cdd99f581558a75dbe40c1af97c94ba30eee"},"schema_version":"1.0","source":{"id":"1401.5855","kind":"arxiv","version":1}},"canonical_sha256":"e1272789280b39990ae033f6769e6ff2de21e27fb396919058e9b57124bdcc8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1272789280b39990ae033f6769e6ff2de21e27fb396919058e9b57124bdcc8e","first_computed_at":"2026-05-18T03:01:23.664185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.664185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wtTjjJPq8AhqYPuhT0kKbI90kygR2qef/N4J27bhVvXxIHtSBxO9REc5qxeOQzFcOPya4A7wBB5YQ1TXi+LCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.664917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ef4e1be6ed90d4e484511491cc87c24472a49d2ce4fb92357649d17883157e8","sha256:026c7469c592cdea0641fe7a548c4ca47985d1e7910f649298060fa281797b28"],"state_sha256":"f86ed4493a9576e491001c5bf4344e799f0c6c049a248828fe0175e87063e5f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E17hZCACFuSitTddyGccF+czM4Jv3KUhWN02o4zSVW2xNoN1fKyv6uLtzz7m8rScF+jFp0QQeBQHHq3bV1FCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:22:25.830907Z","bundle_sha256":"54245c3dabe262ba048754aaadc93f57f7699bdeabcfd8cec6edee85369c58e0"}}