{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ODMCDPLVBV3BX22UQUPWYDRFO","short_pith_number":"pith:3ODMCDPL","canonical_record":{"source":{"id":"1708.02024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T07:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"2b971ff453337c5235da3da23f18e908c0e654220673b58ccbbab7b47aa2c93e","abstract_canon_sha256":"be3c67334c2e9f02adf18317681da765232cef9435b4be80ce0bf2de332936fb"},"schema_version":"1.0"},"canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","source":{"kind":"arxiv","id":"1708.02024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02024","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02024v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02024","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"3ODMCDPLVBV3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ODMCDPLVBV3BX22","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ODMCDPL","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ODMCDPLVBV3BX22UQUPWYDRFO","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T07:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"2b971ff453337c5235da3da23f18e908c0e654220673b58ccbbab7b47aa2c93e","abstract_canon_sha256":"be3c67334c2e9f02adf18317681da765232cef9435b4be80ce0bf2de332936fb"},"schema_version":"1.0"},"canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.517609Z","signature_b64":"vfbOkB7JkWJGLIoIpj6C8hgXpKvgw7LHPBQqWmDCA9AVaUENkJrICCtiEgBXXj/xO6loLyZuLGEr17UFEZocCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","last_reissued_at":"2026-05-18T00:38:32.517156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.517156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02024","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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrmqfIkuKJvJ12dlmaofRxW70e8KC4+wZhmVuXLLiBkV5m8BO27N8dLiAP7mCUdaQefhO9eRseHISq2Nk+xeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:51:16.773151Z"},"content_sha256":"f88aea5938f08bebd924c69dcc9b8fc0b45342d5854ced2de1e608ae9963543e","schema_version":"1.0","event_id":"sha256:f88aea5938f08bebd924c69dcc9b8fc0b45342d5854ced2de1e608ae9963543e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ODMCDPLVBV3BX22UQUPWYDRFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum number of edges in plane graph with fixed exterior face degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adem Kilicman, Gek L. Chiab, Hazim Michman Trao, Niran Abbas Ali","submitted_at":"2017-08-07T07:53:44Z","abstract_excerpt":"A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \\leq \\frac{g}{g-2}(n-2)$. We show that a connected simple plane graph with $n$ vertices and girth $g$, and exterior face of degree $h$ has at most $\\frac{g}{g-2}(n-2)- \\frac{1}{g-2}(h-g)$ edges. A \\emph{convex hull $g$-angulation} is a connected plane graph in which the exterior face is a simple $h$-cycle and all inner faces are $g$-cycles. For a given set $S$ of $n$ point in the plane having $h$ points in the boundary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02024","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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt7NFBXAl2/UIOxw2UnIsiE81C52T9UOMLQwjmBHcF94KMtGeRzxtfLzRqokgezIKm2V3avNwf3+obwdEd21Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:51:16.773514Z"},"content_sha256":"0578e4ff9017377cc6a9e93aad0c4bff6781828e2e4c8cdd98bf5ccb6329d54b","schema_version":"1.0","event_id":"sha256:0578e4ff9017377cc6a9e93aad0c4bff6781828e2e4c8cdd98bf5ccb6329d54b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/bundle.json","state_url":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/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-21T03:51:16Z","links":{"resolver":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO","bundle":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/bundle.json","state":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ODMCDPLVBV3BX22UQUPWYDRFO","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":"be3c67334c2e9f02adf18317681da765232cef9435b4be80ce0bf2de332936fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T07:53:44Z","title_canon_sha256":"2b971ff453337c5235da3da23f18e908c0e654220673b58ccbbab7b47aa2c93e"},"schema_version":"1.0","source":{"id":"1708.02024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02024","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02024v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02024","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"3ODMCDPLVBV3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ODMCDPLVBV3BX22","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ODMCDPL","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:0578e4ff9017377cc6a9e93aad0c4bff6781828e2e4c8cdd98bf5ccb6329d54b","target":"graph","created_at":"2026-05-18T00:38:32Z","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":"A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \\leq \\frac{g}{g-2}(n-2)$. We show that a connected simple plane graph with $n$ vertices and girth $g$, and exterior face of degree $h$ has at most $\\frac{g}{g-2}(n-2)- \\frac{1}{g-2}(h-g)$ edges. A \\emph{convex hull $g$-angulation} is a connected plane graph in which the exterior face is a simple $h$-cycle and all inner faces are $g$-cycles. For a given set $S$ of $n$ point in the plane having $h$ points in the boundary ","authors_text":"Adem Kilicman, Gek L. Chiab, Hazim Michman Trao, Niran Abbas Ali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T07:53:44Z","title":"On the maximum number of edges in plane graph with fixed exterior face degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02024","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:f88aea5938f08bebd924c69dcc9b8fc0b45342d5854ced2de1e608ae9963543e","target":"record","created_at":"2026-05-18T00:38:32Z","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":"be3c67334c2e9f02adf18317681da765232cef9435b4be80ce0bf2de332936fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T07:53:44Z","title_canon_sha256":"2b971ff453337c5235da3da23f18e908c0e654220673b58ccbbab7b47aa2c93e"},"schema_version":"1.0","source":{"id":"1708.02024","kind":"arxiv","version":1}},"canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","first_computed_at":"2026-05-18T00:38:32.517156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.517156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vfbOkB7JkWJGLIoIpj6C8hgXpKvgw7LHPBQqWmDCA9AVaUENkJrICCtiEgBXXj/xO6loLyZuLGEr17UFEZocCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.517609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f88aea5938f08bebd924c69dcc9b8fc0b45342d5854ced2de1e608ae9963543e","sha256:0578e4ff9017377cc6a9e93aad0c4bff6781828e2e4c8cdd98bf5ccb6329d54b"],"state_sha256":"8858b3a23ac0653982474d3bfc3ef25c81662d90c16650b95c30b30d782303ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taQUdNF4GJa6mUlthsqLtVJwp4tOcPU4fohg1bgmbarUFiySpvtBX16VK2bvipBX1g6sWI1bWyyiqE4dzQAbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:51:16.775264Z","bundle_sha256":"48489b1184883769af92d60f7739abae002e887914019fa0f43572164b7eeb5f"}}