{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MB6YELBWBY2L2H36QQQUFHFNRB","short_pith_number":"pith:MB6YELBW","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"},"canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","source":{"kind":"arxiv","id":"1802.06482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06482","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06482v2","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06482","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"MB6YELBWBY2L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MB6YELBWBY2L2H36","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MB6YELBW","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MB6YELBWBY2L2H36QQQUFHFNRB","target":"record","payload":{"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"},"canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","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"},"source_kind":"arxiv","source_id":"1802.06482","source_version":2,"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-18T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2w5hnbfh4rZ/ttwH/UJ/9TVrmDPh/9Aw0PsubaU6T18364jygan2i5HjXDGXi2O2Q3g9hB8D2yMe1gioO2dtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:49:51.220961Z"},"content_sha256":"c09f967f186384b953bfb28b100b40adce69e319a9f17faa3cd3f33c0e114978","schema_version":"1.0","event_id":"sha256:c09f967f186384b953bfb28b100b40adce69e319a9f17faa3cd3f33c0e114978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MB6YELBWBY2L2H36QQQUFHFNRB","target":"graph","payload":{"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"},"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-18T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO9fqCye66bwE4lrvGCz3n9nH5RpAzuJgj2rNMTUpmd9J2gyY3yDIl7MFirCE8qCuK9LNz4Xz8cXPDnNWsAnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:49:51.221302Z"},"content_sha256":"aa6ccbcc8abd0634cb84165c30a85325af57e9dc7c01f09aab4132dd2c050b19","schema_version":"1.0","event_id":"sha256:aa6ccbcc8abd0634cb84165c30a85325af57e9dc7c01f09aab4132dd2c050b19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/bundle.json","state_url":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MB6YELBWBY2L2H36QQQUFHFNRB/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-25T18:49:51Z","links":{"resolver":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB","bundle":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/bundle.json","state":"https://pith.science/pith/MB6YELBWBY2L2H36QQQUFHFNRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MB6YELBWBY2L2H36QQQUFHFNRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MB6YELBWBY2L2H36QQQUFHFNRB","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":"c2c563c77d9c74369d89a0c5b594792a3c37c37f39c9fbc9e3398457ea5996ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-19T01:34:08Z","title_canon_sha256":"49ff222e5d5df3cb8fa600e8ab94b87ff13c624390d385cb2cdbb593e111edce"},"schema_version":"1.0","source":{"id":"1802.06482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06482","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06482v2","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06482","created_at":"2026-05-18T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"MB6YELBWBY2L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MB6YELBWBY2L2H36","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MB6YELBW","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:aa6ccbcc8abd0634cb84165c30a85325af57e9dc7c01f09aab4132dd2c050b19","target":"graph","created_at":"2026-05-18T00:12:53Z","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":"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$","authors_text":"Kazuhiro Sato","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-19T01:34:08Z","title":"Optimal Graph Laplacian"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06482","kind":"arxiv","version":2},"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:c09f967f186384b953bfb28b100b40adce69e319a9f17faa3cd3f33c0e114978","target":"record","created_at":"2026-05-18T00:12:53Z","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":"c2c563c77d9c74369d89a0c5b594792a3c37c37f39c9fbc9e3398457ea5996ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-19T01:34:08Z","title_canon_sha256":"49ff222e5d5df3cb8fa600e8ab94b87ff13c624390d385cb2cdbb593e111edce"},"schema_version":"1.0","source":{"id":"1802.06482","kind":"arxiv","version":2}},"canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"607d822c360e34bd1f7e8421429cad885a036dacc32e873730c5a90135144241","first_computed_at":"2026-05-18T00:12:53.193416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:53.193416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVxx5b/Z9qiE1BBC5L4FHWctePfzlYfa8IOrtAuU9oJnsC7bWamp4D5TnAzI7vvHvP+1gdoy/+3RELKBMCaIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:53.194038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c09f967f186384b953bfb28b100b40adce69e319a9f17faa3cd3f33c0e114978","sha256:aa6ccbcc8abd0634cb84165c30a85325af57e9dc7c01f09aab4132dd2c050b19"],"state_sha256":"53e5377e290ad3aa0fe631daad1f26273670f199d26f1684f84cd8918785705c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyckSgrKg/nFyyx5Q2EXOfdtvOKHqvftcWp09RKS5s0gL1RqR3xXDF0nf6mZdqt4P+6uhP9WDEHx/sL87KGxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:49:51.223184Z","bundle_sha256":"7e75197922be2bede73f725458ac3a6a254e2295e72b15276ebf1ea6d2f1217a"}}