{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BNFCSNVB5B5NVTY2U2ODTJSN7N","short_pith_number":"pith:BNFCSNVB","canonical_record":{"source":{"id":"2302.11475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-22T16:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"15bd755c0a7a9f58730d342513e240e61ad066117299dec98db3876d27ba3594","abstract_canon_sha256":"ade9fa6989de27ce1217673ab334a50b2640d5e6159cf8192ee32701d9eee40f"},"schema_version":"1.0"},"canonical_sha256":"0b4a2936a1e87adacf1aa69c39a64dfb7c2c122f23f703aef9a960a97ce3c463","source":{"kind":"arxiv","id":"2302.11475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.11475","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2302.11475v1","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11475","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"BNFCSNVB5B5N","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"BNFCSNVB5B5NVTY2","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"BNFCSNVB","created_at":"2026-07-05T05:44:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BNFCSNVB5B5NVTY2U2ODTJSN7N","target":"record","payload":{"canonical_record":{"source":{"id":"2302.11475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-22T16:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"15bd755c0a7a9f58730d342513e240e61ad066117299dec98db3876d27ba3594","abstract_canon_sha256":"ade9fa6989de27ce1217673ab334a50b2640d5e6159cf8192ee32701d9eee40f"},"schema_version":"1.0"},"canonical_sha256":"0b4a2936a1e87adacf1aa69c39a64dfb7c2c122f23f703aef9a960a97ce3c463","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:44.024265Z","signature_b64":"k0oy0ov9tXXebubNuEgSEQWGjFxJT5FUzXoWjj+SJvRkIHtbMoUYWNFK04H+iZIeT1q+hamw83HyZWfMgZQZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4a2936a1e87adacf1aa69c39a64dfb7c2c122f23f703aef9a960a97ce3c463","last_reissued_at":"2026-07-05T05:44:44.023866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:44.023866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.11475","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-07-05T05:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3bNCieA2FIplIP8kptMdovVskZmG953uUi26S+6YX9drzu2qAIiUfa+8XNos3QHhky6YaWT1Poh/xPBRXquDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:10:21.189238Z"},"content_sha256":"b64cb18fe67599ff9124a3316a6da1e6ae948fd597b0b37b1b95b3facbf770ac","schema_version":"1.0","event_id":"sha256:b64cb18fe67599ff9124a3316a6da1e6ae948fd597b0b37b1b95b3facbf770ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BNFCSNVB5B5NVTY2U2ODTJSN7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degrees and Network Design: New Problems and Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Michael Dinitz, Shi Li","submitted_at":"2023-02-22T16:22:25Z","abstract_excerpt":"While much of network design focuses mostly on cost (number or weight of edges), node degrees have also played an important role. They have traditionally either appeared as an objective, to minimize the maximum degree (e.g., the Minimum Degree Spanning Tree problem), or as constraints which might be violated to give bicriteria approximations (e.g., the Minimum Cost Degree Bounded Spanning Tree problem). We extend the study of degrees in network design in two ways. First, we introduce and study a new variant of the Survivable Network Design Problem where in addition to the traditional objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11475","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/2302.11475/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-05T05:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wm2ZT9yptbnmlZEeh+XligDHH9kkXX1P9kIB2QATQChH0qxNyQONlD8KIZcCpt2ABEtwbaKkZQ2IWFFktTFlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:10:21.189843Z"},"content_sha256":"e87d4db61a409be1c127f37c68c04601230105abcd674852b76ed6809b61c7ae","schema_version":"1.0","event_id":"sha256:e87d4db61a409be1c127f37c68c04601230105abcd674852b76ed6809b61c7ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/bundle.json","state_url":"https://pith.science/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/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-05T09:10:21Z","links":{"resolver":"https://pith.science/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N","bundle":"https://pith.science/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/bundle.json","state":"https://pith.science/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNFCSNVB5B5NVTY2U2ODTJSN7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BNFCSNVB5B5NVTY2U2ODTJSN7N","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":"ade9fa6989de27ce1217673ab334a50b2640d5e6159cf8192ee32701d9eee40f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-22T16:22:25Z","title_canon_sha256":"15bd755c0a7a9f58730d342513e240e61ad066117299dec98db3876d27ba3594"},"schema_version":"1.0","source":{"id":"2302.11475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.11475","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2302.11475v1","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11475","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"BNFCSNVB5B5N","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"BNFCSNVB5B5NVTY2","created_at":"2026-07-05T05:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"BNFCSNVB","created_at":"2026-07-05T05:44:44Z"}],"graph_snapshots":[{"event_id":"sha256:e87d4db61a409be1c127f37c68c04601230105abcd674852b76ed6809b61c7ae","target":"graph","created_at":"2026-07-05T05:44:44Z","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/2302.11475/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While much of network design focuses mostly on cost (number or weight of edges), node degrees have also played an important role. They have traditionally either appeared as an objective, to minimize the maximum degree (e.g., the Minimum Degree Spanning Tree problem), or as constraints which might be violated to give bicriteria approximations (e.g., the Minimum Cost Degree Bounded Spanning Tree problem). We extend the study of degrees in network design in two ways. First, we introduce and study a new variant of the Survivable Network Design Problem where in addition to the traditional objective","authors_text":"Guy Kortsarz, Michael Dinitz, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-22T16:22:25Z","title":"Degrees and Network Design: New Problems and Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11475","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:b64cb18fe67599ff9124a3316a6da1e6ae948fd597b0b37b1b95b3facbf770ac","target":"record","created_at":"2026-07-05T05:44:44Z","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":"ade9fa6989de27ce1217673ab334a50b2640d5e6159cf8192ee32701d9eee40f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-22T16:22:25Z","title_canon_sha256":"15bd755c0a7a9f58730d342513e240e61ad066117299dec98db3876d27ba3594"},"schema_version":"1.0","source":{"id":"2302.11475","kind":"arxiv","version":1}},"canonical_sha256":"0b4a2936a1e87adacf1aa69c39a64dfb7c2c122f23f703aef9a960a97ce3c463","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b4a2936a1e87adacf1aa69c39a64dfb7c2c122f23f703aef9a960a97ce3c463","first_computed_at":"2026-07-05T05:44:44.023866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:44:44.023866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0oy0ov9tXXebubNuEgSEQWGjFxJT5FUzXoWjj+SJvRkIHtbMoUYWNFK04H+iZIeT1q+hamw83HyZWfMgZQZAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:44:44.024265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.11475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b64cb18fe67599ff9124a3316a6da1e6ae948fd597b0b37b1b95b3facbf770ac","sha256:e87d4db61a409be1c127f37c68c04601230105abcd674852b76ed6809b61c7ae"],"state_sha256":"c1261e1ee81de2ef7dd82c8c8d6c2614fcc8e19bc1f9eaad8fb53d2d3ab4ae65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMAdiZQdNQoe5PV/StK5AKSsP4f/X+NX4py5nhnH3h6nmffskQBgCpV5eXaXrXKZq/3lzekBt2WPrrQlmuXFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:10:21.193397Z","bundle_sha256":"7c3fcfff2104f238af30e53d68e127cfdb2cea9ad05c692b4075abbd0e257f75"}}