{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EHQ2M47EHWV53ZATRJ4AEHVNPM","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":"95b3b9abd8fa9e6b1189552dfdb7a6de892547337efc7e1f2302cac40ff1e542","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-15T06:12:43Z","title_canon_sha256":"d38aa88430d616dfb46d1f36bbcffc6060ce8c72388d28116b175887498e9cd0"},"schema_version":"1.0","source":{"id":"1908.05433","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05433","created_at":"2026-07-05T05:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05433v3","created_at":"2026-07-05T05:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05433","created_at":"2026-07-05T05:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"EHQ2M47EHWV5","created_at":"2026-07-05T05:52:05Z"},{"alias_kind":"pith_short_16","alias_value":"EHQ2M47EHWV53ZAT","created_at":"2026-07-05T05:52:05Z"},{"alias_kind":"pith_short_8","alias_value":"EHQ2M47E","created_at":"2026-07-05T05:52:05Z"}],"graph_snapshots":[{"event_id":"sha256:45cb83cd9964aed7ebaa528440fa27375ed6f77cd4530c3d896be78a3bbd41e4","target":"graph","created_at":"2026-07-05T05:52:05Z","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/1908.05433/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the allocation of indivisible goods that form an undirected graph and quantify the loss of fairness when we impose a constraint that each agent must receive a connected subgraph. Our focus is on well-studied fairness notions including envy-freeness and maximin share fairness. We introduce the price of connectivity to capture the largest gap between the graph-specific and the unconstrained maximin share, and derive bounds on this quantity which are tight for large classes of graphs in the case of two agents and for paths and stars in the general case. For instance, with two agents we s","authors_text":"Ayumi Igarashi, Warut Suksompong, Xiaohui Bei, Xinhang Lu","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-15T06:12:43Z","title":"The Price of Connectivity in Fair Division"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05433","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:489f79c78a0627fd8c93571b5da8d66fa2d6ada02a491ed38ae99ab0e36726f6","target":"record","created_at":"2026-07-05T05:52:05Z","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":"95b3b9abd8fa9e6b1189552dfdb7a6de892547337efc7e1f2302cac40ff1e542","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-15T06:12:43Z","title_canon_sha256":"d38aa88430d616dfb46d1f36bbcffc6060ce8c72388d28116b175887498e9cd0"},"schema_version":"1.0","source":{"id":"1908.05433","kind":"arxiv","version":3}},"canonical_sha256":"21e1a673e43dabdde4138a78021ead7b0acf84bc995fa8e3b4dc9fed087e0ca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21e1a673e43dabdde4138a78021ead7b0acf84bc995fa8e3b4dc9fed087e0ca3","first_computed_at":"2026-07-05T05:52:05.646517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:52:05.646517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2bmYhc/YqER5R0HuvE/TCAporCMzxcGePV5E+IUW+HdAzQTO15i2KiayDHkoNwHmWVb2nFntz8c5ojuS0vuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:52:05.647009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05433","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:489f79c78a0627fd8c93571b5da8d66fa2d6ada02a491ed38ae99ab0e36726f6","sha256:45cb83cd9964aed7ebaa528440fa27375ed6f77cd4530c3d896be78a3bbd41e4"],"state_sha256":"fa48778911b29bee29f3f70011251bb00d6b5ef18bdfad243147403301570655"}