{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JSPODYWCQGX2WAAWAOHZEN6FYB","short_pith_number":"pith:JSPODYWC","schema_version":"1.0","canonical_sha256":"4c9ee1e2c281afab0016038f9237c5c04865504b0d882ac722c4320b511284ae","source":{"kind":"arxiv","id":"1312.3892","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3892","created_at":"2026-05-18T03:04:47.234406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3892v1","created_at":"2026-05-18T03:04:47.234406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3892","created_at":"2026-05-18T03:04:47.234406+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSPODYWCQGX2","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSPODYWCQGX2WAAW","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSPODYWC","created_at":"2026-05-18T12:27:49.015174+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/JSPODYWCQGX2WAAWAOHZEN6FYB","json":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB.json","graph_json":"https://pith.science/api/pith-number/JSPODYWCQGX2WAAWAOHZEN6FYB/graph.json","events_json":"https://pith.science/api/pith-number/JSPODYWCQGX2WAAWAOHZEN6FYB/events.json","paper":"https://pith.science/paper/JSPODYWC"},"agent_actions":{"view_html":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB","download_json":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB.json","view_paper":"https://pith.science/paper/JSPODYWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3892&json=true","fetch_graph":"https://pith.science/api/pith-number/JSPODYWCQGX2WAAWAOHZEN6FYB/graph.json","fetch_events":"https://pith.science/api/pith-number/JSPODYWCQGX2WAAWAOHZEN6FYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/action/storage_attestation","attest_author":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/action/author_attestation","sign_citation":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/action/citation_signature","submit_replication":"https://pith.science/pith/JSPODYWCQGX2WAAWAOHZEN6FYB/action/replication_record"}},"created_at":"2026-05-18T03:04:47.234406+00:00","updated_at":"2026-05-18T03:04:47.234406+00:00"}