{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E7KPQFDP6K2P6EPF53FMRIPG7J","short_pith_number":"pith:E7KPQFDP","schema_version":"1.0","canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","source":{"kind":"arxiv","id":"1210.2041","version":1},"attestation_state":"computed","paper":{"title":"Crossing Minimization within Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amina Shabbeer, Cagri Ozcaglar, Kristin P. Bennett","submitted_at":"2012-10-07T10:52:53Z","abstract_excerpt":"We propose a novel optimization-based approach to embedding heterogeneous high-dimensional data characterized by a graph. The goal is to create a two-dimensional visualization of the graph structure such that edge-crossings are minimized while preserving proximity relations between nodes. This paper provides a fundamentally new approach for addressing the crossing minimization criteria that exploits Farkas' Lemma to re-express the condition for no edge-crossings as a system of nonlinear inequality constraints. The approach has an intuitive geometric interpretation closely related to support ve"},"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.2041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-07T10:52:53Z","cross_cats_sorted":[],"title_canon_sha256":"a65c9fde643805be6c72114896fc53028641cc4035322ee81bcd2f74f77d2cd3","abstract_canon_sha256":"562a1721ff5e56246df34149e9b0614951f877065083a2c9b4964b2b0c21ce89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:51.285659Z","signature_b64":"ze+gjtZUAvcf9b8ZHzQkgrCgfJsQ2CNGbkcmH3m7VbL9wyfXYB0rgeKQSiNHpTCuo8TJ+W74PJvuSpRXY8KuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","last_reissued_at":"2026-05-18T03:43:51.285143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:51.285143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossing Minimization within Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amina Shabbeer, Cagri Ozcaglar, Kristin P. Bennett","submitted_at":"2012-10-07T10:52:53Z","abstract_excerpt":"We propose a novel optimization-based approach to embedding heterogeneous high-dimensional data characterized by a graph. The goal is to create a two-dimensional visualization of the graph structure such that edge-crossings are minimized while preserving proximity relations between nodes. This paper provides a fundamentally new approach for addressing the crossing minimization criteria that exploits Farkas' Lemma to re-express the condition for no edge-crossings as a system of nonlinear inequality constraints. The approach has an intuitive geometric interpretation closely related to support ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2041","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":"1210.2041","created_at":"2026-05-18T03:43:51.285217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2041v1","created_at":"2026-05-18T03:43:51.285217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2041","created_at":"2026-05-18T03:43:51.285217+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7KPQFDP6K2P","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7KPQFDP6K2P6EPF","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7KPQFDP","created_at":"2026-05-18T12:27:04.183437+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/E7KPQFDP6K2P6EPF53FMRIPG7J","json":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J.json","graph_json":"https://pith.science/api/pith-number/E7KPQFDP6K2P6EPF53FMRIPG7J/graph.json","events_json":"https://pith.science/api/pith-number/E7KPQFDP6K2P6EPF53FMRIPG7J/events.json","paper":"https://pith.science/paper/E7KPQFDP"},"agent_actions":{"view_html":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J","download_json":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J.json","view_paper":"https://pith.science/paper/E7KPQFDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2041&json=true","fetch_graph":"https://pith.science/api/pith-number/E7KPQFDP6K2P6EPF53FMRIPG7J/graph.json","fetch_events":"https://pith.science/api/pith-number/E7KPQFDP6K2P6EPF53FMRIPG7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/action/storage_attestation","attest_author":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/action/author_attestation","sign_citation":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/action/citation_signature","submit_replication":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/action/replication_record"}},"created_at":"2026-05-18T03:43:51.285217+00:00","updated_at":"2026-05-18T03:43:51.285217+00:00"}