{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FPS25H4CQ6ND4QB4REZ5T75QZ5","short_pith_number":"pith:FPS25H4C","canonical_record":{"source":{"id":"2605.21920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-21T02:45:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6801ef3b752f997d9a2c8c93ff7c4819130e48e9c39c0b943dcdca62e982d2c3","abstract_canon_sha256":"0c5d2a63748d1a8589700971d5039a9c505a6698c0ff6cb1dcb2f338ba2f180f"},"schema_version":"1.0"},"canonical_sha256":"2be5ae9f82879a3e403c8933d9ffb0cf7850d30df914c56eafd5e7f83d7b6779","source":{"kind":"arxiv","id":"2605.21920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21920","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21920v1","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21920","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"FPS25H4CQ6ND","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_16","alias_value":"FPS25H4CQ6ND4QB4","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_8","alias_value":"FPS25H4C","created_at":"2026-05-22T01:04:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FPS25H4CQ6ND4QB4REZ5T75QZ5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-21T02:45:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6801ef3b752f997d9a2c8c93ff7c4819130e48e9c39c0b943dcdca62e982d2c3","abstract_canon_sha256":"0c5d2a63748d1a8589700971d5039a9c505a6698c0ff6cb1dcb2f338ba2f180f"},"schema_version":"1.0"},"canonical_sha256":"2be5ae9f82879a3e403c8933d9ffb0cf7850d30df914c56eafd5e7f83d7b6779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:14.698411Z","signature_b64":"UoSpjVopGdTtucowjUeI9OotLTh6QtIGrXTKIlBn08ikOZWrT96f+yjPA3Yd5JDq3fvaAvn9f+FP0Bu9/Q+KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2be5ae9f82879a3e403c8933d9ffb0cf7850d30df914c56eafd5e7f83d7b6779","last_reissued_at":"2026-05-22T01:04:14.697657Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:14.697657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21920","source_version":1,"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-22T01:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CizZxTKK87hjESi8W3X0Cqy1+p5t2kSATuclTzFCZn0jqdDgjPy77Cd/6fiyq0W+kQD5xXwoZepfZgp0yuUPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:09:46.163645Z"},"content_sha256":"7ae0d3382a63c050686fad344263a09c1e0a71254e061a9c0ffa74550a8cf9a8","schema_version":"1.0","event_id":"sha256:7ae0d3382a63c050686fad344263a09c1e0a71254e061a9c0ffa74550a8cf9a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FPS25H4CQ6ND4QB4REZ5T75QZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Sum Set Cover: Structures and Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Yixin Cao, Zhongyi Zhang","submitted_at":"2026-05-21T02:45:18Z","abstract_excerpt":"A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the position of the first vertex that hits it, and the objective is to minimize the total cost. When $H$ is a graph, this is the minimum sum vertex cover problem. A solution is specified by a set cover $S$ together with an ordering of its vertices. While the classical set cover problem seeks to minimize $|S|$, the minimum sum variant favors covering many edges early and may prefer larger covers. This motivates a natural questi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21920","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21920/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"},"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-22T01:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvMNnhnT2hYXxarsRYB/WcwchY8h/VGcDpQ5xKjZTloTbyf71zQB/wdYb5ONwM7Z8GTiHj02vlQRsVaUeJhiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:09:46.164035Z"},"content_sha256":"b98211b344f641bcf9ef8fcb2bd3f06d63ce53d3cb2bf190fc9bc29d5f8a3058","schema_version":"1.0","event_id":"sha256:b98211b344f641bcf9ef8fcb2bd3f06d63ce53d3cb2bf190fc9bc29d5f8a3058"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/bundle.json","state_url":"https://pith.science/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/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-06-01T03:09:46Z","links":{"resolver":"https://pith.science/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5","bundle":"https://pith.science/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/bundle.json","state":"https://pith.science/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPS25H4CQ6ND4QB4REZ5T75QZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FPS25H4CQ6ND4QB4REZ5T75QZ5","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":"0c5d2a63748d1a8589700971d5039a9c505a6698c0ff6cb1dcb2f338ba2f180f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-21T02:45:18Z","title_canon_sha256":"6801ef3b752f997d9a2c8c93ff7c4819130e48e9c39c0b943dcdca62e982d2c3"},"schema_version":"1.0","source":{"id":"2605.21920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21920","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21920v1","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21920","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"FPS25H4CQ6ND","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_16","alias_value":"FPS25H4CQ6ND4QB4","created_at":"2026-05-22T01:04:14Z"},{"alias_kind":"pith_short_8","alias_value":"FPS25H4C","created_at":"2026-05-22T01:04:14Z"}],"graph_snapshots":[{"event_id":"sha256:b98211b344f641bcf9ef8fcb2bd3f06d63ce53d3cb2bf190fc9bc29d5f8a3058","target":"graph","created_at":"2026-05-22T01:04:14Z","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/2605.21920/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the position of the first vertex that hits it, and the objective is to minimize the total cost. When $H$ is a graph, this is the minimum sum vertex cover problem. A solution is specified by a set cover $S$ together with an ordering of its vertices. While the classical set cover problem seeks to minimize $|S|$, the minimum sum variant favors covering many edges early and may prefer larger covers. This motivates a natural questi","authors_text":"Yixin Cao, Zhongyi Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-21T02:45:18Z","title":"Minimum Sum Set Cover: Structures and Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21920","kind":"arxiv","version":1},"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:7ae0d3382a63c050686fad344263a09c1e0a71254e061a9c0ffa74550a8cf9a8","target":"record","created_at":"2026-05-22T01:04:14Z","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":"0c5d2a63748d1a8589700971d5039a9c505a6698c0ff6cb1dcb2f338ba2f180f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-21T02:45:18Z","title_canon_sha256":"6801ef3b752f997d9a2c8c93ff7c4819130e48e9c39c0b943dcdca62e982d2c3"},"schema_version":"1.0","source":{"id":"2605.21920","kind":"arxiv","version":1}},"canonical_sha256":"2be5ae9f82879a3e403c8933d9ffb0cf7850d30df914c56eafd5e7f83d7b6779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2be5ae9f82879a3e403c8933d9ffb0cf7850d30df914c56eafd5e7f83d7b6779","first_computed_at":"2026-05-22T01:04:14.697657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:14.697657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UoSpjVopGdTtucowjUeI9OotLTh6QtIGrXTKIlBn08ikOZWrT96f+yjPA3Yd5JDq3fvaAvn9f+FP0Bu9/Q+KBQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:14.698411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ae0d3382a63c050686fad344263a09c1e0a71254e061a9c0ffa74550a8cf9a8","sha256:b98211b344f641bcf9ef8fcb2bd3f06d63ce53d3cb2bf190fc9bc29d5f8a3058"],"state_sha256":"5654b3afaffb4cd2a85b022125412bf335a0160c71a99ffaa38bc5c15d45af35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crj86IAX6/IiqbiNT0/jcZW8Y+WxQvzRAnUZE+90D9aO+tghZ1JPFWjsP7sljC9cz/mi7yZs7u18I5cjmYpsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:09:46.166263Z","bundle_sha256":"90f04aef6e3cd2e46924b702c4b53bd401af32000ba14f9ca837e8804a31f88c"}}