{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7VFWB37MY62WNSPBCANRGJR7DB","short_pith_number":"pith:7VFWB37M","schema_version":"1.0","canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","source":{"kind":"arxiv","id":"1311.5481","version":1},"attestation_state":"computed","paper":{"title":"Bi-Criteria and Approximation Algorithms for Restricted Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georgios Stamoulis, Monaldo Mastrolilli","submitted_at":"2013-11-21T17:07:08Z","abstract_excerpt":"In this work we study approximation algorithms for the \\textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \\in \\mathbb{Q}^+$, we want to compute a maximum (cardinality or profit) matching in which no more than $w_j \\in \\mathbb{Z}^+$ edges of color $c_j$ are present. This kind of problems, beside the theoretical interest on its own right, emerges in multi-fiber optical networking systems, where we interpret each unique wavelength that can travel through the fiber as a c"},"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":"1311.5481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T17:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"dcfab458890f17a475a8635c7919b84ed659f1766ac76a025ae8e0ba509f9857","abstract_canon_sha256":"de2eeff5cd71aa5b92684c94a5bbc75d6676347fc52b5fbe45cc048a01c8cc1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:33.260120Z","signature_b64":"/LZdMO5+ifsxrwcnZ5qrkoQR4iM6kCkrpAIZT4VSxfci3tILOljY5SPqDkWG6VaFg2Spo1mNy2zWy6+6FWASDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","last_reissued_at":"2026-05-18T03:06:33.259528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:33.259528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bi-Criteria and Approximation Algorithms for Restricted Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georgios Stamoulis, Monaldo Mastrolilli","submitted_at":"2013-11-21T17:07:08Z","abstract_excerpt":"In this work we study approximation algorithms for the \\textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \\in \\mathbb{Q}^+$, we want to compute a maximum (cardinality or profit) matching in which no more than $w_j \\in \\mathbb{Z}^+$ edges of color $c_j$ are present. This kind of problems, beside the theoretical interest on its own right, emerges in multi-fiber optical networking systems, where we interpret each unique wavelength that can travel through the fiber as a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5481","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":""},"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":"1311.5481","created_at":"2026-05-18T03:06:33.259611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5481v1","created_at":"2026-05-18T03:06:33.259611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5481","created_at":"2026-05-18T03:06:33.259611+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VFWB37MY62W","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VFWB37MY62WNSPB","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VFWB37M","created_at":"2026-05-18T12:27:38.830355+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/7VFWB37MY62WNSPBCANRGJR7DB","json":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB.json","graph_json":"https://pith.science/api/pith-number/7VFWB37MY62WNSPBCANRGJR7DB/graph.json","events_json":"https://pith.science/api/pith-number/7VFWB37MY62WNSPBCANRGJR7DB/events.json","paper":"https://pith.science/paper/7VFWB37M"},"agent_actions":{"view_html":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB","download_json":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB.json","view_paper":"https://pith.science/paper/7VFWB37M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5481&json=true","fetch_graph":"https://pith.science/api/pith-number/7VFWB37MY62WNSPBCANRGJR7DB/graph.json","fetch_events":"https://pith.science/api/pith-number/7VFWB37MY62WNSPBCANRGJR7DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/action/storage_attestation","attest_author":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/action/author_attestation","sign_citation":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/action/citation_signature","submit_replication":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/action/replication_record"}},"created_at":"2026-05-18T03:06:33.259611+00:00","updated_at":"2026-05-18T03:06:33.259611+00:00"}