{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7VFWB37MY62WNSPBCANRGJR7DB","short_pith_number":"pith:7VFWB37M","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"},"canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","source":{"kind":"arxiv","id":"1311.5481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5481","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5481v1","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5481","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"7VFWB37MY62W","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VFWB37MY62WNSPB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VFWB37M","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7VFWB37MY62WNSPBCANRGJR7DB","target":"record","payload":{"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"},"canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","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"},"source_kind":"arxiv","source_id":"1311.5481","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-05-18T03:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hcjw9+L4/rsPZ8geJCLvNSPEgO9iylIm0tR9Uml25vvIz0STDUHLYS5kFUdrODblu37myQ7pS7jC1SzqTF1dCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:59.931202Z"},"content_sha256":"8ea88b400972d9c68d3d6d93473cf83d5e97b0132c693ac6f27442c66d4e221a","schema_version":"1.0","event_id":"sha256:8ea88b400972d9c68d3d6d93473cf83d5e97b0132c693ac6f27442c66d4e221a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7VFWB37MY62WNSPBCANRGJR7DB","target":"graph","payload":{"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"},"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-05-18T03:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zb5437LKjnm+SvvmXw4Ftio8wFW2d0Qg2lIua+zCF2uyUh1dinWa6Lhru0e/nFMUVp3rAgmE8iu8HTa65/YBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:59.931907Z"},"content_sha256":"8c6cb26a25ad02d985960d7e90d07a7b4804b8362aabe6d20015b41c103617e7","schema_version":"1.0","event_id":"sha256:8c6cb26a25ad02d985960d7e90d07a7b4804b8362aabe6d20015b41c103617e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/bundle.json","state_url":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VFWB37MY62WNSPBCANRGJR7DB/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-05-27T22:11:59Z","links":{"resolver":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB","bundle":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/bundle.json","state":"https://pith.science/pith/7VFWB37MY62WNSPBCANRGJR7DB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VFWB37MY62WNSPBCANRGJR7DB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7VFWB37MY62WNSPBCANRGJR7DB","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":"de2eeff5cd71aa5b92684c94a5bbc75d6676347fc52b5fbe45cc048a01c8cc1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T17:07:08Z","title_canon_sha256":"dcfab458890f17a475a8635c7919b84ed659f1766ac76a025ae8e0ba509f9857"},"schema_version":"1.0","source":{"id":"1311.5481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5481","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5481v1","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5481","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"7VFWB37MY62W","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VFWB37MY62WNSPB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VFWB37M","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8c6cb26a25ad02d985960d7e90d07a7b4804b8362aabe6d20015b41c103617e7","target":"graph","created_at":"2026-05-18T03:06:33Z","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"},"paper":{"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","authors_text":"Georgios Stamoulis, Monaldo Mastrolilli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T17:07:08Z","title":"Bi-Criteria and Approximation Algorithms for Restricted Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5481","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:8ea88b400972d9c68d3d6d93473cf83d5e97b0132c693ac6f27442c66d4e221a","target":"record","created_at":"2026-05-18T03:06:33Z","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":"de2eeff5cd71aa5b92684c94a5bbc75d6676347fc52b5fbe45cc048a01c8cc1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T17:07:08Z","title_canon_sha256":"dcfab458890f17a475a8635c7919b84ed659f1766ac76a025ae8e0ba509f9857"},"schema_version":"1.0","source":{"id":"1311.5481","kind":"arxiv","version":1}},"canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd4b60efecc7b566c9e1101b13263f18613c20dea35d41a8c78502f8f542b2f6","first_computed_at":"2026-05-18T03:06:33.259528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:33.259528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/LZdMO5+ifsxrwcnZ5qrkoQR4iM6kCkrpAIZT4VSxfci3tILOljY5SPqDkWG6VaFg2Spo1mNy2zWy6+6FWASDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:33.260120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea88b400972d9c68d3d6d93473cf83d5e97b0132c693ac6f27442c66d4e221a","sha256:8c6cb26a25ad02d985960d7e90d07a7b4804b8362aabe6d20015b41c103617e7"],"state_sha256":"cd3a7c680e6c3dc1fda92200ec7bcdce59e6d0302089ccb4e0f7ef467abb9679"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oj8KtRLJka0zgITfweo9SSEc9ag337/Z5MeNoMPvSGcLb8XQSA8dV+5WUJ3y7Pn8IGKCgNtgcdbM/N9/F21oDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:11:59.935648Z","bundle_sha256":"be1860f45e4f39cf8beaabbc6082047941f328ef188ec32cb5d0e608212dd7c2"}}