{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EZB4ET5XSBC35E24SLGM5HHNHF","short_pith_number":"pith:EZB4ET5X","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"},"canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","source":{"kind":"arxiv","id":"1012.5664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5664","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5664v2","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5664","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"EZB4ET5XSBC3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZB4ET5XSBC35E24","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZB4ET5X","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EZB4ET5XSBC35E24SLGM5HHNHF","target":"record","payload":{"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"},"canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","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"},"source_kind":"arxiv","source_id":"1012.5664","source_version":2,"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-18T04:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRF6DO8b+kThU5fEW6KG/Kc0E9GwKiWOhZ7VY+99474k1zj7Es32O/hUQ6YhIyaOTF85g9fYkKIemosRKJbnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:32.689687Z"},"content_sha256":"fabe2e530b2d1e4db6b1be41f5c0d11a428359ac9d35ee0482a8dec0460fe296","schema_version":"1.0","event_id":"sha256:fabe2e530b2d1e4db6b1be41f5c0d11a428359ac9d35ee0482a8dec0460fe296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EZB4ET5XSBC35E24SLGM5HHNHF","target":"graph","payload":{"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"},"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-18T04:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlTin40k+DpaXZmtwQKElN6l5veoeFkDKYPUcFV9BJPc14fcHux0lFh70G4qkQrjvgVOfhWn5JgexUu2Z0WQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:32.690350Z"},"content_sha256":"ff11e75ed614ea46d44b4398b0143d080987cbc0b7518978f0c827bba4c6ddd1","schema_version":"1.0","event_id":"sha256:ff11e75ed614ea46d44b4398b0143d080987cbc0b7518978f0c827bba4c6ddd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/bundle.json","state_url":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZB4ET5XSBC35E24SLGM5HHNHF/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-30T11:05:32Z","links":{"resolver":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF","bundle":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/bundle.json","state":"https://pith.science/pith/EZB4ET5XSBC35E24SLGM5HHNHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZB4ET5XSBC35E24SLGM5HHNHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EZB4ET5XSBC35E24SLGM5HHNHF","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":"5849de9b6f39eeba19d3a284ed464703ac1958a91ca72d13d237973d971990c4","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-27T21:20:52Z","title_canon_sha256":"707062931bffd686947dbe196653d71cde141c34acd26a8c465425d0c3267806"},"schema_version":"1.0","source":{"id":"1012.5664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5664","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5664v2","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5664","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"EZB4ET5XSBC3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZB4ET5XSBC35E24","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZB4ET5X","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:ff11e75ed614ea46d44b4398b0143d080987cbc0b7518978f0c827bba4c6ddd1","target":"graph","created_at":"2026-05-18T04:12:21Z","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":"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","authors_text":"Adam Sheffer, Adrian Dumitrescu, Andr\\'e Schulz, Csaba D. T\\'oth","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-27T21:20:52Z","title":"Bounds on the maximum multiplicity of some common geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5664","kind":"arxiv","version":2},"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:fabe2e530b2d1e4db6b1be41f5c0d11a428359ac9d35ee0482a8dec0460fe296","target":"record","created_at":"2026-05-18T04:12:21Z","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":"5849de9b6f39eeba19d3a284ed464703ac1958a91ca72d13d237973d971990c4","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-27T21:20:52Z","title_canon_sha256":"707062931bffd686947dbe196653d71cde141c34acd26a8c465425d0c3267806"},"schema_version":"1.0","source":{"id":"1012.5664","kind":"arxiv","version":2}},"canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2643c24fb79045be935c92ccce9ced39550f74ad6e370a16ed2c28f7344de654","first_computed_at":"2026-05-18T04:12:21.087449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:21.087449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UtAGRPV0LPrMWtpXkdlyXJpfTJF8BDGSQsWq7/wL46MyWISIwc/TigCUG4/AHgo8iAvXUTnSnKTaBh1NNN1mCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:21.088125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fabe2e530b2d1e4db6b1be41f5c0d11a428359ac9d35ee0482a8dec0460fe296","sha256:ff11e75ed614ea46d44b4398b0143d080987cbc0b7518978f0c827bba4c6ddd1"],"state_sha256":"586388af854067e7ecfa7bc1cfcf9a20da4a2ef1f0b95549f92e2d172fe0525e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8kSoWFubAgKOT2Egxs0KKoEkrJCl+EBKAmvb6GxXU1YKB2YQbjDoOGf40xFGACzsSF2lACRjwI3hQAQYlXRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:05:32.693523Z","bundle_sha256":"40f047b0395c334ac757720a08a67308fce0d75180f868787e14c6195ea95ff1"}}