{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XMWHBK6US43XZWMX3E2BTM7W4E","short_pith_number":"pith:XMWHBK6U","canonical_record":{"source":{"id":"2607.01059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-01T15:22:32Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"515337574dd1c412a1317f09138dd4c1d0fb97bd118aa7b74a6df9fc19d89062","abstract_canon_sha256":"6e5d92b70889a351626989f78cdb7432e4ba8ceaa10b7a2f992eebb06dab8495"},"schema_version":"1.0"},"canonical_sha256":"bb2c70abd497377cd997d93419b3f6e13df50eb30dbcd226bb9d7116812ed56b","source":{"kind":"arxiv","id":"2607.01059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01059","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01059v1","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01059","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"XMWHBK6US43X","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_16","alias_value":"XMWHBK6US43XZWMX","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_8","alias_value":"XMWHBK6U","created_at":"2026-07-02T01:18:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XMWHBK6US43XZWMX3E2BTM7W4E","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-01T15:22:32Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"515337574dd1c412a1317f09138dd4c1d0fb97bd118aa7b74a6df9fc19d89062","abstract_canon_sha256":"6e5d92b70889a351626989f78cdb7432e4ba8ceaa10b7a2f992eebb06dab8495"},"schema_version":"1.0"},"canonical_sha256":"bb2c70abd497377cd997d93419b3f6e13df50eb30dbcd226bb9d7116812ed56b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:27.596696Z","signature_b64":"rzvwECcxdhL05rJvfYqVnvFrpNn1/iTADVrSHbnzyFHPR8hyPsg4+ACwC6eJi9/PP7+9vB4M66f8P66pwXaQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb2c70abd497377cd997d93419b3f6e13df50eb30dbcd226bb9d7116812ed56b","last_reissued_at":"2026-07-02T01:18:27.596212Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:27.596212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01059","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-02T01:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgS0xiMQH/2axV/pzjFRyA2svEi0O+0yYKXufWyU9fN5gBtzBnscyStHz+0NFKMmXEUFQWXxLLiOJ3hLtSjsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:51:26.342659Z"},"content_sha256":"0b739f45c97686c100b0d830f04bc0dacbb91219adebf773013e5867de3351bf","schema_version":"1.0","event_id":"sha256:0b739f45c97686c100b0d830f04bc0dacbb91219adebf773013e5867de3351bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XMWHBK6US43XZWMX3E2BTM7W4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Allocation under Conflict Constraints via Strong Colorability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.GT","authors_text":"Ishay Haviv","submitted_at":"2026-07-01T15:22:32Z","abstract_excerpt":"In the fair allocation problem under conflict constraints, the goal is to partition the vertices of a graph among agents in a fair manner, such that no two adjacent vertices are assigned to the same agent. We study this problem for agents with common preferences through the lens of three fairness criteria: stochastic-dominance envy-freeness up to one item for preference orders (SD-EF1), envy-freeness up to one item for monotone additive valuations (EF1), and envy-freeness up to one item from each side for general additive valuations (EF[1,1]). To do so, we introduce a hierarchy of variants of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01059","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/2607.01059/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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKQIGW25tvMLv6rt0WO6RZN11AkAwcnWwiwOF1RweJyEwV20n4E1q4gT76lc85B74R0TJ5ZOvom4mEKJEaGWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:51:26.343043Z"},"content_sha256":"cdad5344a47386014ddef7dff1a1498c9870139868e24ac08da2c414be0e1166","schema_version":"1.0","event_id":"sha256:cdad5344a47386014ddef7dff1a1498c9870139868e24ac08da2c414be0e1166"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMWHBK6US43XZWMX3E2BTM7W4E/bundle.json","state_url":"https://pith.science/pith/XMWHBK6US43XZWMX3E2BTM7W4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMWHBK6US43XZWMX3E2BTM7W4E/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-07-14T12:51:26Z","links":{"resolver":"https://pith.science/pith/XMWHBK6US43XZWMX3E2BTM7W4E","bundle":"https://pith.science/pith/XMWHBK6US43XZWMX3E2BTM7W4E/bundle.json","state":"https://pith.science/pith/XMWHBK6US43XZWMX3E2BTM7W4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMWHBK6US43XZWMX3E2BTM7W4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XMWHBK6US43XZWMX3E2BTM7W4E","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":"6e5d92b70889a351626989f78cdb7432e4ba8ceaa10b7a2f992eebb06dab8495","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-01T15:22:32Z","title_canon_sha256":"515337574dd1c412a1317f09138dd4c1d0fb97bd118aa7b74a6df9fc19d89062"},"schema_version":"1.0","source":{"id":"2607.01059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01059","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01059v1","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01059","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"XMWHBK6US43X","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_16","alias_value":"XMWHBK6US43XZWMX","created_at":"2026-07-02T01:18:27Z"},{"alias_kind":"pith_short_8","alias_value":"XMWHBK6U","created_at":"2026-07-02T01:18:27Z"}],"graph_snapshots":[{"event_id":"sha256:cdad5344a47386014ddef7dff1a1498c9870139868e24ac08da2c414be0e1166","target":"graph","created_at":"2026-07-02T01:18:27Z","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/2607.01059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the fair allocation problem under conflict constraints, the goal is to partition the vertices of a graph among agents in a fair manner, such that no two adjacent vertices are assigned to the same agent. We study this problem for agents with common preferences through the lens of three fairness criteria: stochastic-dominance envy-freeness up to one item for preference orders (SD-EF1), envy-freeness up to one item for monotone additive valuations (EF1), and envy-freeness up to one item from each side for general additive valuations (EF[1,1]). To do so, we introduce a hierarchy of variants of ","authors_text":"Ishay Haviv","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-01T15:22:32Z","title":"Fair Allocation under Conflict Constraints via Strong Colorability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01059","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:0b739f45c97686c100b0d830f04bc0dacbb91219adebf773013e5867de3351bf","target":"record","created_at":"2026-07-02T01:18:27Z","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":"6e5d92b70889a351626989f78cdb7432e4ba8ceaa10b7a2f992eebb06dab8495","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-01T15:22:32Z","title_canon_sha256":"515337574dd1c412a1317f09138dd4c1d0fb97bd118aa7b74a6df9fc19d89062"},"schema_version":"1.0","source":{"id":"2607.01059","kind":"arxiv","version":1}},"canonical_sha256":"bb2c70abd497377cd997d93419b3f6e13df50eb30dbcd226bb9d7116812ed56b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb2c70abd497377cd997d93419b3f6e13df50eb30dbcd226bb9d7116812ed56b","first_computed_at":"2026-07-02T01:18:27.596212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:27.596212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzvwECcxdhL05rJvfYqVnvFrpNn1/iTADVrSHbnzyFHPR8hyPsg4+ACwC6eJi9/PP7+9vB4M66f8P66pwXaQBQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:27.596696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b739f45c97686c100b0d830f04bc0dacbb91219adebf773013e5867de3351bf","sha256:cdad5344a47386014ddef7dff1a1498c9870139868e24ac08da2c414be0e1166"],"state_sha256":"0a32dc2f15bd980fb9656d88b7fd49acdd4ff30c7ed37f4791ae794b46682832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gem9KjNRwSqndal9n0VS8QLkDcpd3C6q2LU0+gEd0SMFkT0jI5Z39aFgVZgZPQV+HE2SQ+T+lDIpz4rmpvPiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T12:51:26.345625Z","bundle_sha256":"14873495ba3c1df031ef20f1422693e88a2562fb99808226836168248bc977d4"}}