{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CHGQWD2JQWRRVOLTBZUJ3PIJ5R","short_pith_number":"pith:CHGQWD2J","schema_version":"1.0","canonical_sha256":"11cd0b0f4985a31ab9730e689dbd09ec79b5bed5c5d718515e1bbf5766544ef7","source":{"kind":"arxiv","id":"1508.00952","version":3},"attestation_state":"computed","paper":{"title":"Graphical Newton","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Akshay Srinivasan, Emanuel Todorov","submitted_at":"2015-08-05T01:46:30Z","abstract_excerpt":"Computing the Newton step for a generic function $f: \\mathbb{R}^N \\rightarrow \\mathbb{R}$ takes $O(N^{3})$ flops. In this paper, we explore avenues for reducing this bound, when the computational structure of $f$ is known beforehand. It is shown that the Newton step can be computed in time, linear in the size of the computational-graph, and cubic in its tree-width."},"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":"1508.00952","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2015-08-05T01:46:30Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"973d7a83c385318044a47a6fddcc242b35d1b5aaf548a7567eff6fa129de3815","abstract_canon_sha256":"4ccd08bd5261fc64a427e5412d4fc62ac6b0e0e948a670e96e639b79f7d006df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.787538Z","signature_b64":"Oi3u9tUhmTJkytb1UIR5LC+mkJBq1E4yBWToBDAJaLINnn4af5sljT2jUxZ5/Y8RPnBa51OimYY45qwXdAulCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11cd0b0f4985a31ab9730e689dbd09ec79b5bed5c5d718515e1bbf5766544ef7","last_reissued_at":"2026-05-18T00:33:32.786894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.786894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical Newton","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"math.OC","authors_text":"Akshay Srinivasan, Emanuel Todorov","submitted_at":"2015-08-05T01:46:30Z","abstract_excerpt":"Computing the Newton step for a generic function $f: \\mathbb{R}^N \\rightarrow \\mathbb{R}$ takes $O(N^{3})$ flops. In this paper, we explore avenues for reducing this bound, when the computational structure of $f$ is known beforehand. It is shown that the Newton step can be computed in time, linear in the size of the computational-graph, and cubic in its tree-width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00952","kind":"arxiv","version":3},"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":"1508.00952","created_at":"2026-05-18T00:33:32.786987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00952v3","created_at":"2026-05-18T00:33:32.786987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00952","created_at":"2026-05-18T00:33:32.786987+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHGQWD2JQWRR","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHGQWD2JQWRRVOLT","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHGQWD2J","created_at":"2026-05-18T12:29:14.074870+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/CHGQWD2JQWRRVOLTBZUJ3PIJ5R","json":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R.json","graph_json":"https://pith.science/api/pith-number/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/graph.json","events_json":"https://pith.science/api/pith-number/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/events.json","paper":"https://pith.science/paper/CHGQWD2J"},"agent_actions":{"view_html":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R","download_json":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R.json","view_paper":"https://pith.science/paper/CHGQWD2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00952&json=true","fetch_graph":"https://pith.science/api/pith-number/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/graph.json","fetch_events":"https://pith.science/api/pith-number/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/action/storage_attestation","attest_author":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/action/author_attestation","sign_citation":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/action/citation_signature","submit_replication":"https://pith.science/pith/CHGQWD2JQWRRVOLTBZUJ3PIJ5R/action/replication_record"}},"created_at":"2026-05-18T00:33:32.786987+00:00","updated_at":"2026-05-18T00:33:32.786987+00:00"}