{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C5PBQQCNSRYXP5I3RBRVW4ECXW","short_pith_number":"pith:C5PBQQCN","canonical_record":{"source":{"id":"2501.12261","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-21T16:32:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4eb3103d147160ee30ae4df56eadb5dbc49e110a0fab490ef79098533ec3af1","abstract_canon_sha256":"fcf40e655268bcce5e98959b7638dde3b41bde82afb57127927f1e042950359a"},"schema_version":"1.0"},"canonical_sha256":"175e18404d947177f51b88635b7082bdb244fc99c510f43fc0400f4f6899ef02","source":{"kind":"arxiv","id":"2501.12261","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12261","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12261v4","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12261","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"C5PBQQCNSRYX","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"C5PBQQCNSRYXP5I3","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"C5PBQQCN","created_at":"2026-07-05T11:19:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C5PBQQCNSRYXP5I3RBRVW4ECXW","target":"record","payload":{"canonical_record":{"source":{"id":"2501.12261","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-21T16:32:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4eb3103d147160ee30ae4df56eadb5dbc49e110a0fab490ef79098533ec3af1","abstract_canon_sha256":"fcf40e655268bcce5e98959b7638dde3b41bde82afb57127927f1e042950359a"},"schema_version":"1.0"},"canonical_sha256":"175e18404d947177f51b88635b7082bdb244fc99c510f43fc0400f4f6899ef02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:02.837291Z","signature_b64":"+O3ZDX5vIkH78mi7eJRo4IgFpuS8pdJi6ysTJ6yJ+LXsXWKIzZ4nupuFpkJ9LzRWU8WaUMlZvIEOmfuJgNV0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175e18404d947177f51b88635b7082bdb244fc99c510f43fc0400f4f6899ef02","last_reissued_at":"2026-07-05T11:19:02.836841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:02.836841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.12261","source_version":4,"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-07-05T11:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IirUicdenp6c24TFhnMYXosnxX6cjF9phLpG9VMwKWKTsup0jiNWj2WjMtu8+mFlBVFdd9rKxIncttgvmaCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:34:37.273404Z"},"content_sha256":"b922d51f50266e8eca6962820da51161492304ae6fde72feed0a6074cc595f1d","schema_version":"1.0","event_id":"sha256:b922d51f50266e8eca6962820da51161492304ae6fde72feed0a6074cc595f1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C5PBQQCNSRYXP5I3RBRVW4ECXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arturo Merino, Gibeom Park, Mayank Goswami, Meng-Tsung Tsai, Victor Verdugo, Waldo G\\'alvez","submitted_at":"2025-01-21T16:32:08Z","abstract_excerpt":"There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical optimization problem $\\Pi$ (e.g., spanning tree, minimum cuts, maximum matching, minimum vertex cover) with input size $n$ and an integer $k\\geq 1$, the goal is to generate a collection of $k$ maximally diverse solutions to $\\Pi$. This diverse-X paradigm not only allows the user to generate very different solutions, but also helps make systems more secure and robust by handling uncertainty, and achieve energy effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12261","kind":"arxiv","version":4},"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/2501.12261/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-07-05T11:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WgS8VgWv+ljolWZgX59/OyBoiF8Lz+AAdHEH42He3tOb+RzH8dlOmKG1QPMLQ2+u6aLOlE+tDLQrdarq9hiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:34:37.273905Z"},"content_sha256":"8562b2f63d4188f6caf396fbe2653095326e1719eb89e072bfa8fdf5d070a305","schema_version":"1.0","event_id":"sha256:8562b2f63d4188f6caf396fbe2653095326e1719eb89e072bfa8fdf5d070a305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/bundle.json","state_url":"https://pith.science/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/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-08-15T15:34:37Z","links":{"resolver":"https://pith.science/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW","bundle":"https://pith.science/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/bundle.json","state":"https://pith.science/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5PBQQCNSRYXP5I3RBRVW4ECXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C5PBQQCNSRYXP5I3RBRVW4ECXW","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":"fcf40e655268bcce5e98959b7638dde3b41bde82afb57127927f1e042950359a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-21T16:32:08Z","title_canon_sha256":"e4eb3103d147160ee30ae4df56eadb5dbc49e110a0fab490ef79098533ec3af1"},"schema_version":"1.0","source":{"id":"2501.12261","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12261","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12261v4","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12261","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"C5PBQQCNSRYX","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"C5PBQQCNSRYXP5I3","created_at":"2026-07-05T11:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"C5PBQQCN","created_at":"2026-07-05T11:19:02Z"}],"graph_snapshots":[{"event_id":"sha256:8562b2f63d4188f6caf396fbe2653095326e1719eb89e072bfa8fdf5d070a305","target":"graph","created_at":"2026-07-05T11:19:02Z","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/2501.12261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical optimization problem $\\Pi$ (e.g., spanning tree, minimum cuts, maximum matching, minimum vertex cover) with input size $n$ and an integer $k\\geq 1$, the goal is to generate a collection of $k$ maximally diverse solutions to $\\Pi$. This diverse-X paradigm not only allows the user to generate very different solutions, but also helps make systems more secure and robust by handling uncertainty, and achieve energy effici","authors_text":"Arturo Merino, Gibeom Park, Mayank Goswami, Meng-Tsung Tsai, Victor Verdugo, Waldo G\\'alvez","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12261","kind":"arxiv","version":4},"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:b922d51f50266e8eca6962820da51161492304ae6fde72feed0a6074cc595f1d","target":"record","created_at":"2026-07-05T11:19:02Z","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":"fcf40e655268bcce5e98959b7638dde3b41bde82afb57127927f1e042950359a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-21T16:32:08Z","title_canon_sha256":"e4eb3103d147160ee30ae4df56eadb5dbc49e110a0fab490ef79098533ec3af1"},"schema_version":"1.0","source":{"id":"2501.12261","kind":"arxiv","version":4}},"canonical_sha256":"175e18404d947177f51b88635b7082bdb244fc99c510f43fc0400f4f6899ef02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"175e18404d947177f51b88635b7082bdb244fc99c510f43fc0400f4f6899ef02","first_computed_at":"2026-07-05T11:19:02.836841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:02.836841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+O3ZDX5vIkH78mi7eJRo4IgFpuS8pdJi6ysTJ6yJ+LXsXWKIzZ4nupuFpkJ9LzRWU8WaUMlZvIEOmfuJgNV0AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:02.837291Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12261","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b922d51f50266e8eca6962820da51161492304ae6fde72feed0a6074cc595f1d","sha256:8562b2f63d4188f6caf396fbe2653095326e1719eb89e072bfa8fdf5d070a305"],"state_sha256":"90d53385c425aa0e99c6cd49a53976d5d8b5629bf2a33929b8d2716cb5bb2f28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omV0jvrKZIY/rrnZ9PhLM0NWUWBglC8I0fndynD+LmNk4fOnfY91wqb+KWYIq3xVWghe8+0eG8Is2Xrla7CVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:34:37.278669Z","bundle_sha256":"dc3d58e2d5330d6cd9b1e347637982e78332d82632eeaf941a3cf1a544dedd6b"}}