{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQNWWUTPB3UOV6HJT2IA2PEAWS","short_pith_number":"pith:EQNWWUTP","schema_version":"1.0","canonical_sha256":"241b6b526f0ee8eaf8e99e900d3c80b4bdf3836de8d39cfdfe9e8a576c5ce71b","source":{"kind":"arxiv","id":"1807.08295","version":1},"attestation_state":"computed","paper":{"title":"On the Geodetic Hull Number of Complementary Prisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Erika M. M. Coelho, Hebert Coelho, Jayme L. Szwarcfiter, Julliano R. Nascimento","submitted_at":"2018-07-22T15:06:18Z","abstract_excerpt":"Let $G$ be a finite, simple, and undirected graph and let $S$ be a set of vertices of $G$. In the geodetic convexity, a set of vertices $S$ of a graph $G$ is convex if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The convex hull $H(S)$ of $S$ is the smallest convex set containing $S$. If $H(S) = V(G)$, then $S$ is a hull set. The cardinality $h(G)$ of a minimum hull set of $G$ is the hull number of $G$. The complementary prism $G\\overline{G}$ of a graph $G$ arises from the disjoint union of the graph $G$ and $\\overline{G}$ by adding the edges of a perfect"},"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":"1807.08295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-22T15:06:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5334e20210cef0634428f0c6c3654c68a3f49a3b37a6f93b63913ef290a347ee","abstract_canon_sha256":"8f13ca2396f92908440559ac7def7dae1d645a074324bc45703b3a160d74aa54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.529151Z","signature_b64":"Z+WNH4EcwCHu/85nj03DPCrrJ++kpQtfcWLhrbfGfgW2gFk/Hm1n/dLi5U8nTZwyAO4YJLIGyKtCOL+qCoxfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"241b6b526f0ee8eaf8e99e900d3c80b4bdf3836de8d39cfdfe9e8a576c5ce71b","last_reissued_at":"2026-05-18T00:10:08.528441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.528441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Geodetic Hull Number of Complementary Prisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Erika M. M. Coelho, Hebert Coelho, Jayme L. Szwarcfiter, Julliano R. Nascimento","submitted_at":"2018-07-22T15:06:18Z","abstract_excerpt":"Let $G$ be a finite, simple, and undirected graph and let $S$ be a set of vertices of $G$. In the geodetic convexity, a set of vertices $S$ of a graph $G$ is convex if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The convex hull $H(S)$ of $S$ is the smallest convex set containing $S$. If $H(S) = V(G)$, then $S$ is a hull set. The cardinality $h(G)$ of a minimum hull set of $G$ is the hull number of $G$. The complementary prism $G\\overline{G}$ of a graph $G$ arises from the disjoint union of the graph $G$ and $\\overline{G}$ by adding the edges of a perfect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08295","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":"1807.08295","created_at":"2026-05-18T00:10:08.528557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08295v1","created_at":"2026-05-18T00:10:08.528557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08295","created_at":"2026-05-18T00:10:08.528557+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQNWWUTPB3UO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQNWWUTPB3UOV6HJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQNWWUTP","created_at":"2026-05-18T12:32:22.470017+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/EQNWWUTPB3UOV6HJT2IA2PEAWS","json":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS.json","graph_json":"https://pith.science/api/pith-number/EQNWWUTPB3UOV6HJT2IA2PEAWS/graph.json","events_json":"https://pith.science/api/pith-number/EQNWWUTPB3UOV6HJT2IA2PEAWS/events.json","paper":"https://pith.science/paper/EQNWWUTP"},"agent_actions":{"view_html":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS","download_json":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS.json","view_paper":"https://pith.science/paper/EQNWWUTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08295&json=true","fetch_graph":"https://pith.science/api/pith-number/EQNWWUTPB3UOV6HJT2IA2PEAWS/graph.json","fetch_events":"https://pith.science/api/pith-number/EQNWWUTPB3UOV6HJT2IA2PEAWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS/action/storage_attestation","attest_author":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS/action/author_attestation","sign_citation":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS/action/citation_signature","submit_replication":"https://pith.science/pith/EQNWWUTPB3UOV6HJT2IA2PEAWS/action/replication_record"}},"created_at":"2026-05-18T00:10:08.528557+00:00","updated_at":"2026-05-18T00:10:08.528557+00:00"}