{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KPNAVDJQLSWUMLXIPSDOIPQVZY","short_pith_number":"pith:KPNAVDJQ","canonical_record":{"source":{"id":"2507.11214","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T11:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"6c9d83dadce5326feb712480d0ae12b233c287864b0714e5f71e346ad856f5e5","abstract_canon_sha256":"c6f5090ff0e6aa0bc69ae4d5705701c0e0df95a38b641fa79bdd01015ae5244f"},"schema_version":"1.0"},"canonical_sha256":"53da0a8d305cad462ee87c86e43e15ce34470bd9cb2cc32d83c439387aee8925","source":{"kind":"arxiv","id":"2507.11214","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11214","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11214v3","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11214","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"KPNAVDJQLSWU","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_16","alias_value":"KPNAVDJQLSWUMLXI","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_8","alias_value":"KPNAVDJQ","created_at":"2026-07-02T01:17:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KPNAVDJQLSWUMLXIPSDOIPQVZY","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11214","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T11:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"6c9d83dadce5326feb712480d0ae12b233c287864b0714e5f71e346ad856f5e5","abstract_canon_sha256":"c6f5090ff0e6aa0bc69ae4d5705701c0e0df95a38b641fa79bdd01015ae5244f"},"schema_version":"1.0"},"canonical_sha256":"53da0a8d305cad462ee87c86e43e15ce34470bd9cb2cc32d83c439387aee8925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:13.153566Z","signature_b64":"wUePNddyrNpdmIKyo/LvKyx2iBTMtC174Axl6s6kaxVefTYam6oXxUn8erQC7WOm5zVK/ZbVg2uIkYKmxgJCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53da0a8d305cad462ee87c86e43e15ce34470bd9cb2cc32d83c439387aee8925","last_reissued_at":"2026-07-02T01:17:13.153019Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:13.153019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11214","source_version":3,"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-07-02T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQI1GCENozuATnzkJrlC2iWz/Dr0W1zF8BiGeefn8k6aSg8m3J/G321Ta92dIWrMyWY4/B+bHfiRbLPq/+o3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:58:32.505094Z"},"content_sha256":"15bd5c9d968553239345ecbe62ac51dd6a01cd0dea6b0543e18ac5b581ed595f","schema_version":"1.0","event_id":"sha256:15bd5c9d968553239345ecbe62ac51dd6a01cd0dea6b0543e18ac5b581ed595f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KPNAVDJQLSWUMLXIPSDOIPQVZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Fair Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Junjie Chen, Matteo Castiglioni, Yingkai Li","submitted_at":"2025-07-15T11:31:28Z","abstract_excerpt":"We initiate the algorithmic study of fair contract design. A principal assigns multiple tasks to heterogeneous agents and chooses task-level linear contracts; agents differ in costs and success probabilities, and fairness requires each agent to prefer her own task-contract bundle to any other agent's. Unlike envy-free allocations of indivisible items, envy-free full-allocation contracts always exist, but optimizing revenue under this constraint is computationally difficult: no polynomial-time algorithm can achieve any constant-factor approximation in general. We therefore identify tractable re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11214","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11214/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fSEv63iMACtatfMklcrKfo7y8eDu6z/Lt6K2RKYDvEMh3db6yS9YuyJuSc/E9zSsYSNdbTVLuI8ao004vbqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:58:32.505651Z"},"content_sha256":"e65d43d4bbda0e2fd77552cd6fb5eff1853c681d2225f7214f696ca6ae790d86","schema_version":"1.0","event_id":"sha256:e65d43d4bbda0e2fd77552cd6fb5eff1853c681d2225f7214f696ca6ae790d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/bundle.json","state_url":"https://pith.science/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/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-08-18T10:58:32Z","links":{"resolver":"https://pith.science/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY","bundle":"https://pith.science/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/bundle.json","state":"https://pith.science/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPNAVDJQLSWUMLXIPSDOIPQVZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KPNAVDJQLSWUMLXIPSDOIPQVZY","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":"c6f5090ff0e6aa0bc69ae4d5705701c0e0df95a38b641fa79bdd01015ae5244f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T11:31:28Z","title_canon_sha256":"6c9d83dadce5326feb712480d0ae12b233c287864b0714e5f71e346ad856f5e5"},"schema_version":"1.0","source":{"id":"2507.11214","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11214","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11214v3","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11214","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"KPNAVDJQLSWU","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_16","alias_value":"KPNAVDJQLSWUMLXI","created_at":"2026-07-02T01:17:13Z"},{"alias_kind":"pith_short_8","alias_value":"KPNAVDJQ","created_at":"2026-07-02T01:17:13Z"}],"graph_snapshots":[{"event_id":"sha256:e65d43d4bbda0e2fd77552cd6fb5eff1853c681d2225f7214f696ca6ae790d86","target":"graph","created_at":"2026-07-02T01:17:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11214/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We initiate the algorithmic study of fair contract design. A principal assigns multiple tasks to heterogeneous agents and chooses task-level linear contracts; agents differ in costs and success probabilities, and fairness requires each agent to prefer her own task-contract bundle to any other agent's. Unlike envy-free allocations of indivisible items, envy-free full-allocation contracts always exist, but optimizing revenue under this constraint is computationally difficult: no polynomial-time algorithm can achieve any constant-factor approximation in general. We therefore identify tractable re","authors_text":"Junjie Chen, Matteo Castiglioni, Yingkai Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T11:31:28Z","title":"Algorithmic Fair Contracts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11214","kind":"arxiv","version":3},"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:15bd5c9d968553239345ecbe62ac51dd6a01cd0dea6b0543e18ac5b581ed595f","target":"record","created_at":"2026-07-02T01:17:13Z","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":"c6f5090ff0e6aa0bc69ae4d5705701c0e0df95a38b641fa79bdd01015ae5244f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T11:31:28Z","title_canon_sha256":"6c9d83dadce5326feb712480d0ae12b233c287864b0714e5f71e346ad856f5e5"},"schema_version":"1.0","source":{"id":"2507.11214","kind":"arxiv","version":3}},"canonical_sha256":"53da0a8d305cad462ee87c86e43e15ce34470bd9cb2cc32d83c439387aee8925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53da0a8d305cad462ee87c86e43e15ce34470bd9cb2cc32d83c439387aee8925","first_computed_at":"2026-07-02T01:17:13.153019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:13.153019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUePNddyrNpdmIKyo/LvKyx2iBTMtC174Axl6s6kaxVefTYam6oXxUn8erQC7WOm5zVK/ZbVg2uIkYKmxgJCDw==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:13.153566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11214","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15bd5c9d968553239345ecbe62ac51dd6a01cd0dea6b0543e18ac5b581ed595f","sha256:e65d43d4bbda0e2fd77552cd6fb5eff1853c681d2225f7214f696ca6ae790d86"],"state_sha256":"f33245a1c406bf5ba10c6c0e4a0bd4108c823a3004238d98af81c44937e4ea1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Wm9jIvp5fovYUDJEiylVccsRUg2FvMbQhKqLjD4uyG78rvjgyKr+4jvPi5MBBndJj+4h6xDrMsnyiSr6JpUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T10:58:32.516034Z","bundle_sha256":"023fbbc4bcfc9c9174730ef8e3013a973b52fd4f302c2d2043f3b42c70fe204b"}}