{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BLH2MQKAMIZIX7B7A5236SIVMS","short_pith_number":"pith:BLH2MQKA","canonical_record":{"source":{"id":"1704.03066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T21:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"3bb3da78f597774f4cbe290d5013dae50a8bd42d198539157e3cb8eb7a2c23ca","abstract_canon_sha256":"f06f4e86b7cf9f1e5771f893a215972e2f45f2745d69a6a5cb36dc218e8980fc"},"schema_version":"1.0"},"canonical_sha256":"0acfa6414062328bfc3f0775bf491564a72ef567e89668a5dda533632b6ed13f","source":{"kind":"arxiv","id":"1704.03066","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03066","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03066v3","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03066","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"BLH2MQKAMIZI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BLH2MQKAMIZIX7B7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BLH2MQKA","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BLH2MQKAMIZIX7B7A5236SIVMS","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T21:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"3bb3da78f597774f4cbe290d5013dae50a8bd42d198539157e3cb8eb7a2c23ca","abstract_canon_sha256":"f06f4e86b7cf9f1e5771f893a215972e2f45f2745d69a6a5cb36dc218e8980fc"},"schema_version":"1.0"},"canonical_sha256":"0acfa6414062328bfc3f0775bf491564a72ef567e89668a5dda533632b6ed13f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:21.150121Z","signature_b64":"G6scQR9XN6w7q8HFZRaSMAA8CSktlrz8qREJ9VAPEyRHyeGZhjlIKcnjVQV4sQh7LjDThLB76b+G9IRbGiHyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acfa6414062328bfc3f0775bf491564a72ef567e89668a5dda533632b6ed13f","last_reissued_at":"2026-05-17T23:45:21.149479Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:21.149479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03066","source_version":3,"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-17T23:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15Kmc9fZd0hkPoycIp1WL86Ejg2x5kWlyRHksUOZpjZkygTRjKxyWNvmnkOUt5K4ypaocMMR6rrd/RqIzpruBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:30.711909Z"},"content_sha256":"ce45bbfd89a9176de17dbfc367df0f5b3c9534ee06451e64e2aec724df698084","schema_version":"1.0","event_id":"sha256:ce45bbfd89a9176de17dbfc367df0f5b3c9534ee06451e64e2aec724df698084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BLH2MQKAMIZIX7B7A5236SIVMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Properties of Numbers of Plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Siddharth Prasad","submitted_at":"2017-04-10T21:52:27Z","abstract_excerpt":"We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the number of graphs with $m$ edges. We show how a relatively small improvement of this bound would improve existing bounds concerning numbers of plane graphs with a prescribed number of edges. Furthermore, we use a cross-graph charging scheme to derive lower bounds for the number of such graphs when the point set has few extreme points."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03066","kind":"arxiv","version":3},"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-17T23:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nhT5DoWyhRJspUeATEf2+OACzFS72yCqox/kPXyuzC7yVhEHyOs+cSnmwou5jtf6PE+iwL+fcrAPBkmpWvoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:30.712248Z"},"content_sha256":"cc12ca01ef92ab56b7769ca04061f1dfef1c7a36fe9be98d62b169662b10015b","schema_version":"1.0","event_id":"sha256:cc12ca01ef92ab56b7769ca04061f1dfef1c7a36fe9be98d62b169662b10015b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLH2MQKAMIZIX7B7A5236SIVMS/bundle.json","state_url":"https://pith.science/pith/BLH2MQKAMIZIX7B7A5236SIVMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLH2MQKAMIZIX7B7A5236SIVMS/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-06-25T20:24:30Z","links":{"resolver":"https://pith.science/pith/BLH2MQKAMIZIX7B7A5236SIVMS","bundle":"https://pith.science/pith/BLH2MQKAMIZIX7B7A5236SIVMS/bundle.json","state":"https://pith.science/pith/BLH2MQKAMIZIX7B7A5236SIVMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLH2MQKAMIZIX7B7A5236SIVMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BLH2MQKAMIZIX7B7A5236SIVMS","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":"f06f4e86b7cf9f1e5771f893a215972e2f45f2745d69a6a5cb36dc218e8980fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T21:52:27Z","title_canon_sha256":"3bb3da78f597774f4cbe290d5013dae50a8bd42d198539157e3cb8eb7a2c23ca"},"schema_version":"1.0","source":{"id":"1704.03066","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03066","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03066v3","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03066","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"BLH2MQKAMIZI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BLH2MQKAMIZIX7B7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BLH2MQKA","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:cc12ca01ef92ab56b7769ca04061f1dfef1c7a36fe9be98d62b169662b10015b","target":"graph","created_at":"2026-05-17T23:45: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 explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the number of graphs with $m$ edges. We show how a relatively small improvement of this bound would improve existing bounds concerning numbers of plane graphs with a prescribed number of edges. Furthermore, we use a cross-graph charging scheme to derive lower bounds for the number of such graphs when the point set has few extreme points.","authors_text":"Siddharth Prasad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T21:52:27Z","title":"New Properties of Numbers of Plane Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03066","kind":"arxiv","version":3},"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:ce45bbfd89a9176de17dbfc367df0f5b3c9534ee06451e64e2aec724df698084","target":"record","created_at":"2026-05-17T23:45: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":"f06f4e86b7cf9f1e5771f893a215972e2f45f2745d69a6a5cb36dc218e8980fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T21:52:27Z","title_canon_sha256":"3bb3da78f597774f4cbe290d5013dae50a8bd42d198539157e3cb8eb7a2c23ca"},"schema_version":"1.0","source":{"id":"1704.03066","kind":"arxiv","version":3}},"canonical_sha256":"0acfa6414062328bfc3f0775bf491564a72ef567e89668a5dda533632b6ed13f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0acfa6414062328bfc3f0775bf491564a72ef567e89668a5dda533632b6ed13f","first_computed_at":"2026-05-17T23:45:21.149479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:21.149479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6scQR9XN6w7q8HFZRaSMAA8CSktlrz8qREJ9VAPEyRHyeGZhjlIKcnjVQV4sQh7LjDThLB76b+G9IRbGiHyBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:21.150121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03066","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce45bbfd89a9176de17dbfc367df0f5b3c9534ee06451e64e2aec724df698084","sha256:cc12ca01ef92ab56b7769ca04061f1dfef1c7a36fe9be98d62b169662b10015b"],"state_sha256":"e510bdd83dc2badcc94fc2fe0b0b255792cc6daa194d9a9672792a2b97e7df16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ik49+SS2cjq3lmBqhjjzhhmQSZsY/2tTvK7JcdqX3DEFQVwfDGGHtcSDDuJ3YNj6sXCY9wV2fGzKqpXxWBTYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:24:30.714172Z","bundle_sha256":"6c2ddb785834de9aad4421879e6ab42d2d93a6332ac12a24804cd6d178d0b615"}}