{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KC42S6QFURQ7TO7WOAO332V42Q","short_pith_number":"pith:KC42S6QF","schema_version":"1.0","canonical_sha256":"50b9a97a05a461f9bbf6701dbdeabcd40667ad6c7166f84d043e9dc4cb2fb130","source":{"kind":"arxiv","id":"1308.5218","version":2},"attestation_state":"computed","paper":{"title":"COAST: A Convex Optimization Approach to Stress-Based Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Emden R. Gansner, Shankar Krishnan, Yifan Hu","submitted_at":"2013-08-23T19:36:02Z","abstract_excerpt":"Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a given set of non-uniform edge lengths, however, force-based approaches become problematic while energy-based layouts become intractable. In this paper, we propose a reformulation of the stress function into a two-part convex objective function to which we can apply semi-definite programming (SDP). We avoid the high computational cost associated wi"},"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":"1308.5218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-23T19:36:02Z","cross_cats_sorted":[],"title_canon_sha256":"49a98367933415751c6cb3be8541957e198354f95ea32f6ce16baa485f044bad","abstract_canon_sha256":"186ec5493aa8c44bc269aec023148e80f14b6914aea60e1893920526504943b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:59.505355Z","signature_b64":"J8De/J1VHn775W2h2BBl71B5M+4Jsn+wS4c8MuXiUd2134awtTV63IUdGyuisdZXBjFZiovk1keKNgZIscLjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b9a97a05a461f9bbf6701dbdeabcd40667ad6c7166f84d043e9dc4cb2fb130","last_reissued_at":"2026-05-18T03:13:59.504755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:59.504755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COAST: A Convex Optimization Approach to Stress-Based Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Emden R. Gansner, Shankar Krishnan, Yifan Hu","submitted_at":"2013-08-23T19:36:02Z","abstract_excerpt":"Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a given set of non-uniform edge lengths, however, force-based approaches become problematic while energy-based layouts become intractable. In this paper, we propose a reformulation of the stress function into a two-part convex objective function to which we can apply semi-definite programming (SDP). We avoid the high computational cost associated wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5218","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":"1308.5218","created_at":"2026-05-18T03:13:59.504831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5218v2","created_at":"2026-05-18T03:13:59.504831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5218","created_at":"2026-05-18T03:13:59.504831+00:00"},{"alias_kind":"pith_short_12","alias_value":"KC42S6QFURQ7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KC42S6QFURQ7TO7W","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KC42S6QF","created_at":"2026-05-18T12:27:49.015174+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/KC42S6QFURQ7TO7WOAO332V42Q","json":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q.json","graph_json":"https://pith.science/api/pith-number/KC42S6QFURQ7TO7WOAO332V42Q/graph.json","events_json":"https://pith.science/api/pith-number/KC42S6QFURQ7TO7WOAO332V42Q/events.json","paper":"https://pith.science/paper/KC42S6QF"},"agent_actions":{"view_html":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q","download_json":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q.json","view_paper":"https://pith.science/paper/KC42S6QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5218&json=true","fetch_graph":"https://pith.science/api/pith-number/KC42S6QFURQ7TO7WOAO332V42Q/graph.json","fetch_events":"https://pith.science/api/pith-number/KC42S6QFURQ7TO7WOAO332V42Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q/action/storage_attestation","attest_author":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q/action/author_attestation","sign_citation":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q/action/citation_signature","submit_replication":"https://pith.science/pith/KC42S6QFURQ7TO7WOAO332V42Q/action/replication_record"}},"created_at":"2026-05-18T03:13:59.504831+00:00","updated_at":"2026-05-18T03:13:59.504831+00:00"}