{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EZB4ET5XSBC35E24SLGM5HHNHF","short_pith_number":"pith:EZB4ET5X","schema_version":"1.0","canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","source":{"kind":"arxiv","id":"1012.5664","version":2},"attestation_state":"computed","paper":{"title":"Bounds on the maximum multiplicity of some common geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Adrian Dumitrescu, Andr\\'e Schulz, Csaba D. T\\'oth","submitted_at":"2010-12-27T21:20:52Z","abstract_excerpt":"We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations.\n  (i) We present a new lower bound construction for the maximum number of triangulations a set of n points in general position can have. In particular, we show that a generalized double chain formed by two almost convex chains admits {\\Omega}(8.65^n) different triangulations. This improves the b"},"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":"1012.5664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-27T21:20:52Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"707062931bffd686947dbe196653d71cde141c34acd26a8c465425d0c3267806","abstract_canon_sha256":"5849de9b6f39eeba19d3a284ed464703ac1958a91ca72d13d237973d971990c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:21.088125Z","signature_b64":"UtAGRPV0LPrMWtpXkdlyXJpfTJF8BDGSQsWq7/wL46MyWISIwc/TigCUG4/AHgo8iAvXUTnSnKTaBh1NNN1mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","last_reissued_at":"2026-05-18T04:12:21.087449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:21.087449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the maximum multiplicity of some common geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Adrian Dumitrescu, Andr\\'e Schulz, Csaba D. T\\'oth","submitted_at":"2010-12-27T21:20:52Z","abstract_excerpt":"We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations.\n  (i) We present a new lower bound construction for the maximum number of triangulations a set of n points in general position can have. In particular, we show that a generalized double chain formed by two almost convex chains admits {\\Omega}(8.65^n) different triangulations. This improves the b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5664","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":"1012.5664","created_at":"2026-05-18T04:12:21.087560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5664v2","created_at":"2026-05-18T04:12:21.087560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5664","created_at":"2026-05-18T04:12:21.087560+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZB4ET5XSBC3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZB4ET5XSBC35E24","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZB4ET5X","created_at":"2026-05-18T12:26:06.534383+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/EZB4ET5XSBC35E24SLGM5HHNHF","json":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF.json","graph_json":"https://pith.science/api/pith-number/EZB4ET5XSBC35E24SLGM5HHNHF/graph.json","events_json":"https://pith.science/api/pith-number/EZB4ET5XSBC35E24SLGM5HHNHF/events.json","paper":"https://pith.science/paper/EZB4ET5X"},"agent_actions":{"view_html":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF","download_json":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF.json","view_paper":"https://pith.science/paper/EZB4ET5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5664&json=true","fetch_graph":"https://pith.science/api/pith-number/EZB4ET5XSBC35E24SLGM5HHNHF/graph.json","fetch_events":"https://pith.science/api/pith-number/EZB4ET5XSBC35E24SLGM5HHNHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/action/storage_attestation","attest_author":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/action/author_attestation","sign_citation":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/action/citation_signature","submit_replication":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/action/replication_record"}},"created_at":"2026-05-18T04:12:21.087560+00:00","updated_at":"2026-05-18T04:12:21.087560+00:00"}