{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1998:BEFAOW3DOBET62LTBRVLG335FP","short_pith_number":"pith:BEFAOW3D","canonical_record":{"source":{"id":"cs/9809103","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-24T17:48:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"350ad84cd4991b07a88c84bcf3096a4b312cb087a0cbfdabbb77984ecf754ed3","abstract_canon_sha256":"6604e32cc1b04cf93f05f97d0f490ce3bac74aaa05e9c6f00f8478d6e42d2949"},"schema_version":"1.0"},"canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","source":{"kind":"arxiv","id":"cs/9809103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809103","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9809103v1","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809103","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"BEFAOW3DOBET","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_16","alias_value":"BEFAOW3DOBET62LT","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_8","alias_value":"BEFAOW3D","created_at":"2026-07-04T23:57:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1998:BEFAOW3DOBET62LTBRVLG335FP","target":"record","payload":{"canonical_record":{"source":{"id":"cs/9809103","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-24T17:48:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"350ad84cd4991b07a88c84bcf3096a4b312cb087a0cbfdabbb77984ecf754ed3","abstract_canon_sha256":"6604e32cc1b04cf93f05f97d0f490ce3bac74aaa05e9c6f00f8478d6e42d2949"},"schema_version":"1.0"},"canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:25.775166Z","signature_b64":"h60Va/WVfqv3+6xL9X2KZP3GOemC6QpReAiaqxeK/Kx8rBx5NJDREo6St/madNw2cF8fBlfkqzeQZo8dyA85Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","last_reissued_at":"2026-07-04T23:57:25.774566Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:25.774566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/9809103","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-04T23:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPVuvg1egWNcUw4MEwbQ6q+f/BvF6QsH7fmCfRQPV+k6xhaK96YtlkSIfKPj/XqxuICsNdmZ79t5GDLALwWQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:06:38.543450Z"},"content_sha256":"ce02675bc3ee159679285824b9b4df0ecab7f264545b5b8113bdcc1f50d2e6fd","schema_version":"1.0","event_id":"sha256:ce02675bc3ee159679285824b9b4df0ecab7f264545b5b8113bdcc1f50d2e6fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1998:BEFAOW3DOBET62LTBRVLG335FP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bicriteria Network Design Problems","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel J. Rosenkrantz, Harry B. Hunt III, Madhav V. Marathe, Ravi Sundaram, R. Ravi, S. S. Ravi","submitted_at":"1998-09-24T17:48:18Z","abstract_excerpt":"We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a <subgraph \\from a given subgraph-class that minimizes the second objective subject to the budget on the first. We consider three different criteria - the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809103","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/cs/9809103/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-04T23:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GO9hEzuDXLMvNENN2m1lEtLDUcfF5DZRSmtoHodvcGHseGRCk8bsoi8RWA1xR+Q5bGH/2QLjQE2MXWlx0j3IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:06:38.543953Z"},"content_sha256":"5c5589bdbf06ab590a65e48abf17f8cc65ba00a1e321fdd5232f41ba3198e07e","schema_version":"1.0","event_id":"sha256:5c5589bdbf06ab590a65e48abf17f8cc65ba00a1e321fdd5232f41ba3198e07e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/bundle.json","state_url":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEFAOW3DOBET62LTBRVLG335FP/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-07T00:06:38Z","links":{"resolver":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP","bundle":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/bundle.json","state":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEFAOW3DOBET62LTBRVLG335FP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1998:BEFAOW3DOBET62LTBRVLG335FP","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":"6604e32cc1b04cf93f05f97d0f490ce3bac74aaa05e9c6f00f8478d6e42d2949","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-24T17:48:18Z","title_canon_sha256":"350ad84cd4991b07a88c84bcf3096a4b312cb087a0cbfdabbb77984ecf754ed3"},"schema_version":"1.0","source":{"id":"cs/9809103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809103","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9809103v1","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809103","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"BEFAOW3DOBET","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_16","alias_value":"BEFAOW3DOBET62LT","created_at":"2026-07-04T23:57:25Z"},{"alias_kind":"pith_short_8","alias_value":"BEFAOW3D","created_at":"2026-07-04T23:57:25Z"}],"graph_snapshots":[{"event_id":"sha256:5c5589bdbf06ab590a65e48abf17f8cc65ba00a1e321fdd5232f41ba3198e07e","target":"graph","created_at":"2026-07-04T23:57:25Z","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/cs/9809103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a <subgraph \\from a given subgraph-class that minimizes the second objective subject to the budget on the first. We consider three different criteria - the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for t","authors_text":"Daniel J. Rosenkrantz, Harry B. Hunt III, Madhav V. Marathe, Ravi Sundaram, R. Ravi, S. S. Ravi","cross_cats":["cs.DS"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"1998-09-24T17:48:18Z","title":"Bicriteria Network Design Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809103","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:ce02675bc3ee159679285824b9b4df0ecab7f264545b5b8113bdcc1f50d2e6fd","target":"record","created_at":"2026-07-04T23:57:25Z","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":"6604e32cc1b04cf93f05f97d0f490ce3bac74aaa05e9c6f00f8478d6e42d2949","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-24T17:48:18Z","title_canon_sha256":"350ad84cd4991b07a88c84bcf3096a4b312cb087a0cbfdabbb77984ecf754ed3"},"schema_version":"1.0","source":{"id":"cs/9809103","kind":"arxiv","version":1}},"canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","first_computed_at":"2026-07-04T23:57:25.774566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:57:25.774566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h60Va/WVfqv3+6xL9X2KZP3GOemC6QpReAiaqxeK/Kx8rBx5NJDREo6St/madNw2cF8fBlfkqzeQZo8dyA85Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:57:25.775166Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9809103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce02675bc3ee159679285824b9b4df0ecab7f264545b5b8113bdcc1f50d2e6fd","sha256:5c5589bdbf06ab590a65e48abf17f8cc65ba00a1e321fdd5232f41ba3198e07e"],"state_sha256":"de638efcb81cda8f6e38ff4d95f1a8db8d90c2c8725fa956c3cce0b79d23350f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrOz0KMR6OLGuejX2sM3izVk441VMzRUJXzjMD3wHRMBF0uzLOUng4bA82qPAPgNO8DrTBet1Klz6BIIUQQjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:06:38.549108Z","bundle_sha256":"181521429df853963d86b91a63c6b90069d94ba0b9894c1a687509786034c9cf"}}