{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SPQGN3KZE6O3KALHCCEIVDCZG7","short_pith_number":"pith:SPQGN3KZ","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"},"canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","source":{"kind":"arxiv","id":"1409.0173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0173","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0173v2","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0173","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"SPQGN3KZE6O3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SPQGN3KZE6O3KALH","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SPQGN3KZ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SPQGN3KZE6O3KALHCCEIVDCZG7","target":"record","payload":{"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"},"canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","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"},"source_kind":"arxiv","source_id":"1409.0173","source_version":2,"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-18T02:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZMA3m4/2roZmKDjjpusEvwIbz3ml18O69DC7tr26nleskk95KOHPk+ydTnKSsWS6N/SW5fMuDKlew+86WmeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:56:22.721401Z"},"content_sha256":"56a4886d95590a1ec75749dd08624771440da99f33c61db17bd77b10dfef82c1","schema_version":"1.0","event_id":"sha256:56a4886d95590a1ec75749dd08624771440da99f33c61db17bd77b10dfef82c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SPQGN3KZE6O3KALHCCEIVDCZG7","target":"graph","payload":{"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"},"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-18T02:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Upv80Bqt4QhwWmVt8tGC39ROiNZ3sM0KwZeqOPxP8x9He/1q3lhyO+xZa6eGaisd7D8C5ZGK1cSc67guqbe5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:56:22.721760Z"},"content_sha256":"5da4ac4a9e9c89314eb423a76f64e3ecbc6f9322168e212caf063c2aebb0d215","schema_version":"1.0","event_id":"sha256:5da4ac4a9e9c89314eb423a76f64e3ecbc6f9322168e212caf063c2aebb0d215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/bundle.json","state_url":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/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-07-01T02:56:22Z","links":{"resolver":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7","bundle":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/bundle.json","state":"https://pith.science/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPQGN3KZE6O3KALHCCEIVDCZG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SPQGN3KZE6O3KALHCCEIVDCZG7","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":"7cb4032bf7f2f6faa41cc91512ea30a499d797b270d3bd10d4403d653f415eff","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-31T01:00:55Z","title_canon_sha256":"999dc30dfb6e00b7b37aa128738e028d5c134231add066f164e46e91802e4635"},"schema_version":"1.0","source":{"id":"1409.0173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0173","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0173v2","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0173","created_at":"2026-05-18T02:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"SPQGN3KZE6O3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SPQGN3KZE6O3KALH","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SPQGN3KZ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:5da4ac4a9e9c89314eb423a76f64e3ecbc6f9322168e212caf063c2aebb0d215","target":"graph","created_at":"2026-05-18T02:41:41Z","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":"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","authors_text":"Sayan Bandyapadhyay","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-31T01:00:55Z","title":"A Variant of the Maximum Weight Independent Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0173","kind":"arxiv","version":2},"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:56a4886d95590a1ec75749dd08624771440da99f33c61db17bd77b10dfef82c1","target":"record","created_at":"2026-05-18T02:41:41Z","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":"7cb4032bf7f2f6faa41cc91512ea30a499d797b270d3bd10d4403d653f415eff","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-31T01:00:55Z","title_canon_sha256":"999dc30dfb6e00b7b37aa128738e028d5c134231add066f164e46e91802e4635"},"schema_version":"1.0","source":{"id":"1409.0173","kind":"arxiv","version":2}},"canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93e066ed59279db5016710888a8c5937c8932b86715f5f068b5733de35ad8213","first_computed_at":"2026-05-18T02:41:41.019082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:41.019082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhgPjj1GVJkK8xNsdM0D7hogZVN6pEkz1fQQxN4xyVAOLUpol+RWkPT1Bkb6GRkLPRLBAl1cxYPbxHLTWL2RCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:41.019759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56a4886d95590a1ec75749dd08624771440da99f33c61db17bd77b10dfef82c1","sha256:5da4ac4a9e9c89314eb423a76f64e3ecbc6f9322168e212caf063c2aebb0d215"],"state_sha256":"26961048cc7a790f4597508ea2901ddde6241cd70ecdbb2d626ae81fb4d801a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJIOq3IcPpVt7ZyVvio4/H4oJNphe/MYAW1ZK6UIGwGPeXnxAR1EgQkLhWMsX3yAXj6Q8tBr/z2zUKw61Q6KBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:56:22.723744Z","bundle_sha256":"5a1a8279920fa2c5c7b578372c8c4e2a39d63611c517814b7c506e20e9c1925f"}}