{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FQAU7PEMEPF7E2TQKCCZF3FYDA","short_pith_number":"pith:FQAU7PEM","canonical_record":{"source":{"id":"1401.5330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-21T14:45:02Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6b4ae88406dddbfd3a77c90c52e1d9f44cdead318297ce61ebef2c37cbf338c4","abstract_canon_sha256":"448ba5c03c4677752d8350c70adfc7d2882a15985eb2b380a7616e9a1828ed11"},"schema_version":"1.0"},"canonical_sha256":"2c014fbc8c23cbf26a70508592ecb818385a29f783e4b6a5dfa9d582b97f1f8d","source":{"kind":"arxiv","id":"1401.5330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5330","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5330v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5330","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FQAU7PEMEPF7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQAU7PEMEPF7E2TQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQAU7PEM","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FQAU7PEMEPF7E2TQKCCZF3FYDA","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-21T14:45:02Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6b4ae88406dddbfd3a77c90c52e1d9f44cdead318297ce61ebef2c37cbf338c4","abstract_canon_sha256":"448ba5c03c4677752d8350c70adfc7d2882a15985eb2b380a7616e9a1828ed11"},"schema_version":"1.0"},"canonical_sha256":"2c014fbc8c23cbf26a70508592ecb818385a29f783e4b6a5dfa9d582b97f1f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.132464Z","signature_b64":"P3eWqrmJ2szEp6J0z67/2a2qivlXZivBiBkQpzVv/jPAR+OmT9uxaj3RX/B4VK8O+OwkL2whmBaCXhOwhk/aDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c014fbc8c23cbf26a70508592ecb818385a29f783e4b6a5dfa9d582b97f1f8d","last_reissued_at":"2026-05-18T03:01:34.131673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.131673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5330","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mGi343KxKZLAsPhVOvfh3GnmX03yzs7uE1cSP80CZPvroG/9IPdjNuqr2lhXC7Y8ZzZOJrgAM/Omt6j4XC+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:49.881058Z"},"content_sha256":"482e05d80b6786954c48ee6b09d39eb0751ca2ff1e0d4092f857304aa06a5a29","schema_version":"1.0","event_id":"sha256:482e05d80b6786954c48ee6b09d39eb0751ca2ff1e0d4092f857304aa06a5a29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FQAU7PEMEPF7E2TQKCCZF3FYDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CG","authors_text":"Hanan H. Amin, Mohamed A. El-Sayed, S. Abdel-Khalek","submitted_at":"2014-01-21T14:45:02Z","abstract_excerpt":"Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and consequently cheaper. A straight-line drawing of a planar graph G of n vertices is a drawing of G such that each edge is drawn as a straight-line segment without edge crossings. However, a problem with curr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5330","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGnhbHMNSCXd5MMRWoUSyh1zg/IG9KlfdPwzycG8QDRxdTSL6/m746v949n12r//ycidCW81UpGpr7vDD6otDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:49.881744Z"},"content_sha256":"cbca2f39785a01bb5e34f637689c0c55e594832c81ff7052a66dde21f98bb589","schema_version":"1.0","event_id":"sha256:cbca2f39785a01bb5e34f637689c0c55e594832c81ff7052a66dde21f98bb589"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/bundle.json","state_url":"https://pith.science/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/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-31T21:06:49Z","links":{"resolver":"https://pith.science/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA","bundle":"https://pith.science/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/bundle.json","state":"https://pith.science/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQAU7PEMEPF7E2TQKCCZF3FYDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FQAU7PEMEPF7E2TQKCCZF3FYDA","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":"448ba5c03c4677752d8350c70adfc7d2882a15985eb2b380a7616e9a1828ed11","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-21T14:45:02Z","title_canon_sha256":"6b4ae88406dddbfd3a77c90c52e1d9f44cdead318297ce61ebef2c37cbf338c4"},"schema_version":"1.0","source":{"id":"1401.5330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5330","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5330v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5330","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FQAU7PEMEPF7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQAU7PEMEPF7E2TQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQAU7PEM","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:cbca2f39785a01bb5e34f637689c0c55e594832c81ff7052a66dde21f98bb589","target":"graph","created_at":"2026-05-18T03:01:34Z","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":"Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and consequently cheaper. A straight-line drawing of a planar graph G of n vertices is a drawing of G such that each edge is drawn as a straight-line segment without edge crossings. However, a problem with curr","authors_text":"Hanan H. Amin, Mohamed A. El-Sayed, S. Abdel-Khalek","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-21T14:45:02Z","title":"Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5330","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:482e05d80b6786954c48ee6b09d39eb0751ca2ff1e0d4092f857304aa06a5a29","target":"record","created_at":"2026-05-18T03:01:34Z","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":"448ba5c03c4677752d8350c70adfc7d2882a15985eb2b380a7616e9a1828ed11","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-21T14:45:02Z","title_canon_sha256":"6b4ae88406dddbfd3a77c90c52e1d9f44cdead318297ce61ebef2c37cbf338c4"},"schema_version":"1.0","source":{"id":"1401.5330","kind":"arxiv","version":1}},"canonical_sha256":"2c014fbc8c23cbf26a70508592ecb818385a29f783e4b6a5dfa9d582b97f1f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c014fbc8c23cbf26a70508592ecb818385a29f783e4b6a5dfa9d582b97f1f8d","first_computed_at":"2026-05-18T03:01:34.131673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.131673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3eWqrmJ2szEp6J0z67/2a2qivlXZivBiBkQpzVv/jPAR+OmT9uxaj3RX/B4VK8O+OwkL2whmBaCXhOwhk/aDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.132464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:482e05d80b6786954c48ee6b09d39eb0751ca2ff1e0d4092f857304aa06a5a29","sha256:cbca2f39785a01bb5e34f637689c0c55e594832c81ff7052a66dde21f98bb589"],"state_sha256":"920d1ce9515d162610165c9acf9beb40b4ce9fc11252fa79aa0eedd124698d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+nHxj9h36298kYmuZFmbhY/tilKpHoXNrvJvOlTRyk8TFv5W76+V7i0QA9VUyGIlZoydr4QUanRgKJo4pvvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:06:49.885336Z","bundle_sha256":"d3441d1c1c14e9a06534dfab58c534d2c7dabf8ad1db74dab7739879ee3c0ff3"}}