{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MT4RNNN2CQHHW3MZ75JUZW7LXJ","short_pith_number":"pith:MT4RNNN2","canonical_record":{"source":{"id":"1210.0420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-01T14:30:00Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"d99bb8dc4003d579d70fea65f9c54632f780984b63aac4337fbbf1845fb17d3f","abstract_canon_sha256":"0e5bd4dc9ddaf5a2672ff90a4e2fd42dd9f90199c724b8b6010f175f27412088"},"schema_version":"1.0"},"canonical_sha256":"64f916b5ba140e7b6d99ff534cdbebba588d2acd41497102393df3f766b46735","source":{"kind":"arxiv","id":"1210.0420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0420","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0420v2","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0420","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"MT4RNNN2CQHH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MT4RNNN2CQHHW3MZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MT4RNNN2","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MT4RNNN2CQHHW3MZ75JUZW7LXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-01T14:30:00Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"d99bb8dc4003d579d70fea65f9c54632f780984b63aac4337fbbf1845fb17d3f","abstract_canon_sha256":"0e5bd4dc9ddaf5a2672ff90a4e2fd42dd9f90199c724b8b6010f175f27412088"},"schema_version":"1.0"},"canonical_sha256":"64f916b5ba140e7b6d99ff534cdbebba588d2acd41497102393df3f766b46735","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.456885Z","signature_b64":"YWVK/PXyWuWASgowe3SVkiUI5IzQGBEqcv0nUV1a8Ujs0QvHaN+ZVWNUITH4SqOo0WwnkA8v4VIPcjVox9IvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f916b5ba140e7b6d99ff534cdbebba588d2acd41497102393df3f766b46735","last_reissued_at":"2026-05-18T01:37:38.456186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.456186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0420","source_version":2,"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svuxdf1hTBH196eSkW5D4Gq8iAn8LjOo53+jsprQqabYDVrH+VxIMabbHtV8Wmtbjr9kphZYsur2CdkdNgYnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:47:53.117366Z"},"content_sha256":"46e604f7f9359ed41281653c0a235997e51dfc01feeaa64d8a5b16b2836294cd","schema_version":"1.0","event_id":"sha256:46e604f7f9359ed41281653c0a235997e51dfc01feeaa64d8a5b16b2836294cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MT4RNNN2CQHHW3MZ75JUZW7LXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Essential Convexity and Complexity of Semi-Algebraic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"cs.CC","authors_text":"Ecole Polytechnique), Linkoepings Universitet), Manuel Bodirsky (LIX, Peter Jonsson (Department of Computer, System Science, Timo von Oertzen (Max-Planck-Institute for Human Development)","submitted_at":"2012-10-01T14:30:00Z","abstract_excerpt":"Let \\Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article, we study the computational complexity of constraint satisfaction problem (CSP) for \\Gamma: the problem to decide whether a given primitive positive sentence is true in \\Gamma. We focus on those structures \\Gamma that contain the relations \\leq, {(x,y,z) | x+y=z} and {1}. Hence, all CSPs studied in this article are at least as expressive as the feasibility p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0420","kind":"arxiv","version":2},"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twGD3NwmCabUjOfUpFGifmifLpMrUNr9Jv/r31aN55MKdOBkyBqynRgRqWujLqyjBBp5hX0wpUCYCR/lDKeUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:47:53.117725Z"},"content_sha256":"97291d35862013d7281c8fff03d9b503634f3c7e1064f05ae3888e0d62bd7897","schema_version":"1.0","event_id":"sha256:97291d35862013d7281c8fff03d9b503634f3c7e1064f05ae3888e0d62bd7897"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/bundle.json","state_url":"https://pith.science/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/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-03T03:47:53Z","links":{"resolver":"https://pith.science/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ","bundle":"https://pith.science/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/bundle.json","state":"https://pith.science/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MT4RNNN2CQHHW3MZ75JUZW7LXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MT4RNNN2CQHHW3MZ75JUZW7LXJ","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":"0e5bd4dc9ddaf5a2672ff90a4e2fd42dd9f90199c724b8b6010f175f27412088","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-01T14:30:00Z","title_canon_sha256":"d99bb8dc4003d579d70fea65f9c54632f780984b63aac4337fbbf1845fb17d3f"},"schema_version":"1.0","source":{"id":"1210.0420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0420","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0420v2","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0420","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"MT4RNNN2CQHH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MT4RNNN2CQHHW3MZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MT4RNNN2","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:97291d35862013d7281c8fff03d9b503634f3c7e1064f05ae3888e0d62bd7897","target":"graph","created_at":"2026-05-18T01:37:38Z","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":"Let \\Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article, we study the computational complexity of constraint satisfaction problem (CSP) for \\Gamma: the problem to decide whether a given primitive positive sentence is true in \\Gamma. We focus on those structures \\Gamma that contain the relations \\leq, {(x,y,z) | x+y=z} and {1}. Hence, all CSPs studied in this article are at least as expressive as the feasibility p","authors_text":"Ecole Polytechnique), Linkoepings Universitet), Manuel Bodirsky (LIX, Peter Jonsson (Department of Computer, System Science, Timo von Oertzen (Max-Planck-Institute for Human Development)","cross_cats":["cs.DM","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-01T14:30:00Z","title":"Essential Convexity and Complexity of Semi-Algebraic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0420","kind":"arxiv","version":2},"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:46e604f7f9359ed41281653c0a235997e51dfc01feeaa64d8a5b16b2836294cd","target":"record","created_at":"2026-05-18T01:37:38Z","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":"0e5bd4dc9ddaf5a2672ff90a4e2fd42dd9f90199c724b8b6010f175f27412088","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-01T14:30:00Z","title_canon_sha256":"d99bb8dc4003d579d70fea65f9c54632f780984b63aac4337fbbf1845fb17d3f"},"schema_version":"1.0","source":{"id":"1210.0420","kind":"arxiv","version":2}},"canonical_sha256":"64f916b5ba140e7b6d99ff534cdbebba588d2acd41497102393df3f766b46735","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64f916b5ba140e7b6d99ff534cdbebba588d2acd41497102393df3f766b46735","first_computed_at":"2026-05-18T01:37:38.456186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:38.456186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YWVK/PXyWuWASgowe3SVkiUI5IzQGBEqcv0nUV1a8Ujs0QvHaN+ZVWNUITH4SqOo0WwnkA8v4VIPcjVox9IvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:38.456885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46e604f7f9359ed41281653c0a235997e51dfc01feeaa64d8a5b16b2836294cd","sha256:97291d35862013d7281c8fff03d9b503634f3c7e1064f05ae3888e0d62bd7897"],"state_sha256":"7642fe5d52f96510044db5de9de5b7a260e672a2df819b6a958bbf018110d891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdjeLzi3KAr8jKxx5LwOcp/H3vPJn1UQO+NvAgTJ3+rgYJRkHt+aTHIiuKm605PFJ2dtiLanMPRB+kEDfz0QBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:47:53.119625Z","bundle_sha256":"22cca1f2482d995d2b72342b96de3a00017fb8e93089afada827ea19680a6f59"}}