{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QFSHYRJEXQOXC4K6SGOPEYVHDP","short_pith_number":"pith:QFSHYRJE","canonical_record":{"source":{"id":"1601.04802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-19T05:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"5cd42f5943d9482185cbfce5874556742448d8ba93da87aaac0f3d9848932aad","abstract_canon_sha256":"b052eb0b97458f82fb590a6b46d824eae030ce4ab85eec9212464b2aa5696f05"},"schema_version":"1.0"},"canonical_sha256":"81647c4524bc1d71715e919cf262a71bfe1be8c477457520ed26a4d0a36bbd9b","source":{"kind":"arxiv","id":"1601.04802","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04802","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04802v3","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04802","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"QFSHYRJEXQOX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QFSHYRJEXQOXC4K6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QFSHYRJE","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QFSHYRJEXQOXC4K6SGOPEYVHDP","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-19T05:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"5cd42f5943d9482185cbfce5874556742448d8ba93da87aaac0f3d9848932aad","abstract_canon_sha256":"b052eb0b97458f82fb590a6b46d824eae030ce4ab85eec9212464b2aa5696f05"},"schema_version":"1.0"},"canonical_sha256":"81647c4524bc1d71715e919cf262a71bfe1be8c477457520ed26a4d0a36bbd9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.618164Z","signature_b64":"jzzjSS3TSrxNMFvwWBSb+Jo9QffyQhQyoiPyEf6tXOAP9Yfi4+AbQx/Np1KTEb4vgjP1P+mMI63cpY73Ck0/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81647c4524bc1d71715e919cf262a71bfe1be8c477457520ed26a4d0a36bbd9b","last_reissued_at":"2026-05-18T00:59:34.617666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.617666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04802","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-18T00:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXsKsCR6CDgZhZHCc1NVnaFKbGdhsPuq4K00zZ1DmPp0CP0rXlf4K3Ea5DtVIBT9is3Qoxy9ySCl5I8ZXxTjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:31:14.226671Z"},"content_sha256":"8e35e7953f8710eed70dc38fe8258b8d886a4f7933e72672b8ce3564fd9df1ed","schema_version":"1.0","event_id":"sha256:8e35e7953f8710eed70dc38fe8258b8d886a4f7933e72672b8ce3564fd9df1ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QFSHYRJEXQOXC4K6SGOPEYVHDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpolation synthesis for quadratic polynomial inequalities and combination with EUF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bican Xia, Deepak Kapur, Liyun Dai, Mingshuai Chen, Naijun Zhan, Ting Gan","submitted_at":"2016-01-19T05:05:49Z","abstract_excerpt":"An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities can be linearized if they are concave. A generalization of Motzkin's transposition theorem is proved, which is used to generate an interpolant between two mutually contradictory conjunctions of polynomial inequalities, using semi-definite programming in time complexity $\\mathcal{O}(n^3+nm))$, where $n$ is the number of variables and $m$ is the number of inequa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04802","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-18T00:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAlsImQiuNR7YJ5eOkN4T5yX1vYjVvQ4H4KZTiCNL0P19VKVGH4aK0eL6osVI8USu0f3AzGojpUQlEwkzsK7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:31:14.227013Z"},"content_sha256":"b95b190c6c8310b34c619f36250b4992f93a4ae3889f3751c0396db52b77f3bd","schema_version":"1.0","event_id":"sha256:b95b190c6c8310b34c619f36250b4992f93a4ae3889f3751c0396db52b77f3bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/bundle.json","state_url":"https://pith.science/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/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-05-22T20:31:14Z","links":{"resolver":"https://pith.science/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP","bundle":"https://pith.science/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/bundle.json","state":"https://pith.science/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFSHYRJEXQOXC4K6SGOPEYVHDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QFSHYRJEXQOXC4K6SGOPEYVHDP","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":"b052eb0b97458f82fb590a6b46d824eae030ce4ab85eec9212464b2aa5696f05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-19T05:05:49Z","title_canon_sha256":"5cd42f5943d9482185cbfce5874556742448d8ba93da87aaac0f3d9848932aad"},"schema_version":"1.0","source":{"id":"1601.04802","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04802","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04802v3","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04802","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"QFSHYRJEXQOX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QFSHYRJEXQOXC4K6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QFSHYRJE","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:b95b190c6c8310b34c619f36250b4992f93a4ae3889f3751c0396db52b77f3bd","target":"graph","created_at":"2026-05-18T00:59:34Z","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":"An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities can be linearized if they are concave. A generalization of Motzkin's transposition theorem is proved, which is used to generate an interpolant between two mutually contradictory conjunctions of polynomial inequalities, using semi-definite programming in time complexity $\\mathcal{O}(n^3+nm))$, where $n$ is the number of variables and $m$ is the number of inequa","authors_text":"Bican Xia, Deepak Kapur, Liyun Dai, Mingshuai Chen, Naijun Zhan, Ting Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-19T05:05:49Z","title":"Interpolation synthesis for quadratic polynomial inequalities and combination with EUF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04802","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:8e35e7953f8710eed70dc38fe8258b8d886a4f7933e72672b8ce3564fd9df1ed","target":"record","created_at":"2026-05-18T00:59:34Z","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":"b052eb0b97458f82fb590a6b46d824eae030ce4ab85eec9212464b2aa5696f05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-19T05:05:49Z","title_canon_sha256":"5cd42f5943d9482185cbfce5874556742448d8ba93da87aaac0f3d9848932aad"},"schema_version":"1.0","source":{"id":"1601.04802","kind":"arxiv","version":3}},"canonical_sha256":"81647c4524bc1d71715e919cf262a71bfe1be8c477457520ed26a4d0a36bbd9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81647c4524bc1d71715e919cf262a71bfe1be8c477457520ed26a4d0a36bbd9b","first_computed_at":"2026-05-18T00:59:34.617666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.617666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jzzjSS3TSrxNMFvwWBSb+Jo9QffyQhQyoiPyEf6tXOAP9Yfi4+AbQx/Np1KTEb4vgjP1P+mMI63cpY73Ck0/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.618164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04802","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e35e7953f8710eed70dc38fe8258b8d886a4f7933e72672b8ce3564fd9df1ed","sha256:b95b190c6c8310b34c619f36250b4992f93a4ae3889f3751c0396db52b77f3bd"],"state_sha256":"a26ded44f38fe8f4111e56752e39ec15d2b73648564c341bcf72f203bf19480c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vcRbaOTmzWqqOSDQqZYwLNLi5/eRNxJ7PzBCJOjZer9SXOiF7Iu7IXoya6iEAxYU14hLsKu+7hhmHLghZr4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T20:31:14.229103Z","bundle_sha256":"907221bbbe7f46599ac1f219a1eb78fe482110e441dc0ea1ab74a8bd3c1f0482"}}