{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QCFD4VRRUHF5L5GVB34S2MKBWD","short_pith_number":"pith:QCFD4VRR","schema_version":"1.0","canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","source":{"kind":"arxiv","id":"1710.02958","version":2},"attestation_state":"computed","paper":{"title":"Computing metric hulls in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Nicolas Nisse","submitted_at":"2017-10-09T06:48:51Z","abstract_excerpt":"We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time algorithm to compute the convex hull-number of a graph, when all its convex subgraphs are given as input. We then show that computing if the smallest preimage of a closed set is logarithmic in the size of the ground set is LOGSNP-complete if only the ground set is given. A special instance of this problem is computing the dimension of a poset given its linear"},"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":"1710.02958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-09T06:48:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fc96f3b32360e99c06294951cff6bb2f1f111a10ea0c0b68f3c185cce8df5f91","abstract_canon_sha256":"653baa1bec5558205a561fbd510762ada4701456adcb37a0f3418c4fa3fdcb2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.060130Z","signature_b64":"TJGwYSIhbkdpjJqN6FXfocB+dgOd1R51lsfXmB6DvyRpg6LER1W4mgIiG5r08CAES8qtY4OHXZqg7M1qxNDABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","last_reissued_at":"2026-05-18T00:17:19.059566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.059566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing metric hulls in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Nicolas Nisse","submitted_at":"2017-10-09T06:48:51Z","abstract_excerpt":"We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time algorithm to compute the convex hull-number of a graph, when all its convex subgraphs are given as input. We then show that computing if the smallest preimage of a closed set is logarithmic in the size of the ground set is LOGSNP-complete if only the ground set is given. A special instance of this problem is computing the dimension of a poset given its linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02958","kind":"arxiv","version":2},"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":"1710.02958","created_at":"2026-05-18T00:17:19.059649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02958v2","created_at":"2026-05-18T00:17:19.059649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02958","created_at":"2026-05-18T00:17:19.059649+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCFD4VRRUHF5","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCFD4VRRUHF5L5GV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCFD4VRR","created_at":"2026-05-18T12:31:37.085036+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/QCFD4VRRUHF5L5GVB34S2MKBWD","json":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD.json","graph_json":"https://pith.science/api/pith-number/QCFD4VRRUHF5L5GVB34S2MKBWD/graph.json","events_json":"https://pith.science/api/pith-number/QCFD4VRRUHF5L5GVB34S2MKBWD/events.json","paper":"https://pith.science/paper/QCFD4VRR"},"agent_actions":{"view_html":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD","download_json":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD.json","view_paper":"https://pith.science/paper/QCFD4VRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02958&json=true","fetch_graph":"https://pith.science/api/pith-number/QCFD4VRRUHF5L5GVB34S2MKBWD/graph.json","fetch_events":"https://pith.science/api/pith-number/QCFD4VRRUHF5L5GVB34S2MKBWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/action/storage_attestation","attest_author":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/action/author_attestation","sign_citation":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/action/citation_signature","submit_replication":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/action/replication_record"}},"created_at":"2026-05-18T00:17:19.059649+00:00","updated_at":"2026-05-18T00:17:19.059649+00:00"}