{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3VQMYPZT7TGTSTRZVIBXZIIX2O","short_pith_number":"pith:3VQMYPZT","schema_version":"1.0","canonical_sha256":"dd60cc3f33fccd394e39aa037ca117d38d42c3778605e2d547971d9b76aadf93","source":{"kind":"arxiv","id":"1405.2037","version":2},"attestation_state":"computed","paper":{"title":"Coordinate shadows of semi-definite and Euclidean distance matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"D. Drusvyatskiy, G. Pataki, H. Wolkowicz","submitted_at":"2014-05-08T18:35:04Z","abstract_excerpt":"We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definite and Euclidean distance completion problems. We classify when these sets are closed, and use the boundary structure of these two sets to elucidate the Krislock-Wolkowicz facial reduction algorithm. In particular, we show that under a chordality assumption, the \"minimal cones\" of these problems admit combinatorial characterizations. As a byproduct, we record a striking relationship between the complexity of the gener"},"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":"1405.2037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-08T18:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"cf5b1cff13a9f2be587060aaf6918d0437b4f279175a050b7a9bd61c6ce869c8","abstract_canon_sha256":"5d1e6262571a208dcf0b0f8dafd8aaf8ce6a0f74685e2d23bad3dc8447399993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.511170Z","signature_b64":"pHSgN9Uj1Yqa+mld9pxjMh/xseqoxJ+Gt4qDjVBWDwCxt3iLjDRF/+53/7vKJLDWUN1IcZlAp7EF8zA75QEYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd60cc3f33fccd394e39aa037ca117d38d42c3778605e2d547971d9b76aadf93","last_reissued_at":"2026-05-18T02:29:45.510745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.510745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coordinate shadows of semi-definite and Euclidean distance matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"D. Drusvyatskiy, G. Pataki, H. Wolkowicz","submitted_at":"2014-05-08T18:35:04Z","abstract_excerpt":"We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definite and Euclidean distance completion problems. We classify when these sets are closed, and use the boundary structure of these two sets to elucidate the Krislock-Wolkowicz facial reduction algorithm. In particular, we show that under a chordality assumption, the \"minimal cones\" of these problems admit combinatorial characterizations. As a byproduct, we record a striking relationship between the complexity of the gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2037","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":"1405.2037","created_at":"2026-05-18T02:29:45.510817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2037v2","created_at":"2026-05-18T02:29:45.510817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2037","created_at":"2026-05-18T02:29:45.510817+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VQMYPZT7TGT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VQMYPZT7TGTSTRZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VQMYPZT","created_at":"2026-05-18T12:28:11.866339+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/3VQMYPZT7TGTSTRZVIBXZIIX2O","json":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O.json","graph_json":"https://pith.science/api/pith-number/3VQMYPZT7TGTSTRZVIBXZIIX2O/graph.json","events_json":"https://pith.science/api/pith-number/3VQMYPZT7TGTSTRZVIBXZIIX2O/events.json","paper":"https://pith.science/paper/3VQMYPZT"},"agent_actions":{"view_html":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O","download_json":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O.json","view_paper":"https://pith.science/paper/3VQMYPZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2037&json=true","fetch_graph":"https://pith.science/api/pith-number/3VQMYPZT7TGTSTRZVIBXZIIX2O/graph.json","fetch_events":"https://pith.science/api/pith-number/3VQMYPZT7TGTSTRZVIBXZIIX2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O/action/storage_attestation","attest_author":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O/action/author_attestation","sign_citation":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O/action/citation_signature","submit_replication":"https://pith.science/pith/3VQMYPZT7TGTSTRZVIBXZIIX2O/action/replication_record"}},"created_at":"2026-05-18T02:29:45.510817+00:00","updated_at":"2026-05-18T02:29:45.510817+00:00"}