{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FJ66XTOFCUSEWWL4DRTJKBMG74","short_pith_number":"pith:FJ66XTOF","canonical_record":{"source":{"id":"2506.14149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-06-17T03:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"82bbf856b384b4ef6042db2882c7186e93ab2dcc7b98e8961bb29166852f7ee8","abstract_canon_sha256":"60068619aead03ae42f65aae83a77be726d001d27d9d262bfba4b2910c7ebfb5"},"schema_version":"1.0"},"canonical_sha256":"2a7debcdc515244b597c1c66950586ff1a5eb366d9d4ba2a2e7635a311b2cd4b","source":{"kind":"arxiv","id":"2506.14149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14149","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14149v1","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14149","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"FJ66XTOFCUSE","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_16","alias_value":"FJ66XTOFCUSEWWL4","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_8","alias_value":"FJ66XTOF","created_at":"2026-07-05T11:22:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FJ66XTOFCUSEWWL4DRTJKBMG74","target":"record","payload":{"canonical_record":{"source":{"id":"2506.14149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-06-17T03:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"82bbf856b384b4ef6042db2882c7186e93ab2dcc7b98e8961bb29166852f7ee8","abstract_canon_sha256":"60068619aead03ae42f65aae83a77be726d001d27d9d262bfba4b2910c7ebfb5"},"schema_version":"1.0"},"canonical_sha256":"2a7debcdc515244b597c1c66950586ff1a5eb366d9d4ba2a2e7635a311b2cd4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:49.967075Z","signature_b64":"nZlrrScZVIAHTZjV1bXS67x04vQVQIA/u45LYrIWmoQfdwFWBVSvLRQ3+AE2jnA6lSto8BB+J/Yc+VRxdCXWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a7debcdc515244b597c1c66950586ff1a5eb366d9d4ba2a2e7635a311b2cd4b","last_reissued_at":"2026-07-05T11:22:49.966401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:49.966401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.14149","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-05T11:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pw5M7XOFncg8364uoR75a17YJqiXyfzo6M2KlwqIKt7SCNNEC/8kSBEglCyMidlmtyN15gdMgQTPv047s6l9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:16:37.577013Z"},"content_sha256":"9ab300993e44b5bf5a893effdfc1c689c54954934e075a6187c0f4d646d33b1a","schema_version":"1.0","event_id":"sha256:9ab300993e44b5bf5a893effdfc1c689c54954934e075a6187c0f4d646d33b1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FJ66XTOFCUSEWWL4DRTJKBMG74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dividing Conflicting Items Fairly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ayumi Igarashi, Hirotaka Yoneda, Pasin Manurangsi","submitted_at":"2025-06-17T03:26:51Z","abstract_excerpt":"We study the allocation of indivisible goods under conflicting constraints, represented by a graph. In this framework, vertices correspond to goods and edges correspond to conflicts between a pair of goods. Each agent is allocated an independent set in the graph. In a recent work of Kumar et al. (2024), it was shown that a maximal EF1 allocation exists for interval graphs and two agents with monotone valuations. We significantly extend this result by establishing that a maximal EF1 allocation exists for \\emph{any graph} when the two agents have monotone valuations. To compute such an allocatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14149","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/2506.14149/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-05T11:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQaB+bIadGZz659PERcffcKDwAc6MeyCkI1T4E32jLQ6mkkAHIA9Cjo62Kf7Ld/8m5xsDkrOfICgNjgD/J1rAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:16:37.577518Z"},"content_sha256":"b9d25aeb7f5aa34ec123641dcd81b77cfe3e7c5ce0f1b2fff74bf976f7f44e43","schema_version":"1.0","event_id":"sha256:b9d25aeb7f5aa34ec123641dcd81b77cfe3e7c5ce0f1b2fff74bf976f7f44e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/bundle.json","state_url":"https://pith.science/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/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-11T03:16:37Z","links":{"resolver":"https://pith.science/pith/FJ66XTOFCUSEWWL4DRTJKBMG74","bundle":"https://pith.science/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/bundle.json","state":"https://pith.science/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJ66XTOFCUSEWWL4DRTJKBMG74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FJ66XTOFCUSEWWL4DRTJKBMG74","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":"60068619aead03ae42f65aae83a77be726d001d27d9d262bfba4b2910c7ebfb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-06-17T03:26:51Z","title_canon_sha256":"82bbf856b384b4ef6042db2882c7186e93ab2dcc7b98e8961bb29166852f7ee8"},"schema_version":"1.0","source":{"id":"2506.14149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14149","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14149v1","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14149","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"FJ66XTOFCUSE","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_16","alias_value":"FJ66XTOFCUSEWWL4","created_at":"2026-07-05T11:22:49Z"},{"alias_kind":"pith_short_8","alias_value":"FJ66XTOF","created_at":"2026-07-05T11:22:49Z"}],"graph_snapshots":[{"event_id":"sha256:b9d25aeb7f5aa34ec123641dcd81b77cfe3e7c5ce0f1b2fff74bf976f7f44e43","target":"graph","created_at":"2026-07-05T11:22:49Z","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/2506.14149/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 under conflicting constraints, represented by a graph. In this framework, vertices correspond to goods and edges correspond to conflicts between a pair of goods. Each agent is allocated an independent set in the graph. In a recent work of Kumar et al. (2024), it was shown that a maximal EF1 allocation exists for interval graphs and two agents with monotone valuations. We significantly extend this result by establishing that a maximal EF1 allocation exists for \\emph{any graph} when the two agents have monotone valuations. To compute such an allocatio","authors_text":"Ayumi Igarashi, Hirotaka Yoneda, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-06-17T03:26:51Z","title":"Dividing Conflicting Items Fairly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14149","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:9ab300993e44b5bf5a893effdfc1c689c54954934e075a6187c0f4d646d33b1a","target":"record","created_at":"2026-07-05T11:22:49Z","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":"60068619aead03ae42f65aae83a77be726d001d27d9d262bfba4b2910c7ebfb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-06-17T03:26:51Z","title_canon_sha256":"82bbf856b384b4ef6042db2882c7186e93ab2dcc7b98e8961bb29166852f7ee8"},"schema_version":"1.0","source":{"id":"2506.14149","kind":"arxiv","version":1}},"canonical_sha256":"2a7debcdc515244b597c1c66950586ff1a5eb366d9d4ba2a2e7635a311b2cd4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a7debcdc515244b597c1c66950586ff1a5eb366d9d4ba2a2e7635a311b2cd4b","first_computed_at":"2026-07-05T11:22:49.966401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:49.966401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nZlrrScZVIAHTZjV1bXS67x04vQVQIA/u45LYrIWmoQfdwFWBVSvLRQ3+AE2jnA6lSto8BB+J/Yc+VRxdCXWCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:49.967075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ab300993e44b5bf5a893effdfc1c689c54954934e075a6187c0f4d646d33b1a","sha256:b9d25aeb7f5aa34ec123641dcd81b77cfe3e7c5ce0f1b2fff74bf976f7f44e43"],"state_sha256":"0d6b5000ddfa025d83ef38e762c4e9950997d6874f19c0706917a4e193069e58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUI/Q+ZND4FbX/cn+3Chkwe+3hJxHABRhOu2mTmcgMr+cT2hIpw/XJ+umcJ6mUUE1IGwxi2pdIcAr5B+ao9lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:16:37.607256Z","bundle_sha256":"8cd25a37c57bda559e26c7b4bb08e700c2ed02014c4bac02cac806292b91ae1f"}}