{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LZW2JS7JX2AKCKII2KNWHN2IJG","short_pith_number":"pith:LZW2JS7J","schema_version":"1.0","canonical_sha256":"5e6da4cbe9be80a12908d29b63b74849a1264ae88c4b225a9070c597724c3439","source":{"kind":"arxiv","id":"1303.1754","version":2},"attestation_state":"computed","paper":{"title":"On the minimum FLOPs problem in the sparse Cholesky factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NA","authors_text":"Esmond Ng, Robert Luce","submitted_at":"2013-03-07T17:17:47Z","abstract_excerpt":"Prior to computing the Cholesky factorization of a sparse, symmetric positive definite matrix, a reordering of the rows and columns is computed so as to reduce both the number of fill elements in Cholesky factor and the number of arithmetic operations (FLOPs) in the numerical factorization. These two metrics are clearly somehow related and yet it is suspected that these two problems are different. However, no rigorous theoretical treatment of the relation of these two problems seems to have been given yet. In this paper we show by means of an explicit, scalable construction that the two proble"},"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":"1303.1754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-03-07T17:17:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a304a91743e69f616d7db768be457ec191f9ed99238dfa156224a6b4e79901ab","abstract_canon_sha256":"41fae2eb7116ab85f17d6dc4726c52011492a8369befe28d7ead926d96523dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:46.732032Z","signature_b64":"wtSRCc9XTXuOOy6i2nuCn8/0cj6Lx3UjUh3ktNgWar1dPN6g1Z6VgDNbjcUs1zdbzp8kt+b7Ro0pZdi67cfvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6da4cbe9be80a12908d29b63b74849a1264ae88c4b225a9070c597724c3439","last_reissued_at":"2026-05-18T03:01:46.731350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:46.731350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimum FLOPs problem in the sparse Cholesky factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NA","authors_text":"Esmond Ng, Robert Luce","submitted_at":"2013-03-07T17:17:47Z","abstract_excerpt":"Prior to computing the Cholesky factorization of a sparse, symmetric positive definite matrix, a reordering of the rows and columns is computed so as to reduce both the number of fill elements in Cholesky factor and the number of arithmetic operations (FLOPs) in the numerical factorization. These two metrics are clearly somehow related and yet it is suspected that these two problems are different. However, no rigorous theoretical treatment of the relation of these two problems seems to have been given yet. In this paper we show by means of an explicit, scalable construction that the two proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1754","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.1754","created_at":"2026-05-18T03:01:46.731450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1754v2","created_at":"2026-05-18T03:01:46.731450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1754","created_at":"2026-05-18T03:01:46.731450+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZW2JS7JX2AK","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZW2JS7JX2AKCKII","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZW2JS7J","created_at":"2026-05-18T12:27:51.066281+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/LZW2JS7JX2AKCKII2KNWHN2IJG","json":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG.json","graph_json":"https://pith.science/api/pith-number/LZW2JS7JX2AKCKII2KNWHN2IJG/graph.json","events_json":"https://pith.science/api/pith-number/LZW2JS7JX2AKCKII2KNWHN2IJG/events.json","paper":"https://pith.science/paper/LZW2JS7J"},"agent_actions":{"view_html":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG","download_json":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG.json","view_paper":"https://pith.science/paper/LZW2JS7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1754&json=true","fetch_graph":"https://pith.science/api/pith-number/LZW2JS7JX2AKCKII2KNWHN2IJG/graph.json","fetch_events":"https://pith.science/api/pith-number/LZW2JS7JX2AKCKII2KNWHN2IJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG/action/storage_attestation","attest_author":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG/action/author_attestation","sign_citation":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG/action/citation_signature","submit_replication":"https://pith.science/pith/LZW2JS7JX2AKCKII2KNWHN2IJG/action/replication_record"}},"created_at":"2026-05-18T03:01:46.731450+00:00","updated_at":"2026-05-18T03:01:46.731450+00:00"}