{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B45CMJZCW7ITSD33S6GH6MNP63","short_pith_number":"pith:B45CMJZC","canonical_record":{"source":{"id":"1311.5871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-22T20:29:38Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"4f727f13a80281ba518b4316819606b7ab1d83aaf9e9761275bc803933a090b2","abstract_canon_sha256":"c19c714b51c38e095e6fea892e79b573f9db19abddf224a9f0b14ed3b4534164"},"schema_version":"1.0"},"canonical_sha256":"0f3a262722b7d1390f7b978c7f31aff6f69a8bd045ee3cf5e41a429b49ff9e6f","source":{"kind":"arxiv","id":"1311.5871","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5871","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5871v2","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5871","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"B45CMJZCW7IT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B45CMJZCW7ITSD33","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B45CMJZC","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B45CMJZCW7ITSD33S6GH6MNP63","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-22T20:29:38Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"4f727f13a80281ba518b4316819606b7ab1d83aaf9e9761275bc803933a090b2","abstract_canon_sha256":"c19c714b51c38e095e6fea892e79b573f9db19abddf224a9f0b14ed3b4534164"},"schema_version":"1.0"},"canonical_sha256":"0f3a262722b7d1390f7b978c7f31aff6f69a8bd045ee3cf5e41a429b49ff9e6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:31.427491Z","signature_b64":"dS8Zdp2wmTU/8MO8mccnTOXf6WRv0ene6EQ0W3p2+zYHTTqM+hEZSgG2d5aUCv+i31hb6A8/UN8PSW8rhI+cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f3a262722b7d1390f7b978c7f31aff6f69a8bd045ee3cf5e41a429b49ff9e6f","last_reissued_at":"2026-05-18T02:47:31.426969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:31.426969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5871","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-05-18T02:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/dY+DCGbCJR0LqPlCqobv7lFc98hsCr6uw6iONrgw8ntIX+MFcsBM7iA9JnnMjkG5qxuEl+7fcTPx7OEpHvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:30:53.885208Z"},"content_sha256":"a9e99ceac7493603bc369e12efa616e9a4bc21de6b15f8b7f639059546b06c31","schema_version":"1.0","event_id":"sha256:a9e99ceac7493603bc369e12efa616e9a4bc21de6b15f8b7f639059546b06c31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B45CMJZCW7ITSD33S6GH6MNP63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding sparse solutions of systems of polynomial equations via group-sparsity optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Fabien Lauer (LORIA), Henrik Ohlsson","submitted_at":"2013-11-22T20:29:38Z","abstract_excerpt":"The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse solutions. The first one is based on a convex relaxation resulting in a second-order cone programming formulation which can benefit from efficient reweighting techniques for sparsity enhancement. For this approach, sufficient conditions for the exact recovery of the sparsest solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5871","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":""},"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:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZz0JdsOF4n7FH5e/RehK1Qxi4lrlg0TJL3JS3KTT+5nbHjqFxSbqVmd+stYjdb+Tz05Zwfjr3A7oO9tNYJmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:30:53.885866Z"},"content_sha256":"c4bb23680aa3405fa7413c61fa97d11ec4cf590666ee83306808dfa00fefa29e","schema_version":"1.0","event_id":"sha256:c4bb23680aa3405fa7413c61fa97d11ec4cf590666ee83306808dfa00fefa29e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B45CMJZCW7ITSD33S6GH6MNP63/bundle.json","state_url":"https://pith.science/pith/B45CMJZCW7ITSD33S6GH6MNP63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B45CMJZCW7ITSD33S6GH6MNP63/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-27T02:30:53Z","links":{"resolver":"https://pith.science/pith/B45CMJZCW7ITSD33S6GH6MNP63","bundle":"https://pith.science/pith/B45CMJZCW7ITSD33S6GH6MNP63/bundle.json","state":"https://pith.science/pith/B45CMJZCW7ITSD33S6GH6MNP63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B45CMJZCW7ITSD33S6GH6MNP63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B45CMJZCW7ITSD33S6GH6MNP63","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":"c19c714b51c38e095e6fea892e79b573f9db19abddf224a9f0b14ed3b4534164","cross_cats_sorted":["cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-22T20:29:38Z","title_canon_sha256":"4f727f13a80281ba518b4316819606b7ab1d83aaf9e9761275bc803933a090b2"},"schema_version":"1.0","source":{"id":"1311.5871","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5871","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5871v2","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5871","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"B45CMJZCW7IT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B45CMJZCW7ITSD33","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B45CMJZC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c4bb23680aa3405fa7413c61fa97d11ec4cf590666ee83306808dfa00fefa29e","target":"graph","created_at":"2026-05-18T02:47:31Z","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":"The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse solutions. The first one is based on a convex relaxation resulting in a second-order cone programming formulation which can benefit from efficient reweighting techniques for sparsity enhancement. For this approach, sufficient conditions for the exact recovery of the sparsest solutio","authors_text":"Fabien Lauer (LORIA), Henrik Ohlsson","cross_cats":["cs.LG","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-22T20:29:38Z","title":"Finding sparse solutions of systems of polynomial equations via group-sparsity optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5871","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:a9e99ceac7493603bc369e12efa616e9a4bc21de6b15f8b7f639059546b06c31","target":"record","created_at":"2026-05-18T02:47:31Z","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":"c19c714b51c38e095e6fea892e79b573f9db19abddf224a9f0b14ed3b4534164","cross_cats_sorted":["cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-22T20:29:38Z","title_canon_sha256":"4f727f13a80281ba518b4316819606b7ab1d83aaf9e9761275bc803933a090b2"},"schema_version":"1.0","source":{"id":"1311.5871","kind":"arxiv","version":2}},"canonical_sha256":"0f3a262722b7d1390f7b978c7f31aff6f69a8bd045ee3cf5e41a429b49ff9e6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f3a262722b7d1390f7b978c7f31aff6f69a8bd045ee3cf5e41a429b49ff9e6f","first_computed_at":"2026-05-18T02:47:31.426969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:31.426969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dS8Zdp2wmTU/8MO8mccnTOXf6WRv0ene6EQ0W3p2+zYHTTqM+hEZSgG2d5aUCv+i31hb6A8/UN8PSW8rhI+cDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:31.427491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5871","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9e99ceac7493603bc369e12efa616e9a4bc21de6b15f8b7f639059546b06c31","sha256:c4bb23680aa3405fa7413c61fa97d11ec4cf590666ee83306808dfa00fefa29e"],"state_sha256":"ed413dc1e8458bc4e564045cafc0a79db65712186f76c5246f52c22b1e3c2479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snTYzh7ZQ/pnZ1cLUZrWLOBcdDk4U74GbheBVS7oO8wsX71z3jPPcaoa4/33VIXQthuZaWIEeijpAYQ20UGnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:30:53.889189Z","bundle_sha256":"2f10b731fde3e6803be126d5522bda16d9357ae2b1001861be825198765d1621"}}