{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4LJ2FZRB4WEEHREZ6CMEI3LSZB","short_pith_number":"pith:4LJ2FZRB","schema_version":"1.0","canonical_sha256":"e2d3a2e621e58843c499f098446d72c87d8fc9db416e232f9845bfd0bd014f7e","source":{"kind":"arxiv","id":"1009.2218","version":2},"attestation_state":"computed","paper":{"title":"On Isosceles Triangles and Related Problems in a Convex Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Amol Aggarwal","submitted_at":"2010-09-12T05:56:03Z","abstract_excerpt":"Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \\Theta(n\\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most $3n^2/4 + o(n^2)$ isosceles triangles and prove this conjecture for a special group of convex $n$-gons, (iii) prove that its vertices can form at most $\\lfloor n/k \\rfloor$ regular $k$-gons for any integer $k\\ge 4$ and that this bound is optimal, and (iv) provide a short proof that the sum of all the distances between its 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":"1009.2218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-12T05:56:03Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a79e2787f61bdbd512b7ca647239d687aadd161cdebc7e82582aa3adebe940e0","abstract_canon_sha256":"d668fbb8741b210d5886a4b8a7ff13652501429ccf8df33d06ece740578de63a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:55.728565Z","signature_b64":"mpKjjobUn+FZBlK5vVQhpWuE4e1rKd7h2Hcirp+w9g7KG7OeYBOTEe3UualizGUK2R9qwJWDfMMVVSnkzOLTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d3a2e621e58843c499f098446d72c87d8fc9db416e232f9845bfd0bd014f7e","last_reissued_at":"2026-05-18T04:40:55.728014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:55.728014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Isosceles Triangles and Related Problems in a Convex Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Amol Aggarwal","submitted_at":"2010-09-12T05:56:03Z","abstract_excerpt":"Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \\Theta(n\\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most $3n^2/4 + o(n^2)$ isosceles triangles and prove this conjecture for a special group of convex $n$-gons, (iii) prove that its vertices can form at most $\\lfloor n/k \\rfloor$ regular $k$-gons for any integer $k\\ge 4$ and that this bound is optimal, and (iv) provide a short proof that the sum of all the distances between its ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2218","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":"1009.2218","created_at":"2026-05-18T04:40:55.728097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2218v2","created_at":"2026-05-18T04:40:55.728097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2218","created_at":"2026-05-18T04:40:55.728097+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LJ2FZRB4WEE","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LJ2FZRB4WEEHREZ","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LJ2FZRB","created_at":"2026-05-18T12:26:03.138858+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/4LJ2FZRB4WEEHREZ6CMEI3LSZB","json":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB.json","graph_json":"https://pith.science/api/pith-number/4LJ2FZRB4WEEHREZ6CMEI3LSZB/graph.json","events_json":"https://pith.science/api/pith-number/4LJ2FZRB4WEEHREZ6CMEI3LSZB/events.json","paper":"https://pith.science/paper/4LJ2FZRB"},"agent_actions":{"view_html":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB","download_json":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB.json","view_paper":"https://pith.science/paper/4LJ2FZRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2218&json=true","fetch_graph":"https://pith.science/api/pith-number/4LJ2FZRB4WEEHREZ6CMEI3LSZB/graph.json","fetch_events":"https://pith.science/api/pith-number/4LJ2FZRB4WEEHREZ6CMEI3LSZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB/action/storage_attestation","attest_author":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB/action/author_attestation","sign_citation":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB/action/citation_signature","submit_replication":"https://pith.science/pith/4LJ2FZRB4WEEHREZ6CMEI3LSZB/action/replication_record"}},"created_at":"2026-05-18T04:40:55.728097+00:00","updated_at":"2026-05-18T04:40:55.728097+00:00"}