{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IV2CW5B3L25EF4V6OJ6BOEZZSP","short_pith_number":"pith:IV2CW5B3","canonical_record":{"source":{"id":"1912.08899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-18T21:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"7ffe6d4a8ebcf3b62dc95cc3f97a2cc0608b055b4e8d11241aad59879556dda2","abstract_canon_sha256":"8f9841a98e236f743a06f933049ac2068c6ed0c36a0c96b2fa3848802b522a71"},"schema_version":"1.0"},"canonical_sha256":"45742b743b5eba42f2be727c17133993c82b7c9fe1243cf6ebef2cf405bda503","source":{"kind":"arxiv","id":"1912.08899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.08899","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1912.08899v2","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08899","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"IV2CW5B3L25E","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_16","alias_value":"IV2CW5B3L25EF4V6","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_8","alias_value":"IV2CW5B3","created_at":"2026-07-05T01:02:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IV2CW5B3L25EF4V6OJ6BOEZZSP","target":"record","payload":{"canonical_record":{"source":{"id":"1912.08899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-18T21:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"7ffe6d4a8ebcf3b62dc95cc3f97a2cc0608b055b4e8d11241aad59879556dda2","abstract_canon_sha256":"8f9841a98e236f743a06f933049ac2068c6ed0c36a0c96b2fa3848802b522a71"},"schema_version":"1.0"},"canonical_sha256":"45742b743b5eba42f2be727c17133993c82b7c9fe1243cf6ebef2cf405bda503","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:28.904107Z","signature_b64":"n9nW0sMjrdXNQtUttuA37Tk1NVRY5lZd2h4jlYw+f36bzWUz+ycin+nF+W2YXM52cXXuZSurwMHFGAaqinVQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45742b743b5eba42f2be727c17133993c82b7c9fe1243cf6ebef2cf405bda503","last_reissued_at":"2026-07-05T01:02:28.903622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:28.903622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.08899","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-07-05T01:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oxlE5cMfPTEUzjH7hJ5LQH0AVNGdtF1k1kDz6kfx9fA3acYGLcipKPBL3miliHzW7VLX9UCjL+8/0xKlz7OCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:42:55.125083Z"},"content_sha256":"248a7d8feb85ffa1670137743c9adc0e2ee7a2151b6d24edb1bf63d1e0823c10","schema_version":"1.0","event_id":"sha256:248a7d8feb85ffa1670137743c9adc0e2ee7a2151b6d24edb1bf63d1e0823c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IV2CW5B3L25EF4V6OJ6BOEZZSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TSSOS: A Moment-SOS hierarchy that exploits term sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre, Jie Wang, Victor Magron","submitted_at":"2019-12-18T21:29:18Z","abstract_excerpt":"This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08899","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.08899/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpCNe/k8UYU65WxJ7Y+t/LFQT47jTGWE7ICzELgpiR/bMfi9rRKXUtjaDGx4AYHk3HLVkiHzG5asZb4+GcE1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:42:55.125743Z"},"content_sha256":"3ef15839627d89c335cc32b267511dec21823a6f21470777e2a3be0aa01b081c","schema_version":"1.0","event_id":"sha256:3ef15839627d89c335cc32b267511dec21823a6f21470777e2a3be0aa01b081c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/bundle.json","state_url":"https://pith.science/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/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-07-05T14:42:55Z","links":{"resolver":"https://pith.science/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP","bundle":"https://pith.science/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/bundle.json","state":"https://pith.science/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV2CW5B3L25EF4V6OJ6BOEZZSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IV2CW5B3L25EF4V6OJ6BOEZZSP","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":"8f9841a98e236f743a06f933049ac2068c6ed0c36a0c96b2fa3848802b522a71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-18T21:29:18Z","title_canon_sha256":"7ffe6d4a8ebcf3b62dc95cc3f97a2cc0608b055b4e8d11241aad59879556dda2"},"schema_version":"1.0","source":{"id":"1912.08899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.08899","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1912.08899v2","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08899","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"IV2CW5B3L25E","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_16","alias_value":"IV2CW5B3L25EF4V6","created_at":"2026-07-05T01:02:28Z"},{"alias_kind":"pith_short_8","alias_value":"IV2CW5B3","created_at":"2026-07-05T01:02:28Z"}],"graph_snapshots":[{"event_id":"sha256:3ef15839627d89c335cc32b267511dec21823a6f21470777e2a3be0aa01b081c","target":"graph","created_at":"2026-07-05T01:02:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.08899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds","authors_text":"Jean-Bernard Lasserre, Jie Wang, Victor Magron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-18T21:29:18Z","title":"TSSOS: A Moment-SOS hierarchy that exploits term sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08899","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:248a7d8feb85ffa1670137743c9adc0e2ee7a2151b6d24edb1bf63d1e0823c10","target":"record","created_at":"2026-07-05T01:02:28Z","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":"8f9841a98e236f743a06f933049ac2068c6ed0c36a0c96b2fa3848802b522a71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-18T21:29:18Z","title_canon_sha256":"7ffe6d4a8ebcf3b62dc95cc3f97a2cc0608b055b4e8d11241aad59879556dda2"},"schema_version":"1.0","source":{"id":"1912.08899","kind":"arxiv","version":2}},"canonical_sha256":"45742b743b5eba42f2be727c17133993c82b7c9fe1243cf6ebef2cf405bda503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45742b743b5eba42f2be727c17133993c82b7c9fe1243cf6ebef2cf405bda503","first_computed_at":"2026-07-05T01:02:28.903622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:02:28.903622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9nW0sMjrdXNQtUttuA37Tk1NVRY5lZd2h4jlYw+f36bzWUz+ycin+nF+W2YXM52cXXuZSurwMHFGAaqinVQCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:02:28.904107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.08899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:248a7d8feb85ffa1670137743c9adc0e2ee7a2151b6d24edb1bf63d1e0823c10","sha256:3ef15839627d89c335cc32b267511dec21823a6f21470777e2a3be0aa01b081c"],"state_sha256":"0c8fe680b72d381ef29d725b88b9e282d0040772f26c3d25a0942a937e50214d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztd9MOdchlc36LqqPMV8+qp+j+rDe1HWzcZvTopq8PgyVBNUu52FpinQk2/ulfc1I7yginsmTyf3zAcXgTejBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:42:55.128758Z","bundle_sha256":"77d4691fb277d2360af433faa122377c9755f43dd3c45fc759927f2aa2cb9663"}}