{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QCFD4VRRUHF5L5GVB34S2MKBWD","short_pith_number":"pith:QCFD4VRR","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"},"canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","source":{"kind":"arxiv","id":"1710.02958","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02958","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02958v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02958","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"QCFD4VRRUHF5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCFD4VRRUHF5L5GV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCFD4VRR","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QCFD4VRRUHF5L5GVB34S2MKBWD","target":"record","payload":{"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"},"canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","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"},"source_kind":"arxiv","source_id":"1710.02958","source_version":2,"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:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AU54ReMiFwLTRTwvQ2xxh9hs6XUXmlrhrZ21mKxTa0Tgwj3p1ItsnJX9wMjbfu6oPGhyCTCoLUiYbAOFLteuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:27:07.415543Z"},"content_sha256":"f87147d81dd0df5d9952a070d34c33185dd7d4e1e741377d4ee8d5b58eb784cd","schema_version":"1.0","event_id":"sha256:f87147d81dd0df5d9952a070d34c33185dd7d4e1e741377d4ee8d5b58eb784cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QCFD4VRRUHF5L5GVB34S2MKBWD","target":"graph","payload":{"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"},"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:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7r5O20Z+MLgcnuqokL5X18bLXdgcfdLq440ssbAsu1jxYy0rNxlwQtPRWzC4hjPyMCIS1xL543sPeit0e5OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:27:07.416193Z"},"content_sha256":"d3675712aa54188393380a7855a570925102cab67c81128da0563f3af3ba5b1c","schema_version":"1.0","event_id":"sha256:d3675712aa54188393380a7855a570925102cab67c81128da0563f3af3ba5b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/bundle.json","state_url":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/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-26T04:27:07Z","links":{"resolver":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD","bundle":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/bundle.json","state":"https://pith.science/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCFD4VRRUHF5L5GVB34S2MKBWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QCFD4VRRUHF5L5GVB34S2MKBWD","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":"653baa1bec5558205a561fbd510762ada4701456adcb37a0f3418c4fa3fdcb2d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-09T06:48:51Z","title_canon_sha256":"fc96f3b32360e99c06294951cff6bb2f1f111a10ea0c0b68f3c185cce8df5f91"},"schema_version":"1.0","source":{"id":"1710.02958","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02958","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02958v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02958","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"QCFD4VRRUHF5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCFD4VRRUHF5L5GV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCFD4VRR","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d3675712aa54188393380a7855a570925102cab67c81128da0563f3af3ba5b1c","target":"graph","created_at":"2026-05-18T00:17:19Z","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 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","authors_text":"Kolja Knauer, Nicolas Nisse","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-09T06:48:51Z","title":"Computing metric hulls in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02958","kind":"arxiv","version":2},"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:f87147d81dd0df5d9952a070d34c33185dd7d4e1e741377d4ee8d5b58eb784cd","target":"record","created_at":"2026-05-18T00:17:19Z","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":"653baa1bec5558205a561fbd510762ada4701456adcb37a0f3418c4fa3fdcb2d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-09T06:48:51Z","title_canon_sha256":"fc96f3b32360e99c06294951cff6bb2f1f111a10ea0c0b68f3c185cce8df5f91"},"schema_version":"1.0","source":{"id":"1710.02958","kind":"arxiv","version":2}},"canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"808a3e5631a1cbd5f4d50ef92d3141b0e8bfcaa7da42d07885621f31cd736a50","first_computed_at":"2026-05-18T00:17:19.059566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:19.059566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TJGwYSIhbkdpjJqN6FXfocB+dgOd1R51lsfXmB6DvyRpg6LER1W4mgIiG5r08CAES8qtY4OHXZqg7M1qxNDABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:19.060130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02958","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f87147d81dd0df5d9952a070d34c33185dd7d4e1e741377d4ee8d5b58eb784cd","sha256:d3675712aa54188393380a7855a570925102cab67c81128da0563f3af3ba5b1c"],"state_sha256":"8e6f73652f3e12ebb22b48544ee691e4f06763875d2d256e7994898dfb987adc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHfbF9PTsvOn8OWN5KmHlknYPyMznMUFtAlLx6tPCHdCXUJe9TECfl9lnh+y7RbKOKZeELhsGs4I5PWFcWNKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:27:07.420029Z","bundle_sha256":"da5ac2c8e4e4ba2152962d46cc1c3fc14c0449a1f8b13981dfa1416d6c98787f"}}