{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ESM2XCA5CWLL5DFTG7PUOFDFGG","short_pith_number":"pith:ESM2XCA5","schema_version":"1.0","canonical_sha256":"2499ab881d1596be8cb337df471465319c6740cc9eae1dc6882ca6b1d7318846","source":{"kind":"arxiv","id":"1711.00213","version":1},"attestation_state":"computed","paper":{"title":"Closed Form Solutions of Combinatorial Graph Laplacian Estimation under Acyclic Topology Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Antonio Ortega, Keng-Shih Lu","submitted_at":"2017-11-01T05:12:14Z","abstract_excerpt":"How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints. To solve this problem, we typically require iterative convex optimization solvers. In this paper, we show that when the target graph topology does not contain any cycle, then the solution has a closed form in terms of the empirical covariance matrix. This enables us to efficiently construct a tree graph from data, even if there is only a single data sample "},"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":"1711.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-11-01T05:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"9954d0e6454adaaa919371f2199712d43e76df45a34bf248ed05c7e70afe8dab","abstract_canon_sha256":"c06f4e96b469771fffce469d21942de21c739f937825a7b8710df74e19cfdb60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.794294Z","signature_b64":"0vriQTGAAjdyWmsNHlSB1C3OquwNRLEpT4FC3/NCWOSTRwTYk4dvTXWICpM+eZvotWEdultFFNR6bsdRyQp8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2499ab881d1596be8cb337df471465319c6740cc9eae1dc6882ca6b1d7318846","last_reissued_at":"2026-05-18T00:31:34.793620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.793620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closed Form Solutions of Combinatorial Graph Laplacian Estimation under Acyclic Topology Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Antonio Ortega, Keng-Shih Lu","submitted_at":"2017-11-01T05:12:14Z","abstract_excerpt":"How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints. To solve this problem, we typically require iterative convex optimization solvers. In this paper, we show that when the target graph topology does not contain any cycle, then the solution has a closed form in terms of the empirical covariance matrix. This enables us to efficiently construct a tree graph from data, even if there is only a single data sample "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00213","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":"1711.00213","created_at":"2026-05-18T00:31:34.793712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00213v1","created_at":"2026-05-18T00:31:34.793712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00213","created_at":"2026-05-18T00:31:34.793712+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESM2XCA5CWLL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESM2XCA5CWLL5DFT","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESM2XCA5","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10471","citing_title":"State-Space Network Topology Identification from Partial Observations","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG","json":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG.json","graph_json":"https://pith.science/api/pith-number/ESM2XCA5CWLL5DFTG7PUOFDFGG/graph.json","events_json":"https://pith.science/api/pith-number/ESM2XCA5CWLL5DFTG7PUOFDFGG/events.json","paper":"https://pith.science/paper/ESM2XCA5"},"agent_actions":{"view_html":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG","download_json":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG.json","view_paper":"https://pith.science/paper/ESM2XCA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00213&json=true","fetch_graph":"https://pith.science/api/pith-number/ESM2XCA5CWLL5DFTG7PUOFDFGG/graph.json","fetch_events":"https://pith.science/api/pith-number/ESM2XCA5CWLL5DFTG7PUOFDFGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG/action/storage_attestation","attest_author":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG/action/author_attestation","sign_citation":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG/action/citation_signature","submit_replication":"https://pith.science/pith/ESM2XCA5CWLL5DFTG7PUOFDFGG/action/replication_record"}},"created_at":"2026-05-18T00:31:34.793712+00:00","updated_at":"2026-05-18T00:31:34.793712+00:00"}