{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3ODMCDPLVBV3BX22UQUPWYDRFO","short_pith_number":"pith:3ODMCDPL","schema_version":"1.0","canonical_sha256":"db86c10deba86bb0df5aa428fb60712bb1283209ff0aae9ce234599d6c57588e","source":{"kind":"arxiv","id":"1708.02024","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.02024","created_at":"2026-05-18T00:38:32.517216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02024v1","created_at":"2026-05-18T00:38:32.517216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02024","created_at":"2026-05-18T00:38:32.517216+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ODMCDPLVBV3","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ODMCDPLVBV3BX22","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ODMCDPL","created_at":"2026-05-18T12:30:58.224056+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/3ODMCDPLVBV3BX22UQUPWYDRFO","json":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO.json","graph_json":"https://pith.science/api/pith-number/3ODMCDPLVBV3BX22UQUPWYDRFO/graph.json","events_json":"https://pith.science/api/pith-number/3ODMCDPLVBV3BX22UQUPWYDRFO/events.json","paper":"https://pith.science/paper/3ODMCDPL"},"agent_actions":{"view_html":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO","download_json":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO.json","view_paper":"https://pith.science/paper/3ODMCDPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02024&json=true","fetch_graph":"https://pith.science/api/pith-number/3ODMCDPLVBV3BX22UQUPWYDRFO/graph.json","fetch_events":"https://pith.science/api/pith-number/3ODMCDPLVBV3BX22UQUPWYDRFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/action/storage_attestation","attest_author":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/action/author_attestation","sign_citation":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/action/citation_signature","submit_replication":"https://pith.science/pith/3ODMCDPLVBV3BX22UQUPWYDRFO/action/replication_record"}},"created_at":"2026-05-18T00:38:32.517216+00:00","updated_at":"2026-05-18T00:38:32.517216+00:00"}