{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:BEFAOW3DOBET62LTBRVLG335FP","short_pith_number":"pith:BEFAOW3D","schema_version":"1.0","canonical_sha256":"090a075b6370493f69730c6ab36f7d2bde601d04e475014cb19a77ea7942d18e","source":{"kind":"arxiv","id":"cs/9809103","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809103","created_at":"2026-07-04T23:57:25.774622+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9809103v1","created_at":"2026-07-04T23:57:25.774622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809103","created_at":"2026-07-04T23:57:25.774622+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEFAOW3DOBET","created_at":"2026-07-04T23:57:25.774622+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEFAOW3DOBET62LT","created_at":"2026-07-04T23:57:25.774622+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEFAOW3D","created_at":"2026-07-04T23:57:25.774622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP","json":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP.json","graph_json":"https://pith.science/api/pith-number/BEFAOW3DOBET62LTBRVLG335FP/graph.json","events_json":"https://pith.science/api/pith-number/BEFAOW3DOBET62LTBRVLG335FP/events.json","paper":"https://pith.science/paper/BEFAOW3D"},"agent_actions":{"view_html":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP","download_json":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP.json","view_paper":"https://pith.science/paper/BEFAOW3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9809103&json=true","fetch_graph":"https://pith.science/api/pith-number/BEFAOW3DOBET62LTBRVLG335FP/graph.json","fetch_events":"https://pith.science/api/pith-number/BEFAOW3DOBET62LTBRVLG335FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/action/storage_attestation","attest_author":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/action/author_attestation","sign_citation":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/action/citation_signature","submit_replication":"https://pith.science/pith/BEFAOW3DOBET62LTBRVLG335FP/action/replication_record"}},"created_at":"2026-07-04T23:57:25.774622+00:00","updated_at":"2026-07-04T23:57:25.774622+00:00"}