{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AL3OBQJD2CXH67ZLKORP2YKOO2","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":"b81082ec00e101dfe1fe2234c8de330fd2d019ac05b7a83acfb697ade9fa85df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-10T13:32:26Z","title_canon_sha256":"5a5eb51d07c6e40efd88f26f7363c1dee48a76176b2473fb7faebd2d3908d949"},"schema_version":"1.0","source":{"id":"2101.03546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.03546","created_at":"2026-07-05T03:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"2101.03546v2","created_at":"2026-07-05T03:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03546","created_at":"2026-07-05T03:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"AL3OBQJD2CXH","created_at":"2026-07-05T03:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"AL3OBQJD2CXH67ZL","created_at":"2026-07-05T03:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"AL3OBQJD","created_at":"2026-07-05T03:03:06Z"}],"graph_snapshots":[{"event_id":"sha256:088b8af6d0ce4d404551c58ebdcf8679eea1e166e09b9859fcf044d667ae286b","target":"graph","created_at":"2026-07-05T03:03:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.03546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Hande Yaman, Nicola Morandi, Roel Leus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-10T13:32:26Z","title":"Exact algorithms for budgeted prize-collecting covering subgraph problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03546","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:e8691f07df1cea422903a05a093b4608c06dcd2812a0b4a99c7401424d8a6b09","target":"record","created_at":"2026-07-05T03:03:06Z","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":"b81082ec00e101dfe1fe2234c8de330fd2d019ac05b7a83acfb697ade9fa85df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-10T13:32:26Z","title_canon_sha256":"5a5eb51d07c6e40efd88f26f7363c1dee48a76176b2473fb7faebd2d3908d949"},"schema_version":"1.0","source":{"id":"2101.03546","kind":"arxiv","version":2}},"canonical_sha256":"02f6e0c123d0ae7f7f2b53a2fd614e76a97dee261db51630059818e234bc42be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f6e0c123d0ae7f7f2b53a2fd614e76a97dee261db51630059818e234bc42be","first_computed_at":"2026-07-05T03:03:06.705097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:06.705097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xdGhYGom9WBq6/6+NfR6V4M8zq8u/RJOyYFGMva1BlJsj4jPAh3w6XOVVk+B65F+nDIHe6hLwgjUOm2a01LDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:06.705543Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.03546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8691f07df1cea422903a05a093b4608c06dcd2812a0b4a99c7401424d8a6b09","sha256:088b8af6d0ce4d404551c58ebdcf8679eea1e166e09b9859fcf044d667ae286b"],"state_sha256":"b8b137ab0317706c9527e9428affb6e7f7ce1fb0133d3f8639184a9bcf8040fa"}