{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JSPODYWCQGX2WAAWAOHZEN6FYB","short_pith_number":"pith:JSPODYWC","canonical_record":{"source":{"id":"1312.3892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-13T18:03:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a2a784284c11347a5f15585a8359a6241fd675abdfbbc8d614af18b46a22bad6","abstract_canon_sha256":"94c0d709e29e0e27d0d6d26a56900221089c44d88476e846ce5efeeb83777556"},"schema_version":"1.0"},"canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","source":{"kind":"arxiv","id":"1312.3892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3892","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3892v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3892","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"JSPODYWCQGX2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JSPODYWCQGX2WAAW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JSPODYWC","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JSPODYWCQGX2WAAWAOHZEN6FYB","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-13T18:03:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a2a784284c11347a5f15585a8359a6241fd675abdfbbc8d614af18b46a22bad6","abstract_canon_sha256":"94c0d709e29e0e27d0d6d26a56900221089c44d88476e846ce5efeeb83777556"},"schema_version":"1.0"},"canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:47.235066Z","signature_b64":"r3uMqM3nq69ehOByH8qcggvPLK4lyDLCXrrIx/VOqIW8OUdy04845aBTyqxTRUNyrBMEnAGlhXLA+dtXBcHTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","last_reissued_at":"2026-05-18T03:04:47.234263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:47.234263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3892","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:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzcBbyR1/idK7G203kFADfC7tMwJ3NDVPgh2KH129XBwON9lv76Gb+Ku5/V1sNuYyrp/FKfUdIO7o88r4xoVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:55:19.086074Z"},"content_sha256":"3b48c6bcd57fecb5a4b229d466051d9544622621d33896b90d0d2ef0db9b9037","schema_version":"1.0","event_id":"sha256:3b48c6bcd57fecb5a4b229d466051d9544622621d33896b90d0d2ef0db9b9037"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JSPODYWCQGX2WAAWAOHZEN6FYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Revenue Maximization Problem with Sharp Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Gianpiero Monaco, Michele Flammini, Vittorio Bil\\`o","submitted_at":"2013-12-13T18:03:38Z","abstract_excerpt":"We consider the revenue maximization problem with sharp multi-demand, in which $m$ indivisible items have to be sold to $n$ potential buyers. Each buyer $i$ is interested in getting exactly $d_i$ items, and each item $j$ gives a benefit $v_{ij}$ to buyer $i$. We distinguish between unrelated and related valuations. In the former case, the benefit $v_{ij}$ is completely arbitrary, while, in the latter, each item $j$ has a quality $q_j$, each buyer $i$ has a value $v_i$ and the benefit $v_{ij}$ is defined as the product $v_i q_j$. The problem asks to determine a price for each item and an alloca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3892","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:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWYZV1nMgadutm68eAPFyzJwUUeUY0UwCxqJ7aAGvApNyPdTtJ2i1hyWXeV98Ewum5hC1Y0kPCm6NHuyame5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:55:19.086675Z"},"content_sha256":"482c7b5cf66cee6eb10d3721eb6f45c1b831a500941ea3d3c951658b1a8dc3b6","schema_version":"1.0","event_id":"sha256:482c7b5cf66cee6eb10d3721eb6f45c1b831a500941ea3d3c951658b1a8dc3b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/bundle.json","state_url":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/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-27T11:55:19Z","links":{"resolver":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB","bundle":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/bundle.json","state":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JSPODYWCQGX2WAAWAOHZEN6FYB","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":"94c0d709e29e0e27d0d6d26a56900221089c44d88476e846ce5efeeb83777556","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-13T18:03:38Z","title_canon_sha256":"a2a784284c11347a5f15585a8359a6241fd675abdfbbc8d614af18b46a22bad6"},"schema_version":"1.0","source":{"id":"1312.3892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3892","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3892v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3892","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"JSPODYWCQGX2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JSPODYWCQGX2WAAW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JSPODYWC","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:482c7b5cf66cee6eb10d3721eb6f45c1b831a500941ea3d3c951658b1a8dc3b6","target":"graph","created_at":"2026-05-18T03:04:47Z","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 consider the revenue maximization problem with sharp multi-demand, in which $m$ indivisible items have to be sold to $n$ potential buyers. Each buyer $i$ is interested in getting exactly $d_i$ items, and each item $j$ gives a benefit $v_{ij}$ to buyer $i$. We distinguish between unrelated and related valuations. In the former case, the benefit $v_{ij}$ is completely arbitrary, while, in the latter, each item $j$ has a quality $q_j$, each buyer $i$ has a value $v_i$ and the benefit $v_{ij}$ is defined as the product $v_i q_j$. The problem asks to determine a price for each item and an alloca","authors_text":"Gianpiero Monaco, Michele Flammini, Vittorio Bil\\`o","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-13T18:03:38Z","title":"Approximating the Revenue Maximization Problem with Sharp Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3892","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:3b48c6bcd57fecb5a4b229d466051d9544622621d33896b90d0d2ef0db9b9037","target":"record","created_at":"2026-05-18T03:04:47Z","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":"94c0d709e29e0e27d0d6d26a56900221089c44d88476e846ce5efeeb83777556","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-13T18:03:38Z","title_canon_sha256":"a2a784284c11347a5f15585a8359a6241fd675abdfbbc8d614af18b46a22bad6"},"schema_version":"1.0","source":{"id":"1312.3892","kind":"arxiv","version":1}},"canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","first_computed_at":"2026-05-18T03:04:47.234263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:47.234263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r3uMqM3nq69ehOByH8qcggvPLK4lyDLCXrrIx/VOqIW8OUdy04845aBTyqxTRUNyrBMEnAGlhXLA+dtXBcHTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:47.235066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b48c6bcd57fecb5a4b229d466051d9544622621d33896b90d0d2ef0db9b9037","sha256:482c7b5cf66cee6eb10d3721eb6f45c1b831a500941ea3d3c951658b1a8dc3b6"],"state_sha256":"87dc16f7e0039300b0cebf4fb7393ff6436958c71a35051090efbb94287d5a58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfUUgVX1SrOBa3cM/Og+9LJ4lwmVaLYKPThICw/0RLH9bXntM9Y9CyGdnx0t2DSTH73pBEKHZiMeyD1UID4dBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:55:19.089727Z","bundle_sha256":"8d3fd55c597e440997963afa670ed4800bd05d061b17109f11d23b2d3d841e77"}}