{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YJDIKLDWLGFWNPEWS7AXBFCSDJ","short_pith_number":"pith:YJDIKLDW","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"},"canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","source":{"kind":"arxiv","id":"1104.0623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0623","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0623v1","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0623","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"YJDIKLDWLGFW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YJDIKLDWLGFWNPEW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YJDIKLDW","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YJDIKLDWLGFWNPEWS7AXBFCSDJ","target":"record","payload":{"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"},"canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","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"},"source_kind":"arxiv","source_id":"1104.0623","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LV867FZqao4a6KAn3Y8yCXn0yJyABcEIz0RGx/0+1bFol5hU5laVglGRCyX4OFpT6rcSGKg1if4/8jnddpxJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:15.792693Z"},"content_sha256":"177fbcb9c38f65e3a986f51da12147066490418160788b821d150cbdcab91815","schema_version":"1.0","event_id":"sha256:177fbcb9c38f65e3a986f51da12147066490418160788b821d150cbdcab91815"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YJDIKLDWLGFWNPEWS7AXBFCSDJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQR+OCkcB9C9TSwtMmL6DY77DHlajby/fNzbICBtoz+BV5uKs1RnBt57BA+QfeKMm8qaXJ/1wgCliXgKLl6+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:15.793396Z"},"content_sha256":"5e1ca4575b8bbd3f2bc0b55d44abd60b70ed9015c89157bac4ca0b9a1594fdd0","schema_version":"1.0","event_id":"sha256:5e1ca4575b8bbd3f2bc0b55d44abd60b70ed9015c89157bac4ca0b9a1594fdd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/bundle.json","state_url":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T02:31:15Z","links":{"resolver":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ","bundle":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/bundle.json","state":"https://pith.science/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJDIKLDWLGFWNPEWS7AXBFCSDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YJDIKLDWLGFWNPEWS7AXBFCSDJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50e28735d4eb01b47a13d3ef588fa3e373d635754a76eda3ab05bebe1e290b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-04T16:48:12Z","title_canon_sha256":"8cf7b973d00528ce61480dd4bb473efd07f26690a58f4fd0ba361394dd0d4ffa"},"schema_version":"1.0","source":{"id":"1104.0623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0623","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0623v1","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0623","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"YJDIKLDWLGFW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YJDIKLDWLGFWNPEW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YJDIKLDW","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:5e1ca4575b8bbd3f2bc0b55d44abd60b70ed9015c89157bac4ca0b9a1594fdd0","target":"graph","created_at":"2026-05-18T02:02:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Eric Darve, Song Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-04T16:48:12Z","title":"Extension and optimization of the FIND algorithm: computing Green's and less-than Green's functions (with technical appendix)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0623","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:177fbcb9c38f65e3a986f51da12147066490418160788b821d150cbdcab91815","target":"record","created_at":"2026-05-18T02:02:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50e28735d4eb01b47a13d3ef588fa3e373d635754a76eda3ab05bebe1e290b2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-04T16:48:12Z","title_canon_sha256":"8cf7b973d00528ce61480dd4bb473efd07f26690a58f4fd0ba361394dd0d4ffa"},"schema_version":"1.0","source":{"id":"1104.0623","kind":"arxiv","version":1}},"canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c246852c76598b66bc9697c17094521a50a4ce9d4151b98bc93e62a32d0e2057","first_computed_at":"2026-05-18T02:02:38.360960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:38.360960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ueE7EfxngDem1eCaeTYWSgnUaE0a03fnj3RcO4vIqSikS94dUd8vh8HdEQHUUdiE/cAMYIbBb6+rHBH7YGwKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:38.361750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:177fbcb9c38f65e3a986f51da12147066490418160788b821d150cbdcab91815","sha256:5e1ca4575b8bbd3f2bc0b55d44abd60b70ed9015c89157bac4ca0b9a1594fdd0"],"state_sha256":"9be3d70db8ce188c9dbfd02d83cdb7e18c190b45baae1707e8096791223d3f6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwqOZJvim7FEF+WwoImIjV8f/Otxylvvb3/lKZ3aUhL8MJxVLvxNTNRqiGQ1MJWZfxaWvJGnZXsJRg1VtKvyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:31:15.797527Z","bundle_sha256":"4c49ea66738a6d3dca621a6d1d8b49b69bb2ad24e5b7fb6502a15b4015637269"}}