{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q53BFU7WLGAICBYM4T4CJUS7BX","short_pith_number":"pith:Q53BFU7W","canonical_record":{"source":{"id":"1810.04215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2018-10-09T19:00:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"90b188953534902c536d35bdae4d1f0d2cf156477fa0f98d8c06a18dad2a1429","abstract_canon_sha256":"598feaea69b5b2987ff9b1a656ae1c44527c24da57b9050077c335bba9942274"},"schema_version":"1.0"},"canonical_sha256":"877612d3f6598081070ce4f824d25f0ddabadfb1a3cd6e471c0bc886a2041b9d","source":{"kind":"arxiv","id":"1810.04215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04215","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04215v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04215","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"Q53BFU7WLGAI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q53BFU7WLGAICBYM","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q53BFU7W","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q53BFU7WLGAICBYM4T4CJUS7BX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2018-10-09T19:00:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"90b188953534902c536d35bdae4d1f0d2cf156477fa0f98d8c06a18dad2a1429","abstract_canon_sha256":"598feaea69b5b2987ff9b1a656ae1c44527c24da57b9050077c335bba9942274"},"schema_version":"1.0"},"canonical_sha256":"877612d3f6598081070ce4f824d25f0ddabadfb1a3cd6e471c0bc886a2041b9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.801743Z","signature_b64":"BalJw1WTZbSrTDUjBiFNbjnrK53PHP4SD4WnJ9/H+LqzhFXTaF9pXpJ6LDiuREpdI0x96dcLQvDwfoeMq52SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"877612d3f6598081070ce4f824d25f0ddabadfb1a3cd6e471c0bc886a2041b9d","last_reissued_at":"2026-05-18T00:03:40.801086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.801086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04215","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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aofi2KhRzRC2IuyXqUpMt2s0QThkUt3gCb2jq6rZK/kKhy44qxm09fJI2JnBrJfqMGbLNZwq6KG0HM9GJoBOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:21:23.961272Z"},"content_sha256":"b45a9544eb20b7f9786be75d41429ba8e46bddbf6e1c6776dd4899eaea324412","schema_version":"1.0","event_id":"sha256:b45a9544eb20b7f9786be75d41429ba8e46bddbf6e1c6776dd4899eaea324412"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q53BFU7WLGAICBYM4T4CJUS7BX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Facial reduction for exact polynomial sum of squares decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"Santiago Laplagne","submitted_at":"2018-10-09T19:00:09Z","abstract_excerpt":"We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros). Computing symbolically roots of the original polynomial and applying facial reduction techniques, we can solve the problem algebraically or restrict to a subspace where the problem becomes strictly feasible and a numerical approximation can be rounded to an exact solution.\n  As an application, we study the problem of determining when can a rational polynomial tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04215","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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yhSTygZrTpsJ59XuN33aJQ9Eo++k0FQOoWphjFSrfKnWeTd1uaOHrtWpENrmiNueXs1tEv0bEchvdxq0uiFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:21:23.961630Z"},"content_sha256":"ce9bcf6d41bb8a206a21e58ff13b385f844402b3213269e1d53bb9682bac75a7","schema_version":"1.0","event_id":"sha256:ce9bcf6d41bb8a206a21e58ff13b385f844402b3213269e1d53bb9682bac75a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/bundle.json","state_url":"https://pith.science/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/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-24T09:21:23Z","links":{"resolver":"https://pith.science/pith/Q53BFU7WLGAICBYM4T4CJUS7BX","bundle":"https://pith.science/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/bundle.json","state":"https://pith.science/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q53BFU7WLGAICBYM4T4CJUS7BX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q53BFU7WLGAICBYM4T4CJUS7BX","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":"598feaea69b5b2987ff9b1a656ae1c44527c24da57b9050077c335bba9942274","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2018-10-09T19:00:09Z","title_canon_sha256":"90b188953534902c536d35bdae4d1f0d2cf156477fa0f98d8c06a18dad2a1429"},"schema_version":"1.0","source":{"id":"1810.04215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04215","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04215v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04215","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"Q53BFU7WLGAI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q53BFU7WLGAICBYM","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q53BFU7W","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:ce9bcf6d41bb8a206a21e58ff13b385f844402b3213269e1d53bb9682bac75a7","target":"graph","created_at":"2026-05-18T00:03:40Z","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":"We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros). Computing symbolically roots of the original polynomial and applying facial reduction techniques, we can solve the problem algebraically or restrict to a subspace where the problem becomes strictly feasible and a numerical approximation can be rounded to an exact solution.\n  As an application, we study the problem of determining when can a rational polynomial tha","authors_text":"Santiago Laplagne","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2018-10-09T19:00:09Z","title":"Facial reduction for exact polynomial sum of squares decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04215","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:b45a9544eb20b7f9786be75d41429ba8e46bddbf6e1c6776dd4899eaea324412","target":"record","created_at":"2026-05-18T00:03:40Z","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":"598feaea69b5b2987ff9b1a656ae1c44527c24da57b9050077c335bba9942274","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2018-10-09T19:00:09Z","title_canon_sha256":"90b188953534902c536d35bdae4d1f0d2cf156477fa0f98d8c06a18dad2a1429"},"schema_version":"1.0","source":{"id":"1810.04215","kind":"arxiv","version":1}},"canonical_sha256":"877612d3f6598081070ce4f824d25f0ddabadfb1a3cd6e471c0bc886a2041b9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"877612d3f6598081070ce4f824d25f0ddabadfb1a3cd6e471c0bc886a2041b9d","first_computed_at":"2026-05-18T00:03:40.801086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:40.801086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BalJw1WTZbSrTDUjBiFNbjnrK53PHP4SD4WnJ9/H+LqzhFXTaF9pXpJ6LDiuREpdI0x96dcLQvDwfoeMq52SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:40.801743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b45a9544eb20b7f9786be75d41429ba8e46bddbf6e1c6776dd4899eaea324412","sha256:ce9bcf6d41bb8a206a21e58ff13b385f844402b3213269e1d53bb9682bac75a7"],"state_sha256":"220e0d720a6585b337dbf163969a17a2966e7b5555ef83f0f91f7ff2dccefec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZWzylFCdbTugvp3wNOVq8YDAx4esm1BkXdiBHNpnWN56femwaUIG6R+U0JfYGxrO10OxTF8UqVZgkfsd5c9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:21:23.963586Z","bundle_sha256":"b42cda88f02022da4f9bef3311204f5a9a6d3d4858630e37731a14e2b2f2b68d"}}