{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EOXIKR5VBEI2EE6Z6AM2ZCJOKH","short_pith_number":"pith:EOXIKR5V","canonical_record":{"source":{"id":"2010.06956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-14T11:03:48Z","cross_cats_sorted":[],"title_canon_sha256":"c95fc3298ba88bfd3b6ef1a1b2af0f9e44f80843fed2b789492a60e47d514081","abstract_canon_sha256":"ff26d6174c1f436a15778b2371f80a6c6a1611251a6d2013fc9bc054415a04e5"},"schema_version":"1.0"},"canonical_sha256":"23ae8547b50911a213d9f019ac892e51c539a160cc1f04c4b17eb5ab42c33dd2","source":{"kind":"arxiv","id":"2010.06956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06956","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06956v1","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06956","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"EOXIKR5VBEI2","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_16","alias_value":"EOXIKR5VBEI2EE6Z","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_8","alias_value":"EOXIKR5V","created_at":"2026-07-05T01:43:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EOXIKR5VBEI2EE6Z6AM2ZCJOKH","target":"record","payload":{"canonical_record":{"source":{"id":"2010.06956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-14T11:03:48Z","cross_cats_sorted":[],"title_canon_sha256":"c95fc3298ba88bfd3b6ef1a1b2af0f9e44f80843fed2b789492a60e47d514081","abstract_canon_sha256":"ff26d6174c1f436a15778b2371f80a6c6a1611251a6d2013fc9bc054415a04e5"},"schema_version":"1.0"},"canonical_sha256":"23ae8547b50911a213d9f019ac892e51c539a160cc1f04c4b17eb5ab42c33dd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:01.357803Z","signature_b64":"9n5M21Di8qaF1Y++zzgoIeNV+gLpsSJz9d0gEwWDuAX5b3LEYEzknImbFkWEDZfVKv6XCfUTqH6SChfN9WDPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ae8547b50911a213d9f019ac892e51c539a160cc1f04c4b17eb5ab42c33dd2","last_reissued_at":"2026-07-05T01:43:01.357381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:01.357381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.06956","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-07-05T01:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCho0zHx/asLtquCFKYcXrsjZmEjlXlgF+VX0mBI6A8uWFar1GL+3pe1L2z8JID8iKqfdrpqTiqh7hlu23puDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:40:39.338544Z"},"content_sha256":"0cd7f42b6ebfc3a768ec156b6799ce1814c5798de9e03ea0f134acc0e2d08fe2","schema_version":"1.0","event_id":"sha256:0cd7f42b6ebfc3a768ec156b6799ce1814c5798de9e03ea0f134acc0e2d08fe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EOXIKR5VBEI2EE6Z6AM2ZCJOKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting term sparsity in Noncommutative Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Wang, Victor Magron","submitted_at":"2020-10-14T11:03:48Z","abstract_excerpt":"We provide a new hierarchy of semidefinite programming relaxations, called NCTSSOS, to solve large-scale sparse noncommutative polynomial optimization problems. This hierarchy features the exploitation of term sparsity hidden in the input data for eigenvalue and trace optimization problems. NCTSSOS complements the recent work that exploits correlative sparsity for noncommutative optimization problems by Klep, Magron and Povh in arXiv:1909.00569, and is the noncommutative analogue of the TSSOS framework by Wang, Magron and Lasserre in arXiv:1912.08899. We also propose an extension exploiting si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.06956/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:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKtV/DhC4i59Y6czs/en/rRwDPJBWx7VHnooYp8iHGuF89G6Dgq6xvJs5/kYEwtDP8kJpRuwW7golSfXSHk/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:40:39.338920Z"},"content_sha256":"b037898fe267d8d459d8c95c34f853eface7f68ee93acda4eed9159ec8ec9ffc","schema_version":"1.0","event_id":"sha256:b037898fe267d8d459d8c95c34f853eface7f68ee93acda4eed9159ec8ec9ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/bundle.json","state_url":"https://pith.science/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/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:40:39Z","links":{"resolver":"https://pith.science/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH","bundle":"https://pith.science/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/bundle.json","state":"https://pith.science/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOXIKR5VBEI2EE6Z6AM2ZCJOKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EOXIKR5VBEI2EE6Z6AM2ZCJOKH","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":"ff26d6174c1f436a15778b2371f80a6c6a1611251a6d2013fc9bc054415a04e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-14T11:03:48Z","title_canon_sha256":"c95fc3298ba88bfd3b6ef1a1b2af0f9e44f80843fed2b789492a60e47d514081"},"schema_version":"1.0","source":{"id":"2010.06956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06956","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06956v1","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06956","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"EOXIKR5VBEI2","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_16","alias_value":"EOXIKR5VBEI2EE6Z","created_at":"2026-07-05T01:43:01Z"},{"alias_kind":"pith_short_8","alias_value":"EOXIKR5V","created_at":"2026-07-05T01:43:01Z"}],"graph_snapshots":[{"event_id":"sha256:b037898fe267d8d459d8c95c34f853eface7f68ee93acda4eed9159ec8ec9ffc","target":"graph","created_at":"2026-07-05T01:43:01Z","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/2010.06956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide a new hierarchy of semidefinite programming relaxations, called NCTSSOS, to solve large-scale sparse noncommutative polynomial optimization problems. This hierarchy features the exploitation of term sparsity hidden in the input data for eigenvalue and trace optimization problems. NCTSSOS complements the recent work that exploits correlative sparsity for noncommutative optimization problems by Klep, Magron and Povh in arXiv:1909.00569, and is the noncommutative analogue of the TSSOS framework by Wang, Magron and Lasserre in arXiv:1912.08899. We also propose an extension exploiting si","authors_text":"Jie Wang, Victor Magron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-14T11:03:48Z","title":"Exploiting term sparsity in Noncommutative Polynomial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06956","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:0cd7f42b6ebfc3a768ec156b6799ce1814c5798de9e03ea0f134acc0e2d08fe2","target":"record","created_at":"2026-07-05T01:43:01Z","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":"ff26d6174c1f436a15778b2371f80a6c6a1611251a6d2013fc9bc054415a04e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-14T11:03:48Z","title_canon_sha256":"c95fc3298ba88bfd3b6ef1a1b2af0f9e44f80843fed2b789492a60e47d514081"},"schema_version":"1.0","source":{"id":"2010.06956","kind":"arxiv","version":1}},"canonical_sha256":"23ae8547b50911a213d9f019ac892e51c539a160cc1f04c4b17eb5ab42c33dd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23ae8547b50911a213d9f019ac892e51c539a160cc1f04c4b17eb5ab42c33dd2","first_computed_at":"2026-07-05T01:43:01.357381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:43:01.357381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9n5M21Di8qaF1Y++zzgoIeNV+gLpsSJz9d0gEwWDuAX5b3LEYEzknImbFkWEDZfVKv6XCfUTqH6SChfN9WDPCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:43:01.357803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.06956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cd7f42b6ebfc3a768ec156b6799ce1814c5798de9e03ea0f134acc0e2d08fe2","sha256:b037898fe267d8d459d8c95c34f853eface7f68ee93acda4eed9159ec8ec9ffc"],"state_sha256":"9b77376e9d854e09ecaf3b5fbe8c161aa7594e0b4e67f5ef2e0d44c0d59347bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhQTITiSeWDQ3Jwm73gjrnqvR0ikO6SEYBZ0W6Otd+4LIp69Qfscngyq3AdMMhiN/s+wfWR7TEK9CFOGzVxADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:40:39.341139Z","bundle_sha256":"eae74f4689ddefc4edcf59d40d7e41d75ebdaa75ab2151dc2ad5fb4d77c18447"}}