{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:36FA7LDT5ORU5BQHCBIG534RUR","short_pith_number":"pith:36FA7LDT","schema_version":"1.0","canonical_sha256":"df8a0fac73eba34e860710506eef91a46f527d16465fbe9452bfa0e5804f31ae","source":{"kind":"arxiv","id":"1510.07675","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Interpretation of the LDU Decomposition of Totally Positive Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Muhammad El Gebali, Nermine El-Sissi","submitted_at":"2015-10-26T20:53:22Z","abstract_excerpt":"We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Zelvinsky and Fomin. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix."},"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":"1510.07675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-26T20:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"1d2a952e928b51f86bdac01b74a4f0831ea85ff834d2b1d39c3c788035dca3e2","abstract_canon_sha256":"9ec0b39f469b5d921b86933a84fec70342c4385c789b5bfe5ec9392bbfb03377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.914793Z","signature_b64":"hx6gwHoGo4teU8fWf2qg/fy/vrNimGwumRnWs6Eg40vwZAKSw5C7rkNFX7UPLyGFrLem+ThnhYseXi3z9jAmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8a0fac73eba34e860710506eef91a46f527d16465fbe9452bfa0e5804f31ae","last_reissued_at":"2026-05-18T01:29:12.914036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.914036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Interpretation of the LDU Decomposition of Totally Positive Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Muhammad El Gebali, Nermine El-Sissi","submitted_at":"2015-10-26T20:53:22Z","abstract_excerpt":"We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Zelvinsky and Fomin. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07675","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":"1510.07675","created_at":"2026-05-18T01:29:12.914165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07675v1","created_at":"2026-05-18T01:29:12.914165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07675","created_at":"2026-05-18T01:29:12.914165+00:00"},{"alias_kind":"pith_short_12","alias_value":"36FA7LDT5ORU","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"36FA7LDT5ORU5BQH","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"36FA7LDT","created_at":"2026-05-18T12:29:02.477457+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/36FA7LDT5ORU5BQHCBIG534RUR","json":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR.json","graph_json":"https://pith.science/api/pith-number/36FA7LDT5ORU5BQHCBIG534RUR/graph.json","events_json":"https://pith.science/api/pith-number/36FA7LDT5ORU5BQHCBIG534RUR/events.json","paper":"https://pith.science/paper/36FA7LDT"},"agent_actions":{"view_html":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR","download_json":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR.json","view_paper":"https://pith.science/paper/36FA7LDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07675&json=true","fetch_graph":"https://pith.science/api/pith-number/36FA7LDT5ORU5BQHCBIG534RUR/graph.json","fetch_events":"https://pith.science/api/pith-number/36FA7LDT5ORU5BQHCBIG534RUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR/action/storage_attestation","attest_author":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR/action/author_attestation","sign_citation":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR/action/citation_signature","submit_replication":"https://pith.science/pith/36FA7LDT5ORU5BQHCBIG534RUR/action/replication_record"}},"created_at":"2026-05-18T01:29:12.914165+00:00","updated_at":"2026-05-18T01:29:12.914165+00:00"}