{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NM5ZXWUEDRWKKYTS7D3E3EVOHN","short_pith_number":"pith:NM5ZXWUE","canonical_record":{"source":{"id":"1312.6155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-20T21:41:18Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"cd00a677c1b94407b9daefee9f4fd8b86c6ddc79c8f86abf6649d4448637219c","abstract_canon_sha256":"554e11bdd6d2a622af9985910cb8203a733c702a5934ad54a518486f9da1ad74"},"schema_version":"1.0"},"canonical_sha256":"6b3b9bda841c6ca56272f8f64d92ae3b6c79e82b57e893e60e611cb3330b94ec","source":{"kind":"arxiv","id":"1312.6155","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6155","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6155v3","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6155","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"NM5ZXWUEDRWK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NM5ZXWUEDRWKKYTS","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NM5ZXWUE","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NM5ZXWUEDRWKKYTS7D3E3EVOHN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-20T21:41:18Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"cd00a677c1b94407b9daefee9f4fd8b86c6ddc79c8f86abf6649d4448637219c","abstract_canon_sha256":"554e11bdd6d2a622af9985910cb8203a733c702a5934ad54a518486f9da1ad74"},"schema_version":"1.0"},"canonical_sha256":"6b3b9bda841c6ca56272f8f64d92ae3b6c79e82b57e893e60e611cb3330b94ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.210491Z","signature_b64":"nw9kZshu/QuJMenmx7EM+hZBDtqJi2DK43zhCZVBEKn2SHUkIfu/GlJjOLmmpX3ZWoFMF1dM09OfzsWT+EXxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b3b9bda841c6ca56272f8f64d92ae3b6c79e82b57e893e60e611cb3330b94ec","last_reissued_at":"2026-05-18T02:49:03.209946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.209946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6155","source_version":3,"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWc+geGVWLvk+rc5aX7VU7HZ7gPBgLsAKs7LkZ1uFydMctl4HMOh8FTtfgaPdGg8xUrGumt8VVSVb1lWT/o3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:15:19.793030Z"},"content_sha256":"3dead59846cf9f77fc7e961e3655bf3c1bb09b6ae7d9bf5c620cacff6fb1ed05","schema_version":"1.0","event_id":"sha256:3dead59846cf9f77fc7e961e3655bf3c1bb09b6ae7d9bf5c620cacff6fb1ed05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NM5ZXWUEDRWKKYTS7D3E3EVOHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"cs.LO","authors_text":"Milan Hlad\\'ik, Stefan Ratschan","submitted_at":"2013-12-20T21:41:18Z","abstract_excerpt":"In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In this paper, we present an algorithm for solving a certain class of such problems based on interval techniques in combination with conservative linear programming approximation. In comparison with previous work, the method is more general - allowing general Boolean structure in the input constraint, and more efficient - using splitting heuristics that learn from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6155","kind":"arxiv","version":3},"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2XV+bXsOr1XFkNKozOA9bpx9Tf9QoPoUxWTLpj9m5Mi29QtZraKJYS5n39xhwBcLIqeubhKOcr1iZDbXx6UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:15:19.793621Z"},"content_sha256":"0930512122398d5a25548e1a19186afa942a0284f57ff8c7c81769c43d98f19a","schema_version":"1.0","event_id":"sha256:0930512122398d5a25548e1a19186afa942a0284f57ff8c7c81769c43d98f19a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/bundle.json","state_url":"https://pith.science/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/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-06T21:15:19Z","links":{"resolver":"https://pith.science/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN","bundle":"https://pith.science/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/bundle.json","state":"https://pith.science/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM5ZXWUEDRWKKYTS7D3E3EVOHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NM5ZXWUEDRWKKYTS7D3E3EVOHN","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":"554e11bdd6d2a622af9985910cb8203a733c702a5934ad54a518486f9da1ad74","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-20T21:41:18Z","title_canon_sha256":"cd00a677c1b94407b9daefee9f4fd8b86c6ddc79c8f86abf6649d4448637219c"},"schema_version":"1.0","source":{"id":"1312.6155","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6155","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6155v3","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6155","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"NM5ZXWUEDRWK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NM5ZXWUEDRWKKYTS","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NM5ZXWUE","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0930512122398d5a25548e1a19186afa942a0284f57ff8c7c81769c43d98f19a","target":"graph","created_at":"2026-05-18T02:49:03Z","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":"In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In this paper, we present an algorithm for solving a certain class of such problems based on interval techniques in combination with conservative linear programming approximation. In comparison with previous work, the method is more general - allowing general Boolean structure in the input constraint, and more efficient - using splitting heuristics that learn from","authors_text":"Milan Hlad\\'ik, Stefan Ratschan","cross_cats":["cs.DS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-20T21:41:18Z","title":"Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6155","kind":"arxiv","version":3},"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:3dead59846cf9f77fc7e961e3655bf3c1bb09b6ae7d9bf5c620cacff6fb1ed05","target":"record","created_at":"2026-05-18T02:49:03Z","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":"554e11bdd6d2a622af9985910cb8203a733c702a5934ad54a518486f9da1ad74","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-20T21:41:18Z","title_canon_sha256":"cd00a677c1b94407b9daefee9f4fd8b86c6ddc79c8f86abf6649d4448637219c"},"schema_version":"1.0","source":{"id":"1312.6155","kind":"arxiv","version":3}},"canonical_sha256":"6b3b9bda841c6ca56272f8f64d92ae3b6c79e82b57e893e60e611cb3330b94ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b3b9bda841c6ca56272f8f64d92ae3b6c79e82b57e893e60e611cb3330b94ec","first_computed_at":"2026-05-18T02:49:03.209946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:03.209946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nw9kZshu/QuJMenmx7EM+hZBDtqJi2DK43zhCZVBEKn2SHUkIfu/GlJjOLmmpX3ZWoFMF1dM09OfzsWT+EXxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:03.210491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6155","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dead59846cf9f77fc7e961e3655bf3c1bb09b6ae7d9bf5c620cacff6fb1ed05","sha256:0930512122398d5a25548e1a19186afa942a0284f57ff8c7c81769c43d98f19a"],"state_sha256":"c0125572219a7669eb49268784af8a3ed64acca246f912b6296154f4608a65bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8icli8Qq6m1WOpKCvMCMVmfv+T1OPSI72eZsGQoviPQJibPusyIOuIGjDKTHYstEg5iIb0dpGGM1TUGurNGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:15:19.796746Z","bundle_sha256":"e056ce91c65458e26be16f04fe97d46e7b4df479b11a17748738250fc7cbed2c"}}