{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EP7KQODVT7FHT6EAYQPS7DJUEN","short_pith_number":"pith:EP7KQODV","canonical_record":{"source":{"id":"1610.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-04T09:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"3716aa2d1988e2fca45319166305476b166c3d0a190e51117a9ce56fa43a0741","abstract_canon_sha256":"45f282178a64c1b529191c7d3219815baeb9aed0926f587086d6f3a8b434d636"},"schema_version":"1.0"},"canonical_sha256":"23fea838759fca79f880c41f2f8d34236d470bf7926cfb2fc9de3537ae419a1f","source":{"kind":"arxiv","id":"1610.00901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00901","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00901v1","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00901","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"EP7KQODVT7FH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EP7KQODVT7FHT6EA","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EP7KQODV","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EP7KQODVT7FHT6EAYQPS7DJUEN","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-04T09:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"3716aa2d1988e2fca45319166305476b166c3d0a190e51117a9ce56fa43a0741","abstract_canon_sha256":"45f282178a64c1b529191c7d3219815baeb9aed0926f587086d6f3a8b434d636"},"schema_version":"1.0"},"canonical_sha256":"23fea838759fca79f880c41f2f8d34236d470bf7926cfb2fc9de3537ae419a1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:12.965033Z","signature_b64":"d1nVFTh7f/XwAjsdzgWRVNRdR/i/dfEWLQpdPod6FYToy9aT1VU0ddL31LB/puDPxlcXknAWcx2lZm874CtYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23fea838759fca79f880c41f2f8d34236d470bf7926cfb2fc9de3537ae419a1f","last_reissued_at":"2026-05-18T01:03:12.964311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:12.964311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00901","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-18T01:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awI0oI24BvwwUhHa4mvy3ukP5yJOD5gQ1hA6tEiKnS54nq1k7x1xp8/40TFBapTrLsabniMO+Nhg2YojZGx7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:14:57.689340Z"},"content_sha256":"527bfa720bfb63d3486f3453ce199a0bcd42f54af7116cc595dabcd3b3341e76","schema_version":"1.0","event_id":"sha256:527bfa720bfb63d3486f3453ce199a0bcd42f54af7116cc595dabcd3b3341e76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EP7KQODVT7FHT6EAYQPS7DJUEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","submitted_at":"2016-10-04T09:08:49Z","abstract_excerpt":"We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same time maximize a given valuation function. This framework captures the budgeted version of several well known optimization problems, and when the resources are owned by strategic agents the goal is to design truthful and budget feasible mechanisms, i.e. elicit the true cost of the resources and ensure the payments of the mechanism do not exceed the budget. Budge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00901","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-18T01:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dKg9ZU/bJ8xdJdY5ykxt+AYnw/H04E+tIn+XbR1BXTb8go78OvdvZtEVOd05JHHnWy62BiVxhWneURxom94Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:14:57.690016Z"},"content_sha256":"832f2538c2cc200342af83d8bfb9acb9589c67984d73016bd7b14232edfa37dd","schema_version":"1.0","event_id":"sha256:832f2538c2cc200342af83d8bfb9acb9589c67984d73016bd7b14232edfa37dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/bundle.json","state_url":"https://pith.science/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/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-22T18:14:57Z","links":{"resolver":"https://pith.science/pith/EP7KQODVT7FHT6EAYQPS7DJUEN","bundle":"https://pith.science/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/bundle.json","state":"https://pith.science/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EP7KQODVT7FHT6EAYQPS7DJUEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EP7KQODVT7FHT6EAYQPS7DJUEN","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":"45f282178a64c1b529191c7d3219815baeb9aed0926f587086d6f3a8b434d636","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-04T09:08:49Z","title_canon_sha256":"3716aa2d1988e2fca45319166305476b166c3d0a190e51117a9ce56fa43a0741"},"schema_version":"1.0","source":{"id":"1610.00901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00901","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00901v1","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00901","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"EP7KQODVT7FH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EP7KQODVT7FHT6EA","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EP7KQODV","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:832f2538c2cc200342af83d8bfb9acb9589c67984d73016bd7b14232edfa37dd","target":"graph","created_at":"2026-05-18T01:03:12Z","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 type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same time maximize a given valuation function. This framework captures the budgeted version of several well known optimization problems, and when the resources are owned by strategic agents the goal is to design truthful and budget feasible mechanisms, i.e. elicit the true cost of the resources and ensure the payments of the mechanism do not exceed the budget. Budge","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-04T09:08:49Z","title":"Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00901","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:527bfa720bfb63d3486f3453ce199a0bcd42f54af7116cc595dabcd3b3341e76","target":"record","created_at":"2026-05-18T01:03:12Z","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":"45f282178a64c1b529191c7d3219815baeb9aed0926f587086d6f3a8b434d636","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-04T09:08:49Z","title_canon_sha256":"3716aa2d1988e2fca45319166305476b166c3d0a190e51117a9ce56fa43a0741"},"schema_version":"1.0","source":{"id":"1610.00901","kind":"arxiv","version":1}},"canonical_sha256":"23fea838759fca79f880c41f2f8d34236d470bf7926cfb2fc9de3537ae419a1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23fea838759fca79f880c41f2f8d34236d470bf7926cfb2fc9de3537ae419a1f","first_computed_at":"2026-05-18T01:03:12.964311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:12.964311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1nVFTh7f/XwAjsdzgWRVNRdR/i/dfEWLQpdPod6FYToy9aT1VU0ddL31LB/puDPxlcXknAWcx2lZm874CtYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:12.965033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:527bfa720bfb63d3486f3453ce199a0bcd42f54af7116cc595dabcd3b3341e76","sha256:832f2538c2cc200342af83d8bfb9acb9589c67984d73016bd7b14232edfa37dd"],"state_sha256":"88271536f7d2a2a37aa8ed80d6ed2df6a10da0785b8ba5aba0d56dd9cf749642"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trGVhFrQpdqAEtLxglfbzNyy9UW8ZJrSgqu8CQexW9g+s3HK7a0Vxt0IRT8C0sbjmdlxdIVGwDYcMiBwQ7U7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:14:57.694503Z","bundle_sha256":"3e574cc4057a6f8e719b8088589644000d7683c341e14c06f5e373c284dc7b8e"}}