{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T7DYFGIY7OUZGM25I4G2MRNWRQ","short_pith_number":"pith:T7DYFGIY","schema_version":"1.0","canonical_sha256":"9fc7829918fba993335d470da645b68c3443214d477df57b7923f6d6a9e1b10f","source":{"kind":"arxiv","id":"2507.23106","version":1},"attestation_state":"computed","paper":{"title":"Efficient inference of dynamic gene regulatory networks using discrete penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.OT"],"primary_cat":"stat.AP","authors_text":"Aaresh Bhathena, Arvind Rao, Salar Fattahi, Visweswaran Ravikumar, Wajd N Al-Holou","submitted_at":"2025-07-30T21:13:26Z","abstract_excerpt":"Gene regulatory networks (GRNs) orchestrate cellular decision making and survival strategies. Inferring the structure of these networks from high-dimensional transcriptomics data is a central challenge in systems biology. Traditional approaches to GRN inference, such as the graphical lasso and its joint extensions, rely on $\\ell_1$ penalty to induce sparsity but can bias network recovery and require extensive hyperparameter tuning. Here, we present a scalable framework for the joint inference of dynamic GRNs using a discrete $\\ell_0$ penalty, enabling direct and unbiased control over network s"},"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":"2507.23106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2025-07-30T21:13:26Z","cross_cats_sorted":["stat.CO","stat.OT"],"title_canon_sha256":"de7610a588740aa7e8b05d04bbdb38dc8d5d2e153b85f1bbe3c8b95e9f4dd734","abstract_canon_sha256":"a3bab5ab954f9d9ae49d767af4547bdd0e1703a3aeb87a0fd9371a444a70fd03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:05.534400Z","signature_b64":"Hn+Y2knQ24rupgTaI/zsh20yTSy2mu6J7aqq/Byeoqt7v97No/71NeBlHzB9rQWMGR8G0/q/KV8xNsxZxIzZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fc7829918fba993335d470da645b68c3443214d477df57b7923f6d6a9e1b10f","last_reissued_at":"2026-07-05T11:46:05.533822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:05.533822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient inference of dynamic gene regulatory networks using discrete penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.OT"],"primary_cat":"stat.AP","authors_text":"Aaresh Bhathena, Arvind Rao, Salar Fattahi, Visweswaran Ravikumar, Wajd N Al-Holou","submitted_at":"2025-07-30T21:13:26Z","abstract_excerpt":"Gene regulatory networks (GRNs) orchestrate cellular decision making and survival strategies. Inferring the structure of these networks from high-dimensional transcriptomics data is a central challenge in systems biology. Traditional approaches to GRN inference, such as the graphical lasso and its joint extensions, rely on $\\ell_1$ penalty to induce sparsity but can bias network recovery and require extensive hyperparameter tuning. Here, we present a scalable framework for the joint inference of dynamic GRNs using a discrete $\\ell_0$ penalty, enabling direct and unbiased control over network s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.23106","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/2507.23106/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":"2507.23106","created_at":"2026-07-05T11:46:05.533890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.23106v1","created_at":"2026-07-05T11:46:05.533890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.23106","created_at":"2026-07-05T11:46:05.533890+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7DYFGIY7OUZ","created_at":"2026-07-05T11:46:05.533890+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7DYFGIY7OUZGM25","created_at":"2026-07-05T11:46:05.533890+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7DYFGIY","created_at":"2026-07-05T11:46:05.533890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01385","citing_title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ","json":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ.json","graph_json":"https://pith.science/api/pith-number/T7DYFGIY7OUZGM25I4G2MRNWRQ/graph.json","events_json":"https://pith.science/api/pith-number/T7DYFGIY7OUZGM25I4G2MRNWRQ/events.json","paper":"https://pith.science/paper/T7DYFGIY"},"agent_actions":{"view_html":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ","download_json":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ.json","view_paper":"https://pith.science/paper/T7DYFGIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.23106&json=true","fetch_graph":"https://pith.science/api/pith-number/T7DYFGIY7OUZGM25I4G2MRNWRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/T7DYFGIY7OUZGM25I4G2MRNWRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ/action/storage_attestation","attest_author":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ/action/author_attestation","sign_citation":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ/action/citation_signature","submit_replication":"https://pith.science/pith/T7DYFGIY7OUZGM25I4G2MRNWRQ/action/replication_record"}},"created_at":"2026-07-05T11:46:05.533890+00:00","updated_at":"2026-07-05T11:46:05.533890+00:00"}