{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TQ23ZQIYJD5N5K6SEO3H7GKDAQ","short_pith_number":"pith:TQ23ZQIY","schema_version":"1.0","canonical_sha256":"9c35bcc11848fadeabd223b67f994304361809dfb1f5cad79522ffdbfd2f00a7","source":{"kind":"arxiv","id":"1210.7665","version":2},"attestation_state":"computed","paper":{"title":"Graph Estimation From Multi-attribute Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Han Liu, Mladen Kolar","submitted_at":"2012-10-29T13:54:36Z","abstract_excerpt":"Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such data, neither can the theories developed around such methods be directly applied. In this paper, we propose a new principled framework for estimating graphs from multi-attribute data. Instead of estimating the partial correlation as in current literature, our method estimates the "},"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":"1210.7665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-29T13:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"38ad9716a47f5790252cc142a6aa869b954d60d9528d01c5b482b2f48b7d610e","abstract_canon_sha256":"88c27fd1ad8bc59c67d1a78a621d3c2ec2dc6f4b5834485e616e242642b518b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.513626Z","signature_b64":"fprCj9rnRgvuvAo/uwZcmS1mANWcSLxrd/WLiQyYthKozDT9bLJS3sYUGOkfg08bMbhUzFXgw92FYudAAPh2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c35bcc11848fadeabd223b67f994304361809dfb1f5cad79522ffdbfd2f00a7","last_reissued_at":"2026-05-18T03:27:32.513132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.513132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Estimation From Multi-attribute Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Han Liu, Mladen Kolar","submitted_at":"2012-10-29T13:54:36Z","abstract_excerpt":"Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such data, neither can the theories developed around such methods be directly applied. In this paper, we propose a new principled framework for estimating graphs from multi-attribute data. Instead of estimating the partial correlation as in current literature, our method estimates the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7665","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":"1210.7665","created_at":"2026-05-18T03:27:32.513198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7665v2","created_at":"2026-05-18T03:27:32.513198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7665","created_at":"2026-05-18T03:27:32.513198+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQ23ZQIYJD5N","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQ23ZQIYJD5N5K6S","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQ23ZQIY","created_at":"2026-05-18T12:27:23.164592+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/TQ23ZQIYJD5N5K6SEO3H7GKDAQ","json":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ.json","graph_json":"https://pith.science/api/pith-number/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/graph.json","events_json":"https://pith.science/api/pith-number/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/events.json","paper":"https://pith.science/paper/TQ23ZQIY"},"agent_actions":{"view_html":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ","download_json":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ.json","view_paper":"https://pith.science/paper/TQ23ZQIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7665&json=true","fetch_graph":"https://pith.science/api/pith-number/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/action/storage_attestation","attest_author":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/action/author_attestation","sign_citation":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/action/citation_signature","submit_replication":"https://pith.science/pith/TQ23ZQIYJD5N5K6SEO3H7GKDAQ/action/replication_record"}},"created_at":"2026-05-18T03:27:32.513198+00:00","updated_at":"2026-05-18T03:27:32.513198+00:00"}