{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B43DBHHQU4EEDBCLYPFNNDNIAZ","short_pith_number":"pith:B43DBHHQ","canonical_record":{"source":{"id":"1203.1940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-08T21:42:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f608edcf2c8426f53d295ab116bfbbba237365207927a5516415ef4956e1c30f","abstract_canon_sha256":"5183a02671788920568ae23b050b66b7b412d7efa2012bde044a62bc3a2d24cf"},"schema_version":"1.0"},"canonical_sha256":"0f36309cf0a70841844bc3cad68da806564dca7c3761a99c6ac15a4934e7abf7","source":{"kind":"arxiv","id":"1203.1940","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1940","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1940v2","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1940","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"B43DBHHQU4EE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B43DBHHQU4EEDBCL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B43DBHHQ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B43DBHHQU4EEDBCLYPFNNDNIAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-08T21:42:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f608edcf2c8426f53d295ab116bfbbba237365207927a5516415ef4956e1c30f","abstract_canon_sha256":"5183a02671788920568ae23b050b66b7b412d7efa2012bde044a62bc3a2d24cf"},"schema_version":"1.0"},"canonical_sha256":"0f36309cf0a70841844bc3cad68da806564dca7c3761a99c6ac15a4934e7abf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:32.159513Z","signature_b64":"wxPVMtfnU6pbs7by18Va7x+Obg2gaY3EMjjmrsGAyZ99s8mE+Xo0R4JKtr3K69P8qcHgCJnvqdbCRH1kE2oECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f36309cf0a70841844bc3cad68da806564dca7c3761a99c6ac15a4934e7abf7","last_reissued_at":"2026-05-18T03:07:32.158907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:32.158907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1940","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-18T03:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iK2YjAwWW72bdbQMTLupk8IwA9h43FMtL0i9VO2ivLvu3qZtufDieYd5f+IuAl3S0EsbdvixzNq4yWMPzVVeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:43:21.251777Z"},"content_sha256":"964d0a6e5ac74d36e36d96587cbd4aae2832a87965a15229923b88ee2d2126ca","schema_version":"1.0","event_id":"sha256:964d0a6e5ac74d36e36d96587cbd4aae2832a87965a15229923b88ee2d2126ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B43DBHHQU4EEDBCLYPFNNDNIAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Danupon Nanongkai, Parinya Chalermsook, Richard Lipton, Shiva Kintali","submitted_at":"2012-03-08T21:42:51Z","abstract_excerpt":"Consider the following problem. A seller has infinite copies of $n$ products represented by nodes in a graph. There are $m$ consumers, each has a budget and wants to buy two products. Consumers are represented by weighted edges. Given the prices of products, each consumer will buy both products she wants, at the given price, if she can afford to. Our objective is to help the seller price the products to maximize her profit.\n  This problem is called {\\em graph vertex pricing} ({\\sf GVP}) problem and has resisted several recent attempts despite its current simple solution. This motivates the stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1940","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-18T03:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azk0bfEtKdGiJnJAeQJHhqv0xAUVT8Oku0JZtTiscXQpL5dW70eWFdwTYIMHC+nXor5yHDuA44Y6SpdFm5zfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:43:21.252234Z"},"content_sha256":"eed306fb8aa6001ce409639cd6edc131b79039e0bbcbb793d7f6fdb5bdedd08d","schema_version":"1.0","event_id":"sha256:eed306fb8aa6001ce409639cd6edc131b79039e0bbcbb793d7f6fdb5bdedd08d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/bundle.json","state_url":"https://pith.science/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/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-25T12:43:21Z","links":{"resolver":"https://pith.science/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ","bundle":"https://pith.science/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/bundle.json","state":"https://pith.science/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B43DBHHQU4EEDBCLYPFNNDNIAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B43DBHHQU4EEDBCLYPFNNDNIAZ","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":"5183a02671788920568ae23b050b66b7b412d7efa2012bde044a62bc3a2d24cf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-08T21:42:51Z","title_canon_sha256":"f608edcf2c8426f53d295ab116bfbbba237365207927a5516415ef4956e1c30f"},"schema_version":"1.0","source":{"id":"1203.1940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1940","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1940v2","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1940","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"B43DBHHQU4EE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B43DBHHQU4EEDBCL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B43DBHHQ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:eed306fb8aa6001ce409639cd6edc131b79039e0bbcbb793d7f6fdb5bdedd08d","target":"graph","created_at":"2026-05-18T03:07:32Z","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":"Consider the following problem. A seller has infinite copies of $n$ products represented by nodes in a graph. There are $m$ consumers, each has a budget and wants to buy two products. Consumers are represented by weighted edges. Given the prices of products, each consumer will buy both products she wants, at the given price, if she can afford to. Our objective is to help the seller price the products to maximize her profit.\n  This problem is called {\\em graph vertex pricing} ({\\sf GVP}) problem and has resisted several recent attempts despite its current simple solution. This motivates the stu","authors_text":"Danupon Nanongkai, Parinya Chalermsook, Richard Lipton, Shiva Kintali","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-08T21:42:51Z","title":"Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1940","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:964d0a6e5ac74d36e36d96587cbd4aae2832a87965a15229923b88ee2d2126ca","target":"record","created_at":"2026-05-18T03:07:32Z","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":"5183a02671788920568ae23b050b66b7b412d7efa2012bde044a62bc3a2d24cf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-08T21:42:51Z","title_canon_sha256":"f608edcf2c8426f53d295ab116bfbbba237365207927a5516415ef4956e1c30f"},"schema_version":"1.0","source":{"id":"1203.1940","kind":"arxiv","version":2}},"canonical_sha256":"0f36309cf0a70841844bc3cad68da806564dca7c3761a99c6ac15a4934e7abf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f36309cf0a70841844bc3cad68da806564dca7c3761a99c6ac15a4934e7abf7","first_computed_at":"2026-05-18T03:07:32.158907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:32.158907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxPVMtfnU6pbs7by18Va7x+Obg2gaY3EMjjmrsGAyZ99s8mE+Xo0R4JKtr3K69P8qcHgCJnvqdbCRH1kE2oECA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:32.159513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:964d0a6e5ac74d36e36d96587cbd4aae2832a87965a15229923b88ee2d2126ca","sha256:eed306fb8aa6001ce409639cd6edc131b79039e0bbcbb793d7f6fdb5bdedd08d"],"state_sha256":"1fc07cb61a04cf83152e298192300963adb256abb18f5804b819c907891e3b30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8xwMxnPwlHW0sPRFsJKVm3LFYDopSfnFvP7AcYdsxH9NwHqaBnyMxaoa0stoP4H8josUY8sM0/NqiPiyTbHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:43:21.255773Z","bundle_sha256":"ad16de7ca682f1fd98121d1f31e311e97c7db30a458e4367dbbaad7a039209d6"}}