{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MB6YELBWBY2L2H36QQQUFHFNRB","short_pith_number":"pith:MB6YELBW","schema_version":"1.0","canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","source":{"kind":"arxiv","id":"1802.06482","version":2},"attestation_state":"computed","paper":{"title":"Optimal Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kazuhiro Sato","submitted_at":"2018-02-19T01:34:08Z","abstract_excerpt":"This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known. A problem of finding the nearest graph Laplacian is formulated as a convex optimization problem. Thus, our problem can be solved using interior point methods. However, the complexity of each iteration by interior point methods is $O(n^6)$, where $n$"},"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":"1802.06482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-19T01:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"49ff222e5d5df3cb8fa600e8ab94b87ff13c624390d385cb2cdbb593e111edce","abstract_canon_sha256":"c2c563c77d9c74369d89a0c5b594792a3c37c37f39c9fbc9e3398457ea5996ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:53.194038Z","signature_b64":"fVxx5b/Z9qiE1BBC5L4FHWctePfzlYfa8IOrtAuU9oJnsC7bWamp4D5TnAzI7vvHvP+1gdoy/+3RELKBMCaIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","last_reissued_at":"2026-05-18T00:12:53.193416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:53.193416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kazuhiro Sato","submitted_at":"2018-02-19T01:34:08Z","abstract_excerpt":"This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known. A problem of finding the nearest graph Laplacian is formulated as a convex optimization problem. Thus, our problem can be solved using interior point methods. However, the complexity of each iteration by interior point methods is $O(n^6)$, where $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06482","kind":"arxiv","version":2},"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":"1802.06482","created_at":"2026-05-18T00:12:53.193530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06482v2","created_at":"2026-05-18T00:12:53.193530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06482","created_at":"2026-05-18T00:12:53.193530+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB6YELBWBY2L","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB6YELBWBY2L2H36","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB6YELBW","created_at":"2026-05-18T12:32:37.024351+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/MB6YELBWBY2L2H36QQQUFHFNRB","json":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB.json","graph_json":"https://pith.science/api/pith-number/MB6YELBWBY2L2H36QQQUFHFNRB/graph.json","events_json":"https://pith.science/api/pith-number/MB6YELBWBY2L2H36QQQUFHFNRB/events.json","paper":"https://pith.science/paper/MB6YELBW"},"agent_actions":{"view_html":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB","download_json":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB.json","view_paper":"https://pith.science/paper/MB6YELBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06482&json=true","fetch_graph":"https://pith.science/api/pith-number/MB6YELBWBY2L2H36QQQUFHFNRB/graph.json","fetch_events":"https://pith.science/api/pith-number/MB6YELBWBY2L2H36QQQUFHFNRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/action/storage_attestation","attest_author":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/action/author_attestation","sign_citation":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/action/citation_signature","submit_replication":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/action/replication_record"}},"created_at":"2026-05-18T00:12:53.193530+00:00","updated_at":"2026-05-18T00:12:53.193530+00:00"}