{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AL3OBQJD2CXH67ZLKORP2YKOO2","short_pith_number":"pith:AL3OBQJD","schema_version":"1.0","canonical_sha256":"02f6e0c123d0ae7f7f2b53a2fd614e76a97dee261db51630059818e234bc42be","source":{"kind":"arxiv","id":"2101.03546","version":2},"attestation_state":"computed","paper":{"title":"Exact algorithms for budgeted prize-collecting covering subgraph problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hande Yaman, Nicola Morandi, Roel Leus","submitted_at":"2021-01-10T13:32:26Z","abstract_excerpt":"We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to find a connected subgraph such that the cost of its edges does not exceed a given budget and its collected prize is maximum. A vertex prize is collected when the vertex is visited, but the price can also be partially collected if the vertex is covered, where an unvisited vertex is covered by a visited one if the latter belongs to the former's neighbourhood. A capacity limit is imposed on the number of vertices that "},"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":"2101.03546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-10T13:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"5a5eb51d07c6e40efd88f26f7363c1dee48a76176b2473fb7faebd2d3908d949","abstract_canon_sha256":"b81082ec00e101dfe1fe2234c8de330fd2d019ac05b7a83acfb697ade9fa85df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:06.705543Z","signature_b64":"1xdGhYGom9WBq6/6+NfR6V4M8zq8u/RJOyYFGMva1BlJsj4jPAh3w6XOVVk+B65F+nDIHe6hLwgjUOm2a01LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f6e0c123d0ae7f7f2b53a2fd614e76a97dee261db51630059818e234bc42be","last_reissued_at":"2026-07-05T03:03:06.705097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:06.705097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact algorithms for budgeted prize-collecting covering subgraph problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hande Yaman, Nicola Morandi, Roel Leus","submitted_at":"2021-01-10T13:32:26Z","abstract_excerpt":"We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to find a connected subgraph such that the cost of its edges does not exceed a given budget and its collected prize is maximum. A vertex prize is collected when the vertex is visited, but the price can also be partially collected if the vertex is covered, where an unvisited vertex is covered by a visited one if the latter belongs to the former's neighbourhood. A capacity limit is imposed on the number of vertices that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03546","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.03546/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.03546","created_at":"2026-07-05T03:03:06.705147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.03546v2","created_at":"2026-07-05T03:03:06.705147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03546","created_at":"2026-07-05T03:03:06.705147+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL3OBQJD2CXH","created_at":"2026-07-05T03:03:06.705147+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL3OBQJD2CXH67ZL","created_at":"2026-07-05T03:03:06.705147+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL3OBQJD","created_at":"2026-07-05T03:03:06.705147+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/AL3OBQJD2CXH67ZLKORP2YKOO2","json":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2.json","graph_json":"https://pith.science/api/pith-number/AL3OBQJD2CXH67ZLKORP2YKOO2/graph.json","events_json":"https://pith.science/api/pith-number/AL3OBQJD2CXH67ZLKORP2YKOO2/events.json","paper":"https://pith.science/paper/AL3OBQJD"},"agent_actions":{"view_html":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2","download_json":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2.json","view_paper":"https://pith.science/paper/AL3OBQJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.03546&json=true","fetch_graph":"https://pith.science/api/pith-number/AL3OBQJD2CXH67ZLKORP2YKOO2/graph.json","fetch_events":"https://pith.science/api/pith-number/AL3OBQJD2CXH67ZLKORP2YKOO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2/action/storage_attestation","attest_author":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2/action/author_attestation","sign_citation":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2/action/citation_signature","submit_replication":"https://pith.science/pith/AL3OBQJD2CXH67ZLKORP2YKOO2/action/replication_record"}},"created_at":"2026-07-05T03:03:06.705147+00:00","updated_at":"2026-07-05T03:03:06.705147+00:00"}