{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RIRJUMKNO3UP25XHRDRSSEJ73S","short_pith_number":"pith:RIRJUMKN","canonical_record":{"source":{"id":"1408.1693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-08T05:15:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0c7c94d1b1a95d7fbe5983a754b435959c0edd1154ace0ea81255a8e6d9181f","abstract_canon_sha256":"15d2b24f601c6f54457c7f33460607f52ec7d8f8d25d5b613c3fc459e951c84e"},"schema_version":"1.0"},"canonical_sha256":"8a229a314d76e8fd76e788e329113fdcaf8aa3972fc388067d6dd3399478876a","source":{"kind":"arxiv","id":"1408.1693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1693","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1693v1","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1693","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"RIRJUMKNO3UP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIRJUMKNO3UP25XH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIRJUMKN","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RIRJUMKNO3UP25XHRDRSSEJ73S","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-08T05:15:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0c7c94d1b1a95d7fbe5983a754b435959c0edd1154ace0ea81255a8e6d9181f","abstract_canon_sha256":"15d2b24f601c6f54457c7f33460607f52ec7d8f8d25d5b613c3fc459e951c84e"},"schema_version":"1.0"},"canonical_sha256":"8a229a314d76e8fd76e788e329113fdcaf8aa3972fc388067d6dd3399478876a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.214766Z","signature_b64":"f2PxlPKvispU6Ld63qLyFdD6V3KipHRSGJ+CzIdJN8ZxbiwnsvRjveDKLyT7wnv9CeIK55GjNj+S7h0JRKkdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a229a314d76e8fd76e788e329113fdcaf8aa3972fc388067d6dd3399478876a","last_reissued_at":"2026-05-18T02:45:39.214276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.214276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1693","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:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmu6H9Ls07GpYTHy//MZDzrhW+fKUNhya2tggKoJuY7Seigjm+6MJP5hbBOWie6T78JawY6Gg0esr6EYljTsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:12:03.024841Z"},"content_sha256":"578501e3e3e2580bd0dc0debccfdc7c49555c6ce910300762cb1ee6ba162440e","schema_version":"1.0","event_id":"sha256:578501e3e3e2580bd0dc0debccfdc7c49555c6ce910300762cb1ee6ba162440e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RIRJUMKNO3UP25XHRDRSSEJ73S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the log-determinant of symmetric, diagonally dominant matrices in near-linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Ahmed El Alaoui, Alexandre Bayen, Timothy Hunter","submitted_at":"2014-08-08T05:15:37Z","abstract_excerpt":"We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high probability. This algorithm builds upon the utra-sparsifiers introduced by Spielman and Teng for Laplacian matrices and ultimately uses their refined versions introduced by Koutis, Miller and Peng in the context of solving linear systems. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1693","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:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVRJgIUpM8cP9G/W8yApWfmr3RB95VgB0Ot9zUbiOl6RKEDSoA7HPZKb0yNNXcxWpFMPRLz4t6WYgPrIILSzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:12:03.025187Z"},"content_sha256":"78d6ffa720f86221a4402022d753025e8349d76f07971eeedc5b112236e72fc8","schema_version":"1.0","event_id":"sha256:78d6ffa720f86221a4402022d753025e8349d76f07971eeedc5b112236e72fc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/bundle.json","state_url":"https://pith.science/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/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-05-30T12:12:03Z","links":{"resolver":"https://pith.science/pith/RIRJUMKNO3UP25XHRDRSSEJ73S","bundle":"https://pith.science/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/bundle.json","state":"https://pith.science/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIRJUMKNO3UP25XHRDRSSEJ73S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RIRJUMKNO3UP25XHRDRSSEJ73S","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":"15d2b24f601c6f54457c7f33460607f52ec7d8f8d25d5b613c3fc459e951c84e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-08T05:15:37Z","title_canon_sha256":"b0c7c94d1b1a95d7fbe5983a754b435959c0edd1154ace0ea81255a8e6d9181f"},"schema_version":"1.0","source":{"id":"1408.1693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1693","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1693v1","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1693","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"RIRJUMKNO3UP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIRJUMKNO3UP25XH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIRJUMKN","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:78d6ffa720f86221a4402022d753025e8349d76f07971eeedc5b112236e72fc8","target":"graph","created_at":"2026-05-18T02:45:39Z","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":"We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high probability. This algorithm builds upon the utra-sparsifiers introduced by Spielman and Teng for Laplacian matrices and ultimately uses their refined versions introduced by Koutis, Miller and Peng in the context of solving linear systems. We also p","authors_text":"Ahmed El Alaoui, Alexandre Bayen, Timothy Hunter","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-08T05:15:37Z","title":"Computing the log-determinant of symmetric, diagonally dominant matrices in near-linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1693","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:578501e3e3e2580bd0dc0debccfdc7c49555c6ce910300762cb1ee6ba162440e","target":"record","created_at":"2026-05-18T02:45:39Z","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":"15d2b24f601c6f54457c7f33460607f52ec7d8f8d25d5b613c3fc459e951c84e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-08T05:15:37Z","title_canon_sha256":"b0c7c94d1b1a95d7fbe5983a754b435959c0edd1154ace0ea81255a8e6d9181f"},"schema_version":"1.0","source":{"id":"1408.1693","kind":"arxiv","version":1}},"canonical_sha256":"8a229a314d76e8fd76e788e329113fdcaf8aa3972fc388067d6dd3399478876a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a229a314d76e8fd76e788e329113fdcaf8aa3972fc388067d6dd3399478876a","first_computed_at":"2026-05-18T02:45:39.214276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:39.214276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f2PxlPKvispU6Ld63qLyFdD6V3KipHRSGJ+CzIdJN8ZxbiwnsvRjveDKLyT7wnv9CeIK55GjNj+S7h0JRKkdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:39.214766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:578501e3e3e2580bd0dc0debccfdc7c49555c6ce910300762cb1ee6ba162440e","sha256:78d6ffa720f86221a4402022d753025e8349d76f07971eeedc5b112236e72fc8"],"state_sha256":"d245a6f853ac46a4a14f74bb02b000749d25259bd5e4f43a38ce86adcb5c9e8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GC/qG5s5Pd34yrpdpup8e6BjRCCp3tvLbpWLA5dHHB9vhrt0s1SfGMkMI8ub8RQBeRMdWbwHo4TWKg4Z7+vwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:12:03.027198Z","bundle_sha256":"43d15a161baf5295d47897bf89af22a94c01ce86598a0e644d192b309694c0b7"}}