{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7QAVCGSCXGC7HMWCYMGMJJDY5M","short_pith_number":"pith:7QAVCGSC","schema_version":"1.0","canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","source":{"kind":"arxiv","id":"1502.01220","version":1},"attestation_state":"computed","paper":{"title":"Unveiling The Tree: A Convex Framework for Sparse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan V. Oppenheim, Tarek A. Lahlou","submitted_at":"2015-02-04T14:54:37Z","abstract_excerpt":"This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. For every pre-walk of the tree an initial set of generally dense feasible solutions is processed in such a way that the sparsity of each solution increases with each generation unveiled. The specific computation performed at any particular child node is shown to correspond to an embedding of a polytope into the polytope received from that nodes paren"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-04T14:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"3d789693becee26a356217892c8f0d4fe01d473d33f3ddb858f000e60ae787dd","abstract_canon_sha256":"0899d6184f7fb945b7a8bb0b3039e90488b482a407116ac9ee63a0b2947a54b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:06.368281Z","signature_b64":"tDMOA2Ra5fvlp5VAYjiAjz1pNdTBHRITl2NjPG30yi0rnJCvCvYbJ9Z62PJv2YemsAxOYsP2E4kc8B+XFxlYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc01511a42b985f3b2c2c30cc4a478eb25a224b52e758affeeef6f6bf5b6dae8","last_reissued_at":"2026-05-18T01:33:06.367732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:06.367732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unveiling The Tree: A Convex Framework for Sparse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan V. Oppenheim, Tarek A. Lahlou","submitted_at":"2015-02-04T14:54:37Z","abstract_excerpt":"This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. For every pre-walk of the tree an initial set of generally dense feasible solutions is processed in such a way that the sparsity of each solution increases with each generation unveiled. The specific computation performed at any particular child node is shown to correspond to an embedding of a polytope into the polytope received from that nodes paren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01220","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.01220","created_at":"2026-05-18T01:33:06.367816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01220v1","created_at":"2026-05-18T01:33:06.367816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01220","created_at":"2026-05-18T01:33:06.367816+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QAVCGSCXGC7","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QAVCGSCXGC7HMWC","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QAVCGSC","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M","json":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M.json","graph_json":"https://pith.science/api/pith-number/7QAVCGSCXGC7HMWCYMGMJJDY5M/graph.json","events_json":"https://pith.science/api/pith-number/7QAVCGSCXGC7HMWCYMGMJJDY5M/events.json","paper":"https://pith.science/paper/7QAVCGSC"},"agent_actions":{"view_html":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M","download_json":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M.json","view_paper":"https://pith.science/paper/7QAVCGSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01220&json=true","fetch_graph":"https://pith.science/api/pith-number/7QAVCGSCXGC7HMWCYMGMJJDY5M/graph.json","fetch_events":"https://pith.science/api/pith-number/7QAVCGSCXGC7HMWCYMGMJJDY5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/action/storage_attestation","attest_author":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/action/author_attestation","sign_citation":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/action/citation_signature","submit_replication":"https://pith.science/pith/7QAVCGSCXGC7HMWCYMGMJJDY5M/action/replication_record"}},"created_at":"2026-05-18T01:33:06.367816+00:00","updated_at":"2026-05-18T01:33:06.367816+00:00"}