{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SPQGN3KZE6O3KALHCCEIVDCZG7","short_pith_number":"pith:SPQGN3KZ","schema_version":"1.0","canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","source":{"kind":"arxiv","id":"1409.0173","version":2},"attestation_state":"computed","paper":{"title":"A Variant of the Maximum Weight Independent Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Sayan Bandyapadhyay","submitted_at":"2014-08-31T01:00:55Z","abstract_excerpt":"We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph $G=(V,E)$, a weight function $w: V \\rightarrow \\mathbb{R^+}$, a budget function $b: V \\rightarrow \\mathbb{Z^+}$, and a positive integer $B$. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A $k$-budgeted independent set in $G$ is a subset of vertices, such that no pair of vertices in that subset are adjacent, and the budget of the subset is at most $k$. Th"},"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":"1409.0173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-31T01:00:55Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"999dc30dfb6e00b7b37aa128738e028d5c134231add066f164e46e91802e4635","abstract_canon_sha256":"7cb4032bf7f2f6faa41cc91512ea30a499d797b270d3bd10d4403d653f415eff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:41.019759Z","signature_b64":"xhgPjj1GVJkK8xNsdM0D7hogZVN6pEkz1fQQxN4xyVAOLUpol+RWkPT1Bkb6GRkLPRLBAl1cxYPbxHLTWL2RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","last_reissued_at":"2026-05-18T02:41:41.019082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:41.019082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Variant of the Maximum Weight Independent Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Sayan Bandyapadhyay","submitted_at":"2014-08-31T01:00:55Z","abstract_excerpt":"We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph $G=(V,E)$, a weight function $w: V \\rightarrow \\mathbb{R^+}$, a budget function $b: V \\rightarrow \\mathbb{Z^+}$, and a positive integer $B$. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A $k$-budgeted independent set in $G$ is a subset of vertices, such that no pair of vertices in that subset are adjacent, and the budget of the subset is at most $k$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0173","kind":"arxiv","version":2},"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":"1409.0173","created_at":"2026-05-18T02:41:41.019189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0173v2","created_at":"2026-05-18T02:41:41.019189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0173","created_at":"2026-05-18T02:41:41.019189+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPQGN3KZE6O3","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPQGN3KZE6O3KALH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPQGN3KZ","created_at":"2026-05-18T12:28:49.207871+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/SPQGN3KZE6O3KALHCCEIVDCZG7","json":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7.json","graph_json":"https://pith.science/api/pith-number/SPQGN3KZE6O3KALHCCEIVDCZG7/graph.json","events_json":"https://pith.science/api/pith-number/SPQGN3KZE6O3KALHCCEIVDCZG7/events.json","paper":"https://pith.science/paper/SPQGN3KZ"},"agent_actions":{"view_html":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7","download_json":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7.json","view_paper":"https://pith.science/paper/SPQGN3KZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0173&json=true","fetch_graph":"https://pith.science/api/pith-number/SPQGN3KZE6O3KALHCCEIVDCZG7/graph.json","fetch_events":"https://pith.science/api/pith-number/SPQGN3KZE6O3KALHCCEIVDCZG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/action/storage_attestation","attest_author":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/action/author_attestation","sign_citation":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/action/citation_signature","submit_replication":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/action/replication_record"}},"created_at":"2026-05-18T02:41:41.019189+00:00","updated_at":"2026-05-18T02:41:41.019189+00:00"}