{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3HCHWZCJTI2GPDJHKY5CIIRAII","short_pith_number":"pith:3HCHWZCJ","schema_version":"1.0","canonical_sha256":"d9c47b64499a34678d27563a2422204213eacfdd6171b814b858cc26ba9b4dc2","source":{"kind":"arxiv","id":"1402.6096","version":1},"attestation_state":"computed","paper":{"title":"Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Matthew J. Katz, Rom Aschner","submitted_at":"2014-02-25T09:00:19Z","abstract_excerpt":"We introduce a new structure for a set of points in the plane and an angle $\\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \\alpha \\le 2\\pi$ be an angle. An $\\alpha$-ST of $P$ is a spanning tree of the complete Euclidean graph induced by $P$, with the additional property that for each point $p \\in P$, the smallest angle around $p$ containing all the edges adjacent to $p$ is at most $\\alpha$. An $\\alpha$-MST of $P$ is then an $\\alpha$-ST of $P$ of minimum weight. For $\\alpha < \\pi/3$, an $\\alp"},"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":"1402.6096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-25T09:00:19Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7f11273723e1f44ba8b84274aa4d8fcf002fc0e4d662de5f41c76102e178f991","abstract_canon_sha256":"f4a3ebde9725ac9567fc2d21e595be98312c799d870df710c9ff823c6011cd3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.637812Z","signature_b64":"2bIeXSpgm5xUW3+V6Wn3yO44BOJWTwjlHK0dMGrykSroJjPYDTyMQcLJc5qd+aP/3+AVVfCDZx4J4iXHm5PzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c47b64499a34678d27563a2422204213eacfdd6171b814b858cc26ba9b4dc2","last_reissued_at":"2026-05-18T02:57:51.637387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.637387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Matthew J. Katz, Rom Aschner","submitted_at":"2014-02-25T09:00:19Z","abstract_excerpt":"We introduce a new structure for a set of points in the plane and an angle $\\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \\alpha \\le 2\\pi$ be an angle. An $\\alpha$-ST of $P$ is a spanning tree of the complete Euclidean graph induced by $P$, with the additional property that for each point $p \\in P$, the smallest angle around $p$ containing all the edges adjacent to $p$ is at most $\\alpha$. An $\\alpha$-MST of $P$ is then an $\\alpha$-ST of $P$ of minimum weight. For $\\alpha < \\pi/3$, an $\\alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6096","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":"1402.6096","created_at":"2026-05-18T02:57:51.637448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6096v1","created_at":"2026-05-18T02:57:51.637448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6096","created_at":"2026-05-18T02:57:51.637448+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HCHWZCJTI2G","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HCHWZCJTI2GPDJH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HCHWZCJ","created_at":"2026-05-18T12:28:11.866339+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/3HCHWZCJTI2GPDJHKY5CIIRAII","json":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII.json","graph_json":"https://pith.science/api/pith-number/3HCHWZCJTI2GPDJHKY5CIIRAII/graph.json","events_json":"https://pith.science/api/pith-number/3HCHWZCJTI2GPDJHKY5CIIRAII/events.json","paper":"https://pith.science/paper/3HCHWZCJ"},"agent_actions":{"view_html":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII","download_json":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII.json","view_paper":"https://pith.science/paper/3HCHWZCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6096&json=true","fetch_graph":"https://pith.science/api/pith-number/3HCHWZCJTI2GPDJHKY5CIIRAII/graph.json","fetch_events":"https://pith.science/api/pith-number/3HCHWZCJTI2GPDJHKY5CIIRAII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII/action/storage_attestation","attest_author":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII/action/author_attestation","sign_citation":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII/action/citation_signature","submit_replication":"https://pith.science/pith/3HCHWZCJTI2GPDJHKY5CIIRAII/action/replication_record"}},"created_at":"2026-05-18T02:57:51.637448+00:00","updated_at":"2026-05-18T02:57:51.637448+00:00"}