{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H4PR4UG2G5ZYB4GIEUZ4SEDDT3","short_pith_number":"pith:H4PR4UG2","schema_version":"1.0","canonical_sha256":"3f1f1e50da377380f0c82533c910639ecb3596e4f1fe150f55e05802a7d6a48d","source":{"kind":"arxiv","id":"1211.4927","version":2},"attestation_state":"computed","paper":{"title":"Angle Optimization of Graphs Embedded in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sergey Bereg, Timothy Rozario","submitted_at":"2012-11-21T03:50:35Z","abstract_excerpt":"In this paper we study problems of drawing graphs in the plane using edge length constraints and angle optimization. Specifically we consider the problem of maximizing the minimum angle, the MMA problem. We solve the MMA problem using a spring-embedding approach where two forces are applied to the vertices of the graph: a force optimizing edge lengths and a force optimizing angles. We solve analytically the problem of computing an optimal displacement of a graph vertex optimizing the angles between edges incident to it if the degree of the vertex is at most three. We also apply a numerical app"},"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":"1211.4927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-21T03:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"956626403be21001be61dff297a96008dd8bd9574966e639da3708b34fa1c7db","abstract_canon_sha256":"af0b98b84dd081a283dcf88a50f10bbc2207102f067bfe13e7fe84cb08c98fc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.133904Z","signature_b64":"APv8bdju2WhP0oVTz7sT+oljeyIK7/V63b5/3VLE7nvWUoWi8mKIZ2prbEcKcqk8LMnhBRoFN6EbrPpDAKInCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1f1e50da377380f0c82533c910639ecb3596e4f1fe150f55e05802a7d6a48d","last_reissued_at":"2026-05-18T03:25:16.133494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.133494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Angle Optimization of Graphs Embedded in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sergey Bereg, Timothy Rozario","submitted_at":"2012-11-21T03:50:35Z","abstract_excerpt":"In this paper we study problems of drawing graphs in the plane using edge length constraints and angle optimization. Specifically we consider the problem of maximizing the minimum angle, the MMA problem. We solve the MMA problem using a spring-embedding approach where two forces are applied to the vertices of the graph: a force optimizing edge lengths and a force optimizing angles. We solve analytically the problem of computing an optimal displacement of a graph vertex optimizing the angles between edges incident to it if the degree of the vertex is at most three. We also apply a numerical app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4927","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":"1211.4927","created_at":"2026-05-18T03:25:16.133558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4927v2","created_at":"2026-05-18T03:25:16.133558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4927","created_at":"2026-05-18T03:25:16.133558+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4PR4UG2G5ZY","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4PR4UG2G5ZYB4GI","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4PR4UG2","created_at":"2026-05-18T12:27:06.952714+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/H4PR4UG2G5ZYB4GIEUZ4SEDDT3","json":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3.json","graph_json":"https://pith.science/api/pith-number/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/graph.json","events_json":"https://pith.science/api/pith-number/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/events.json","paper":"https://pith.science/paper/H4PR4UG2"},"agent_actions":{"view_html":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3","download_json":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3.json","view_paper":"https://pith.science/paper/H4PR4UG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4927&json=true","fetch_graph":"https://pith.science/api/pith-number/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/graph.json","fetch_events":"https://pith.science/api/pith-number/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/action/storage_attestation","attest_author":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/action/author_attestation","sign_citation":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/action/citation_signature","submit_replication":"https://pith.science/pith/H4PR4UG2G5ZYB4GIEUZ4SEDDT3/action/replication_record"}},"created_at":"2026-05-18T03:25:16.133558+00:00","updated_at":"2026-05-18T03:25:16.133558+00:00"}