{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YJDIKLDWLGFWNPEWS7AXBFCSDJ","short_pith_number":"pith:YJDIKLDW","schema_version":"1.0","canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","source":{"kind":"arxiv","id":"1104.0623","version":1},"attestation_state":"computed","paper":{"title":"Extension and optimization of the FIND algorithm: computing Green's and less-than Green's functions (with technical appendix)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eric Darve, Song Li","submitted_at":"2011-04-04T16:48:12Z","abstract_excerpt":"The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other matrix inverse related calculations. Those are required for example to calculate the less-than Green's function and the current density through the device. For a 2D device discretized as an N_x x N_y mesh, the best known algorithms have a running time of O(N_x^3 N_y), whereas FIND only requires O(N_x^2 N_y). Even though this complexity has been reduced by an "},"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":"1104.0623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-04T16:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"8cf7b973d00528ce61480dd4bb473efd07f26690a58f4fd0ba361394dd0d4ffa","abstract_canon_sha256":"50e28735d4eb01b47a13d3ef588fa3e373d635754a76eda3ab05bebe1e290b2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:38.361750Z","signature_b64":"ueE7EfxngDem1eCaeTYWSgnUaE0a03fnj3RcO4vIqSikS94dUd8vh8HdEQHUUdiE/cAMYIbBb6+rHBH7YGwKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","last_reissued_at":"2026-05-18T02:02:38.360960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:38.360960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extension and optimization of the FIND algorithm: computing Green's and less-than Green's functions (with technical appendix)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eric Darve, Song Li","submitted_at":"2011-04-04T16:48:12Z","abstract_excerpt":"The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other matrix inverse related calculations. Those are required for example to calculate the less-than Green's function and the current density through the device. For a 2D device discretized as an N_x x N_y mesh, the best known algorithms have a running time of O(N_x^3 N_y), whereas FIND only requires O(N_x^2 N_y). Even though this complexity has been reduced by an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0623","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":"1104.0623","created_at":"2026-05-18T02:02:38.361073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0623v1","created_at":"2026-05-18T02:02:38.361073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0623","created_at":"2026-05-18T02:02:38.361073+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJDIKLDWLGFW","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJDIKLDWLGFWNPEW","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJDIKLDW","created_at":"2026-05-18T12:26:47.523578+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/YJDIKLDWLGFWNPEWS7AXBFCSDJ","json":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ.json","graph_json":"https://pith.science/api/pith-number/YJDIKLDWLGFWNPEWS7AXBFCSDJ/graph.json","events_json":"https://pith.science/api/pith-number/YJDIKLDWLGFWNPEWS7AXBFCSDJ/events.json","paper":"https://pith.science/paper/YJDIKLDW"},"agent_actions":{"view_html":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ","download_json":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ.json","view_paper":"https://pith.science/paper/YJDIKLDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0623&json=true","fetch_graph":"https://pith.science/api/pith-number/YJDIKLDWLGFWNPEWS7AXBFCSDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YJDIKLDWLGFWNPEWS7AXBFCSDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/action/storage_attestation","attest_author":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/action/author_attestation","sign_citation":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/action/citation_signature","submit_replication":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/action/replication_record"}},"created_at":"2026-05-18T02:02:38.361073+00:00","updated_at":"2026-05-18T02:02:38.361073+00:00"}