{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BX3FDAREZNK5G2NN7LPF5JWOZK","short_pith_number":"pith:BX3FDARE","schema_version":"1.0","canonical_sha256":"0df6518224cb55d369adfade5ea6cecaaaa2df0c29d52749a700036ac466dcfd","source":{"kind":"arxiv","id":"2509.00342","version":1},"attestation_state":"computed","paper":{"title":"Signal Lasso with Non-Convex Penalties for Efficient Network Reconstruction and Topology Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chen Shen, Huaiyu Tan, Jie Hu, Lei Shi, Libin Jin, Wei Zhong","submitted_at":"2025-08-30T03:50:45Z","abstract_excerpt":"Inferring network structures remains an interesting question for its importance on the understanding and controlling collective dynamics of complex systems. The existing shrinking methods such as Lasso-type estimation can not suitably reveal such property. A new method recently suggested, called by {\\it signal lasso} (or its updating version: adaptive signal lasso) was proposed to solve the network reconstruction problem, where the signal parameter can be shrunk to either 0 or 1 in two different directions. The signal lasso or adaptive signal lasso employed the additive penalty of signal and n"},"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":"2509.00342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-08-30T03:50:45Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0372b886fb77350e18df6ab894b43a82f058f42ec1b31cb6f8c268dd5a05a7a5","abstract_canon_sha256":"67833abc1f736c88c113cb6e6a63d10b43c86f1da7b4630526b92c6e223813f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:14.076077Z","signature_b64":"S2c7OInYCu+Rn3Vp7eMoYnJDa5y4hWCBIjYbL2XuohQ9ZgYdPYShPrNszuPubqdGrAii8S6ACjso0oRY9pb8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df6518224cb55d369adfade5ea6cecaaaa2df0c29d52749a700036ac466dcfd","last_reissued_at":"2026-07-05T12:02:14.075409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:14.075409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signal Lasso with Non-Convex Penalties for Efficient Network Reconstruction and Topology Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Chen Shen, Huaiyu Tan, Jie Hu, Lei Shi, Libin Jin, Wei Zhong","submitted_at":"2025-08-30T03:50:45Z","abstract_excerpt":"Inferring network structures remains an interesting question for its importance on the understanding and controlling collective dynamics of complex systems. The existing shrinking methods such as Lasso-type estimation can not suitably reveal such property. A new method recently suggested, called by {\\it signal lasso} (or its updating version: adaptive signal lasso) was proposed to solve the network reconstruction problem, where the signal parameter can be shrunk to either 0 or 1 in two different directions. The signal lasso or adaptive signal lasso employed the additive penalty of signal and n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00342","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/2509.00342/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.00342","created_at":"2026-07-05T12:02:14.075480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.00342v1","created_at":"2026-07-05T12:02:14.075480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00342","created_at":"2026-07-05T12:02:14.075480+00:00"},{"alias_kind":"pith_short_12","alias_value":"BX3FDAREZNK5","created_at":"2026-07-05T12:02:14.075480+00:00"},{"alias_kind":"pith_short_16","alias_value":"BX3FDAREZNK5G2NN","created_at":"2026-07-05T12:02:14.075480+00:00"},{"alias_kind":"pith_short_8","alias_value":"BX3FDARE","created_at":"2026-07-05T12:02:14.075480+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00342","citing_title":"Signal Lasso with Non-Convex Penalties for Efficient Network Reconstruction and Topology Inference","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK","json":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK.json","graph_json":"https://pith.science/api/pith-number/BX3FDAREZNK5G2NN7LPF5JWOZK/graph.json","events_json":"https://pith.science/api/pith-number/BX3FDAREZNK5G2NN7LPF5JWOZK/events.json","paper":"https://pith.science/paper/BX3FDARE"},"agent_actions":{"view_html":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK","download_json":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK.json","view_paper":"https://pith.science/paper/BX3FDARE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.00342&json=true","fetch_graph":"https://pith.science/api/pith-number/BX3FDAREZNK5G2NN7LPF5JWOZK/graph.json","fetch_events":"https://pith.science/api/pith-number/BX3FDAREZNK5G2NN7LPF5JWOZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK/action/storage_attestation","attest_author":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK/action/author_attestation","sign_citation":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK/action/citation_signature","submit_replication":"https://pith.science/pith/BX3FDAREZNK5G2NN7LPF5JWOZK/action/replication_record"}},"created_at":"2026-07-05T12:02:14.075480+00:00","updated_at":"2026-07-05T12:02:14.075480+00:00"}