{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X6E5LMTVXZNLX7ZWAWXZUCWPV7","short_pith_number":"pith:X6E5LMTV","schema_version":"1.0","canonical_sha256":"bf89d5b275be5abbff3605af9a0acfaff8db8695ab71b676c5dd5320ccba48c6","source":{"kind":"arxiv","id":"1507.07789","version":1},"attestation_state":"computed","paper":{"title":"Duality and Nonlinear Graph Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam S. Landsberg, Eric J. Friedman","submitted_at":"2015-07-28T14:46:48Z","abstract_excerpt":"We present an iterative algorithm for solving a class of \\\\nonlinear Laplacian system of equations in $\\tilde{O}(k^2m \\log(kn/\\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number of nonzero entries in the graph Laplacian $L$, $\\epsilon$ is the solution accuracy and $\\tilde{O}()$ neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by of Kelner et. al., which solves a linear Laplacian system of equations in nearly linear time. Unlike the linear case, in the nonlinear case each iteration "},"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":"1507.07789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-28T14:46:48Z","cross_cats_sorted":[],"title_canon_sha256":"758a91e08497db2040e48830afd9eb7ce08298560b863c897e78a8dc920a3c1f","abstract_canon_sha256":"da9513a090c2e4d3aad16b77d8a500300518511ef38bd34b0a74d30e430812ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:11.902072Z","signature_b64":"eUVJUX0fZy4a0Z3TCWX8isHVBlm9kT2mpY5fy7duDFJFq4rQPdZnf0z3elsPzMKmsmArTfwoAtVXN+3K9oxKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf89d5b275be5abbff3605af9a0acfaff8db8695ab71b676c5dd5320ccba48c6","last_reissued_at":"2026-05-18T01:36:11.901576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:11.901576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duality and Nonlinear Graph Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam S. Landsberg, Eric J. Friedman","submitted_at":"2015-07-28T14:46:48Z","abstract_excerpt":"We present an iterative algorithm for solving a class of \\\\nonlinear Laplacian system of equations in $\\tilde{O}(k^2m \\log(kn/\\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number of nonzero entries in the graph Laplacian $L$, $\\epsilon$ is the solution accuracy and $\\tilde{O}()$ neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by of Kelner et. al., which solves a linear Laplacian system of equations in nearly linear time. Unlike the linear case, in the nonlinear case each iteration "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07789","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":"1507.07789","created_at":"2026-05-18T01:36:11.901666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07789v1","created_at":"2026-05-18T01:36:11.901666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07789","created_at":"2026-05-18T01:36:11.901666+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6E5LMTVXZNL","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6E5LMTVXZNLX7ZW","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6E5LMTV","created_at":"2026-05-18T12:29:47.479230+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/X6E5LMTVXZNLX7ZWAWXZUCWPV7","json":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7.json","graph_json":"https://pith.science/api/pith-number/X6E5LMTVXZNLX7ZWAWXZUCWPV7/graph.json","events_json":"https://pith.science/api/pith-number/X6E5LMTVXZNLX7ZWAWXZUCWPV7/events.json","paper":"https://pith.science/paper/X6E5LMTV"},"agent_actions":{"view_html":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7","download_json":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7.json","view_paper":"https://pith.science/paper/X6E5LMTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07789&json=true","fetch_graph":"https://pith.science/api/pith-number/X6E5LMTVXZNLX7ZWAWXZUCWPV7/graph.json","fetch_events":"https://pith.science/api/pith-number/X6E5LMTVXZNLX7ZWAWXZUCWPV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7/action/storage_attestation","attest_author":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7/action/author_attestation","sign_citation":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7/action/citation_signature","submit_replication":"https://pith.science/pith/X6E5LMTVXZNLX7ZWAWXZUCWPV7/action/replication_record"}},"created_at":"2026-05-18T01:36:11.901666+00:00","updated_at":"2026-05-18T01:36:11.901666+00:00"}