{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R6INP6L2FVDIYLECKINWH7AOCH","short_pith_number":"pith:R6INP6L2","canonical_record":{"source":{"id":"2607.27455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:43:46Z","cross_cats_sorted":[],"title_canon_sha256":"2c600ee817220095722bcb5cc09224800dc09167f056a4879b1b65a9e20a0ecb","abstract_canon_sha256":"110554a52f5c9d66ac25b819ea272265179bae8fdd7fecfdbe722eb8d7c57058"},"schema_version":"1.0"},"canonical_sha256":"8f90d7f97a2d468c2c82521b63fc0e11cebda7d69da571791dd8101de019a83c","source":{"kind":"arxiv","id":"2607.27455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27455","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27455v1","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27455","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"R6INP6L2FVDI","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6INP6L2FVDIYLEC","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6INP6L2","created_at":"2026-07-31T00:12:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R6INP6L2FVDIYLECKINWH7AOCH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:43:46Z","cross_cats_sorted":[],"title_canon_sha256":"2c600ee817220095722bcb5cc09224800dc09167f056a4879b1b65a9e20a0ecb","abstract_canon_sha256":"110554a52f5c9d66ac25b819ea272265179bae8fdd7fecfdbe722eb8d7c57058"},"schema_version":"1.0"},"canonical_sha256":"8f90d7f97a2d468c2c82521b63fc0e11cebda7d69da571791dd8101de019a83c","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f90d7f97a2d468c2c82521b63fc0e11cebda7d69da571791dd8101de019a83c","last_reissued_at":"2026-07-31T00:12:13.071954Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:12:13.071954Z"},"source_kind":"arxiv","source_id":"2607.27455","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-31T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsmPeihXAgOcPu+R74E81tnBwWx7con8U32fXlFD9b02srpucXEBeo2RRcRMXgpAgOV1npcanTCvPiMAumHnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T11:35:06.081471Z"},"content_sha256":"1ced46e9125e88f098a4001a99e10673b8387a239b01bfe448839383083ad54e","schema_version":"1.0","event_id":"sha256:1ced46e9125e88f098a4001a99e10673b8387a239b01bfe448839383083ad54e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R6INP6L2FVDIYLECKINWH7AOCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Bound on the Rainbow Cycle Number and Approximate EFX","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Varun Sivashankar","submitted_at":"2026-07-29T20:43:46Z","abstract_excerpt":"It is open whether every fair-division instance with additive valuations admits a complete envy-free-up-to-any-good (EFX) allocation. A well-studied relaxation allows some goods to remain unallocated and asks for $(1-\\varepsilon)$-EFX. The rainbow cycle number $R(d)$ was introduced to study this problem: upper bounds on $R(d)$ yield approximate EFX allocations with few unallocated goods. The best previous bound, $R(d)=O(d\\log d)$, gives $O_\\varepsilon(\\sqrt{n\\log n})$ unallocated goods. We resolve the conjecture that $R(d)$ is linear by proving $R(d)<ed$. It follows that every instance with $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27455","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.27455/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-31T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+yZVxuXqgLsI48dRZtlHZRHItjMu8RZf5ZSAl9uA56I13j5l0ZaFsWrgM3uwtN3cNnOtE7ur5XogRnmZ7BtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T11:35:06.081985Z"},"content_sha256":"c6853d4ccab7165c12cd3a421177613fa34f857b8f4ef56afbe114d9f95437a1","schema_version":"1.0","event_id":"sha256:c6853d4ccab7165c12cd3a421177613fa34f857b8f4ef56afbe114d9f95437a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6INP6L2FVDIYLECKINWH7AOCH/bundle.json","state_url":"https://pith.science/pith/R6INP6L2FVDIYLECKINWH7AOCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6INP6L2FVDIYLECKINWH7AOCH/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-19T11:35:06Z","links":{"resolver":"https://pith.science/pith/R6INP6L2FVDIYLECKINWH7AOCH","bundle":"https://pith.science/pith/R6INP6L2FVDIYLECKINWH7AOCH/bundle.json","state":"https://pith.science/pith/R6INP6L2FVDIYLECKINWH7AOCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6INP6L2FVDIYLECKINWH7AOCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R6INP6L2FVDIYLECKINWH7AOCH","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":"110554a52f5c9d66ac25b819ea272265179bae8fdd7fecfdbe722eb8d7c57058","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:43:46Z","title_canon_sha256":"2c600ee817220095722bcb5cc09224800dc09167f056a4879b1b65a9e20a0ecb"},"schema_version":"1.0","source":{"id":"2607.27455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27455","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27455v1","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27455","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"R6INP6L2FVDI","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6INP6L2FVDIYLEC","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6INP6L2","created_at":"2026-07-31T00:12:13Z"}],"graph_snapshots":[{"event_id":"sha256:c6853d4ccab7165c12cd3a421177613fa34f857b8f4ef56afbe114d9f95437a1","target":"graph","created_at":"2026-07-31T00:12: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/2607.27455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is open whether every fair-division instance with additive valuations admits a complete envy-free-up-to-any-good (EFX) allocation. A well-studied relaxation allows some goods to remain unallocated and asks for $(1-\\varepsilon)$-EFX. The rainbow cycle number $R(d)$ was introduced to study this problem: upper bounds on $R(d)$ yield approximate EFX allocations with few unallocated goods. The best previous bound, $R(d)=O(d\\log d)$, gives $O_\\varepsilon(\\sqrt{n\\log n})$ unallocated goods. We resolve the conjecture that $R(d)$ is linear by proving $R(d)<ed$. It follows that every instance with $n","authors_text":"Varun Sivashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:43:46Z","title":"A Linear Bound on the Rainbow Cycle Number and Approximate EFX"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27455","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:1ced46e9125e88f098a4001a99e10673b8387a239b01bfe448839383083ad54e","target":"record","created_at":"2026-07-31T00:12: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":"110554a52f5c9d66ac25b819ea272265179bae8fdd7fecfdbe722eb8d7c57058","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:43:46Z","title_canon_sha256":"2c600ee817220095722bcb5cc09224800dc09167f056a4879b1b65a9e20a0ecb"},"schema_version":"1.0","source":{"id":"2607.27455","kind":"arxiv","version":1}},"canonical_sha256":"8f90d7f97a2d468c2c82521b63fc0e11cebda7d69da571791dd8101de019a83c","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f90d7f97a2d468c2c82521b63fc0e11cebda7d69da571791dd8101de019a83c","first_computed_at":"2026-07-31T00:12:13.071954Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:12:13.071954Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ced46e9125e88f098a4001a99e10673b8387a239b01bfe448839383083ad54e","sha256:c6853d4ccab7165c12cd3a421177613fa34f857b8f4ef56afbe114d9f95437a1"],"state_sha256":"57d1a34ea8cc573a1409ec1480fe384fb052029668d463d1b592f51ed63371fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0yTTkFareATEJg3PJoWIko3TRmqmdtmvRPzIcISgNBYAjZFPrBCAj00ZHTU3wq7tyPMhdpaQ9UmdKmNNaIfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T11:35:06.087091Z","bundle_sha256":"851dc93d54caa7e7e829228abc707f1b6f925c14e21b1deabac64fc39f199d71"}}