{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K7FZKECKPV7TYWFGNHKN6ECOLV","short_pith_number":"pith:K7FZKECK","canonical_record":{"source":{"id":"2410.14272","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T08:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"312ac2c4bc1906f0d0a7256035a21ccb3a93774dd262cf3235f12185d0eb3e8c","abstract_canon_sha256":"950ad07030075537633b8df86c033f0356a3b87fa58b634a027b3677b80cd290"},"schema_version":"1.0"},"canonical_sha256":"57cb95104a7d7f3c58a669d4df104e5d7e96eeabf6e924b8b7b0e7d90ef6b380","source":{"kind":"arxiv","id":"2410.14272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.14272","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2410.14272v1","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14272","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"K7FZKECKPV7T","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"K7FZKECKPV7TYWFG","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"K7FZKECK","created_at":"2026-07-05T09:22:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K7FZKECKPV7TYWFGNHKN6ECOLV","target":"record","payload":{"canonical_record":{"source":{"id":"2410.14272","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T08:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"312ac2c4bc1906f0d0a7256035a21ccb3a93774dd262cf3235f12185d0eb3e8c","abstract_canon_sha256":"950ad07030075537633b8df86c033f0356a3b87fa58b634a027b3677b80cd290"},"schema_version":"1.0"},"canonical_sha256":"57cb95104a7d7f3c58a669d4df104e5d7e96eeabf6e924b8b7b0e7d90ef6b380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:30.002929Z","signature_b64":"cU0bUrhj2jb5lhJ1L/XnIigb6QkF1Jst874A3Rq0EoJJVIV1MXkM8jMh8DcT14trRQjtqzeVLHJKrEhjbAsNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cb95104a7d7f3c58a669d4df104e5d7e96eeabf6e924b8b7b0e7d90ef6b380","last_reissued_at":"2026-07-05T09:22:30.002487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:30.002487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.14272","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-07-05T09:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rH7Cxx2lZ8vSXhF0JUiI/q0btO+APRhiTcmptIzSch+avoOAGIe9/UXstdPaeH511bndjcyGdxRD3gzSPgf2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:27:19.970249Z"},"content_sha256":"7a27aec51506132e82cab20cae3a517f41e98a7eef2dedf4afe3bd043594f985","schema_version":"1.0","event_id":"sha256:7a27aec51506132e82cab20cae3a517f41e98a7eef2dedf4afe3bd043594f985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K7FZKECKPV7TYWFGNHKN6ECOLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Envy-Free and Efficient Allocations for Graphical Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aditi Sethia, Neeldhara Misra","submitted_at":"2024-10-18T08:26:07Z","abstract_excerpt":"We consider the complexity of finding envy-free allocations for the class of graphical valuations. Graphical valuations were introduced by Christodoulou et. al.(2023) as a structured class of valuations that admit allocations that are envy-free up to any item (EFX). These are valuations where every item is valued by two agents, lending a (simple) graph structure to the utilities, where the agents are vertices and are adjacent if and only if they value a (unique) common item. Finding envy-free allocations for general valuations is known to be computationally intractable even for very special ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14272","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.14272/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-05T09:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnMYKmfXTXID06eGiPTr2Rv2PalCs98C4ugf6Ttmjv7igLBCBUR+Hmn0KNckYCJCY5zOPw0psYaW381GY0TkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:27:19.970745Z"},"content_sha256":"3fb695a7f2a55f9c43e5af6b6d7451931415273f4d9016a524d0342aca5e770f","schema_version":"1.0","event_id":"sha256:3fb695a7f2a55f9c43e5af6b6d7451931415273f4d9016a524d0342aca5e770f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/bundle.json","state_url":"https://pith.science/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/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-08T21:27:19Z","links":{"resolver":"https://pith.science/pith/K7FZKECKPV7TYWFGNHKN6ECOLV","bundle":"https://pith.science/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/bundle.json","state":"https://pith.science/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7FZKECKPV7TYWFGNHKN6ECOLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K7FZKECKPV7TYWFGNHKN6ECOLV","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":"950ad07030075537633b8df86c033f0356a3b87fa58b634a027b3677b80cd290","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T08:26:07Z","title_canon_sha256":"312ac2c4bc1906f0d0a7256035a21ccb3a93774dd262cf3235f12185d0eb3e8c"},"schema_version":"1.0","source":{"id":"2410.14272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.14272","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2410.14272v1","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14272","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"K7FZKECKPV7T","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"K7FZKECKPV7TYWFG","created_at":"2026-07-05T09:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"K7FZKECK","created_at":"2026-07-05T09:22:30Z"}],"graph_snapshots":[{"event_id":"sha256:3fb695a7f2a55f9c43e5af6b6d7451931415273f4d9016a524d0342aca5e770f","target":"graph","created_at":"2026-07-05T09:22:30Z","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/2410.14272/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the complexity of finding envy-free allocations for the class of graphical valuations. Graphical valuations were introduced by Christodoulou et. al.(2023) as a structured class of valuations that admit allocations that are envy-free up to any item (EFX). These are valuations where every item is valued by two agents, lending a (simple) graph structure to the utilities, where the agents are vertices and are adjacent if and only if they value a (unique) common item. Finding envy-free allocations for general valuations is known to be computationally intractable even for very special ca","authors_text":"Aditi Sethia, Neeldhara Misra","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T08:26:07Z","title":"Envy-Free and Efficient Allocations for Graphical Valuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14272","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:7a27aec51506132e82cab20cae3a517f41e98a7eef2dedf4afe3bd043594f985","target":"record","created_at":"2026-07-05T09:22:30Z","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":"950ad07030075537633b8df86c033f0356a3b87fa58b634a027b3677b80cd290","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T08:26:07Z","title_canon_sha256":"312ac2c4bc1906f0d0a7256035a21ccb3a93774dd262cf3235f12185d0eb3e8c"},"schema_version":"1.0","source":{"id":"2410.14272","kind":"arxiv","version":1}},"canonical_sha256":"57cb95104a7d7f3c58a669d4df104e5d7e96eeabf6e924b8b7b0e7d90ef6b380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57cb95104a7d7f3c58a669d4df104e5d7e96eeabf6e924b8b7b0e7d90ef6b380","first_computed_at":"2026-07-05T09:22:30.002487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:22:30.002487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cU0bUrhj2jb5lhJ1L/XnIigb6QkF1Jst874A3Rq0EoJJVIV1MXkM8jMh8DcT14trRQjtqzeVLHJKrEhjbAsNBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:22:30.002929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.14272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a27aec51506132e82cab20cae3a517f41e98a7eef2dedf4afe3bd043594f985","sha256:3fb695a7f2a55f9c43e5af6b6d7451931415273f4d9016a524d0342aca5e770f"],"state_sha256":"9cfb9cc32994185b6534cda3ee855bd7de7933fa2496ef6153624d7bfc545205"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kd1VJlBkmVcFP6oDhFijVOc6OOldZoMaG8C032jvmc0P4OT2D+SAFrVI+y0IqK3TlxTtcpAGAOMUbSW1CnbtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:27:19.975562Z","bundle_sha256":"200082e33161b236de77246dac58eb10cef593cce90ab4a3725e9663a1b6b870"}}