{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AEGR2YFDIAKBRPA44RF2RDAQTL","short_pith_number":"pith:AEGR2YFD","canonical_record":{"source":{"id":"1209.0194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-02T17:20:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"085894516f4fe4f8ea63a0a20223547f0c070fa1ad78f719738b54bae15c9cd0","abstract_canon_sha256":"424deb00977d760fa6a94421d06e8d217b7c602a3429bc01594ac7cc15211bbc"},"schema_version":"1.0"},"canonical_sha256":"010d1d60a3401418bc1ce44ba88c109ae8c74103a0a860823f3f3d7766526a03","source":{"kind":"arxiv","id":"1209.0194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0194","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0194v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0194","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"AEGR2YFDIAKB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEGR2YFDIAKBRPA4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEGR2YFD","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AEGR2YFDIAKBRPA44RF2RDAQTL","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-02T17:20:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"085894516f4fe4f8ea63a0a20223547f0c070fa1ad78f719738b54bae15c9cd0","abstract_canon_sha256":"424deb00977d760fa6a94421d06e8d217b7c602a3429bc01594ac7cc15211bbc"},"schema_version":"1.0"},"canonical_sha256":"010d1d60a3401418bc1ce44ba88c109ae8c74103a0a860823f3f3d7766526a03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:29.691655Z","signature_b64":"AQOgcZrGqBf7xziiS04Uck9AaMHJW0RySng+wvD5gtu9+gyw8l4lbDeowdP50S3++E3KnxytHib0IbiE6fQqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"010d1d60a3401418bc1ce44ba88c109ae8c74103a0a860823f3f3d7766526a03","last_reissued_at":"2026-05-18T03:46:29.690920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:29.690920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0194","source_version":1,"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-18T03:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hkb8cLk5dprHIFww20BE3HvmYnAznc0gYkk/A1MX7OHNUq0g52I+FSZFABPy3pLxVAwT7KMTs1kCvhy9RFtmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:07:28.110526Z"},"content_sha256":"d834a757225d677a61550cff4f935c0a0e28a9442897b81231f5c0b46b5f17ba","schema_version":"1.0","event_id":"sha256:d834a757225d677a61550cff4f935c0a0e28a9442897b81231f5c0b46b5f17ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AEGR2YFDIAKBRPA44RF2RDAQTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Plane Graphs: Cross-Graph Charging Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Adam Sheffer, Micha Sharir","submitted_at":"2012-09-02T17:20:47Z","abstract_excerpt":"We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of triangulations that are embedded over a fixed set of points in the plane. We show how this method can be generalized to obtain results for various other types of graphs that are embedded in the plane. Specifically, we obtain a new bound of $O^*(187.53^N)$ (where the $O^*()$ notation hides polynomial factors) for the maximum number of crossing-free straight-edge graphs th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0194","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"},"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-18T03:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRqU1IGj190IGATbdU9EV74d6wbpQSRQl/oWm+AfaeHklb1ymyYHwb4VicIV64yqAZosmSKu6dMMXHoERxmXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:07:28.111182Z"},"content_sha256":"fcbb287e334ad340f9249e8181add691be41d26ccd01aebed1a740f3e4df743e","schema_version":"1.0","event_id":"sha256:fcbb287e334ad340f9249e8181add691be41d26ccd01aebed1a740f3e4df743e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/bundle.json","state_url":"https://pith.science/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/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-27T09:07:28Z","links":{"resolver":"https://pith.science/pith/AEGR2YFDIAKBRPA44RF2RDAQTL","bundle":"https://pith.science/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/bundle.json","state":"https://pith.science/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEGR2YFDIAKBRPA44RF2RDAQTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AEGR2YFDIAKBRPA44RF2RDAQTL","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":"424deb00977d760fa6a94421d06e8d217b7c602a3429bc01594ac7cc15211bbc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-02T17:20:47Z","title_canon_sha256":"085894516f4fe4f8ea63a0a20223547f0c070fa1ad78f719738b54bae15c9cd0"},"schema_version":"1.0","source":{"id":"1209.0194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0194","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0194v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0194","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"AEGR2YFDIAKB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEGR2YFDIAKBRPA4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEGR2YFD","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:fcbb287e334ad340f9249e8181add691be41d26ccd01aebed1a740f3e4df743e","target":"graph","created_at":"2026-05-18T03:46:29Z","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 study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of triangulations that are embedded over a fixed set of points in the plane. We show how this method can be generalized to obtain results for various other types of graphs that are embedded in the plane. Specifically, we obtain a new bound of $O^*(187.53^N)$ (where the $O^*()$ notation hides polynomial factors) for the maximum number of crossing-free straight-edge graphs th","authors_text":"Adam Sheffer, Micha Sharir","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-02T17:20:47Z","title":"Counting Plane Graphs: Cross-Graph Charging Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0194","kind":"arxiv","version":1},"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:d834a757225d677a61550cff4f935c0a0e28a9442897b81231f5c0b46b5f17ba","target":"record","created_at":"2026-05-18T03:46:29Z","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":"424deb00977d760fa6a94421d06e8d217b7c602a3429bc01594ac7cc15211bbc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-02T17:20:47Z","title_canon_sha256":"085894516f4fe4f8ea63a0a20223547f0c070fa1ad78f719738b54bae15c9cd0"},"schema_version":"1.0","source":{"id":"1209.0194","kind":"arxiv","version":1}},"canonical_sha256":"010d1d60a3401418bc1ce44ba88c109ae8c74103a0a860823f3f3d7766526a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"010d1d60a3401418bc1ce44ba88c109ae8c74103a0a860823f3f3d7766526a03","first_computed_at":"2026-05-18T03:46:29.690920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:29.690920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQOgcZrGqBf7xziiS04Uck9AaMHJW0RySng+wvD5gtu9+gyw8l4lbDeowdP50S3++E3KnxytHib0IbiE6fQqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:29.691655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d834a757225d677a61550cff4f935c0a0e28a9442897b81231f5c0b46b5f17ba","sha256:fcbb287e334ad340f9249e8181add691be41d26ccd01aebed1a740f3e4df743e"],"state_sha256":"09cc7196257e370ef4d6d8f428a38f5499cdef1a8c5a7278c62a817747d9e534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fSH1oAC7EhcIiI9s4H4DRWPLas/vIoeLhDKmcohWt90FlQcc8Lu0gosI4s1sbgBe1v9Xk95FR6BD+IYe9U7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:07:28.115515Z","bundle_sha256":"30a68a4112ebec84e3b2dc175ac53a5339abd35f7bac00dc5b02ef6915cef06c"}}