{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5QLNWQTB4YFPC6JOSZ6PVDFRUF","short_pith_number":"pith:5QLNWQTB","schema_version":"1.0","canonical_sha256":"ec16db4261e60af1792e967cfa8cb1a14f948e86c257c7cc1b12949729e7b537","source":{"kind":"arxiv","id":"1907.01581","version":1},"attestation_state":"computed","paper":{"title":"Covering graphs with convex sets and partitioning graphs into convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Luc\\'ia M. Gonz\\'alez, Luciano N. Grippo, Mart\\'in D. Safe, Vin\\'icius F. dos Santos","submitted_at":"2019-07-02T18:37:58Z","abstract_excerpt":"We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity, $P_3$-convexity, and $P_3^*$-convexity."},"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":"1907.01581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T18:37:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"17da09ff0f71d72dc83fc0ebe8da5fb6fa1f8fedf07a64faffd3e0ef038314b3","abstract_canon_sha256":"6c8e7e95d0a698edcc412cedc63b2fbcb35782a7428ef435304fe8ad394df850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.892014Z","signature_b64":"Rj5ZH3vsbqX5q/7A4KySkl4b6KVVaFZuBEg2hSS26zMYZj9E2Wfo6QGP0u477129m8BI60sv5iN8SILjoGQeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec16db4261e60af1792e967cfa8cb1a14f948e86c257c7cc1b12949729e7b537","last_reissued_at":"2026-05-17T23:41:35.891292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.891292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering graphs with convex sets and partitioning graphs into convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Luc\\'ia M. Gonz\\'alez, Luciano N. Grippo, Mart\\'in D. Safe, Vin\\'icius F. dos Santos","submitted_at":"2019-07-02T18:37:58Z","abstract_excerpt":"We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity, $P_3$-convexity, and $P_3^*$-convexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01581","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":"1907.01581","created_at":"2026-05-17T23:41:35.891426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01581v1","created_at":"2026-05-17T23:41:35.891426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01581","created_at":"2026-05-17T23:41:35.891426+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QLNWQTB4YFP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QLNWQTB4YFPC6JO","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QLNWQTB","created_at":"2026-05-18T12:33:10.108867+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/5QLNWQTB4YFPC6JOSZ6PVDFRUF","json":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF.json","graph_json":"https://pith.science/api/pith-number/5QLNWQTB4YFPC6JOSZ6PVDFRUF/graph.json","events_json":"https://pith.science/api/pith-number/5QLNWQTB4YFPC6JOSZ6PVDFRUF/events.json","paper":"https://pith.science/paper/5QLNWQTB"},"agent_actions":{"view_html":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF","download_json":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF.json","view_paper":"https://pith.science/paper/5QLNWQTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01581&json=true","fetch_graph":"https://pith.science/api/pith-number/5QLNWQTB4YFPC6JOSZ6PVDFRUF/graph.json","fetch_events":"https://pith.science/api/pith-number/5QLNWQTB4YFPC6JOSZ6PVDFRUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF/action/storage_attestation","attest_author":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF/action/author_attestation","sign_citation":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF/action/citation_signature","submit_replication":"https://pith.science/pith/5QLNWQTB4YFPC6JOSZ6PVDFRUF/action/replication_record"}},"created_at":"2026-05-17T23:41:35.891426+00:00","updated_at":"2026-05-17T23:41:35.891426+00:00"}