{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E7KPQFDP6K2P6EPF53FMRIPG7J","short_pith_number":"pith:E7KPQFDP","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"},"canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","source":{"kind":"arxiv","id":"1210.2041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2041","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2041v1","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2041","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"E7KPQFDP6K2P","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7KPQFDP6K2P6EPF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7KPQFDP","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E7KPQFDP6K2P6EPF53FMRIPG7J","target":"record","payload":{"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"},"canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","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"},"source_kind":"arxiv","source_id":"1210.2041","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYfIHbcUUEcoHGG5z+4rBkfC27hgseJOdsti0oADqh4BXyRChxohm72gTzrPateWdCdAW9icTdwCstSH6TRKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:24:07.960233Z"},"content_sha256":"99904f1a6c00fa6b0f9ff43dc04765b83e45ba267f0e88b998c7f0d4fd05605a","schema_version":"1.0","event_id":"sha256:99904f1a6c00fa6b0f9ff43dc04765b83e45ba267f0e88b998c7f0d4fd05605a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E7KPQFDP6K2P6EPF53FMRIPG7J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlIcKrl2SFtUSHEWzpj73cGy07onbf6RDUZZoQzjcW4J/wEaK24Zj4jzjKfAS/T1qWGhRECMLoEOEXVyymuNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:24:07.960603Z"},"content_sha256":"8e2c32a55cdaa1eede6b75193de0d64c6d5d3b7c9b6f0e5dd5bf9767fb3734e0","schema_version":"1.0","event_id":"sha256:8e2c32a55cdaa1eede6b75193de0d64c6d5d3b7c9b6f0e5dd5bf9767fb3734e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/bundle.json","state_url":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T15:24:07Z","links":{"resolver":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J","bundle":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/bundle.json","state":"https://pith.science/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7KPQFDP6K2P6EPF53FMRIPG7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E7KPQFDP6K2P6EPF53FMRIPG7J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"562a1721ff5e56246df34149e9b0614951f877065083a2c9b4964b2b0c21ce89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-07T10:52:53Z","title_canon_sha256":"a65c9fde643805be6c72114896fc53028641cc4035322ee81bcd2f74f77d2cd3"},"schema_version":"1.0","source":{"id":"1210.2041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2041","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2041v1","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2041","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"E7KPQFDP6K2P","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7KPQFDP6K2P6EPF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7KPQFDP","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:8e2c32a55cdaa1eede6b75193de0d64c6d5d3b7c9b6f0e5dd5bf9767fb3734e0","target":"graph","created_at":"2026-05-18T03:43:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amina Shabbeer, Cagri Ozcaglar, Kristin P. Bennett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-07T10:52:53Z","title":"Crossing Minimization within Graph Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2041","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99904f1a6c00fa6b0f9ff43dc04765b83e45ba267f0e88b998c7f0d4fd05605a","target":"record","created_at":"2026-05-18T03:43:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"562a1721ff5e56246df34149e9b0614951f877065083a2c9b4964b2b0c21ce89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-07T10:52:53Z","title_canon_sha256":"a65c9fde643805be6c72114896fc53028641cc4035322ee81bcd2f74f77d2cd3"},"schema_version":"1.0","source":{"id":"1210.2041","kind":"arxiv","version":1}},"canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d4f8146ff2b4ff11e5eecac8a1e6fa5863b1902ed96747842799395575443c","first_computed_at":"2026-05-18T03:43:51.285143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:51.285143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ze+gjtZUAvcf9b8ZHzQkgrCgfJsQ2CNGbkcmH3m7VbL9wyfXYB0rgeKQSiNHpTCuo8TJ+W74PJvuSpRXY8KuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:51.285659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99904f1a6c00fa6b0f9ff43dc04765b83e45ba267f0e88b998c7f0d4fd05605a","sha256:8e2c32a55cdaa1eede6b75193de0d64c6d5d3b7c9b6f0e5dd5bf9767fb3734e0"],"state_sha256":"adf0c09c07d6e7bbba72bc68746f9fafa67f5646c1a1a2b16c96dbbc2ed96ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXNpGoKbMPegluS06N6tETK/QUClKUxgRsAe02cEW0d+4YWxmUQc5V1RwpNzB5f4BLyXW/4J/amk59E/EP16CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:24:07.962716Z","bundle_sha256":"767ab120a586dff8eecce778478696328eff0207814493ac8be85e207953a3d1"}}