{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C5J3RKAHBL5UBC2CBLOMHMPTYR","short_pith_number":"pith:C5J3RKAH","schema_version":"1.0","canonical_sha256":"1753b8a8070afb408b420adcc3b1f3c44c64d3fc4d790cf7a9d05bc052b27706","source":{"kind":"arxiv","id":"2507.12984","version":1},"attestation_state":"computed","paper":{"title":"Lower Bound for Online MMS Assignment of Indivisible Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Masoud Seddighin, Saeed Seddighin","submitted_at":"2025-07-17T10:39:27Z","abstract_excerpt":"We consider the problem of online assignment of indivisible chores under \\MMS\\ criteria. The previous work proves that any deterministic online algorithm for chore division has a competitive ratio of at least 2. In this work, we improve this bound by showing that no deterministic online algorithm can obtain a competitive ratio better than $n$ for $n$ agents."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.12984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-07-17T10:39:27Z","cross_cats_sorted":[],"title_canon_sha256":"7dc4994c987e3dd0d82ca64436422f2ee570407d9931a155548341aba38ca92f","abstract_canon_sha256":"18cd4588020ac3d097756df2ea80d5e18397a88c6553c544c511e66d3bb7a251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:42.584037Z","signature_b64":"k03M5bL6bnLy0UQ/MRCpMSGHzv1r4Wb6KiQpDO9CzGzonBTbamUeVHZ6BB/fl6ct3kod8e7te+uFsd4jE0GXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1753b8a8070afb408b420adcc3b1f3c44c64d3fc4d790cf7a9d05bc052b27706","last_reissued_at":"2026-07-05T11:38:42.583630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:42.583630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound for Online MMS Assignment of Indivisible Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Masoud Seddighin, Saeed Seddighin","submitted_at":"2025-07-17T10:39:27Z","abstract_excerpt":"We consider the problem of online assignment of indivisible chores under \\MMS\\ criteria. The previous work proves that any deterministic online algorithm for chore division has a competitive ratio of at least 2. In this work, we improve this bound by showing that no deterministic online algorithm can obtain a competitive ratio better than $n$ for $n$ agents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12984","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/2507.12984/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.12984","created_at":"2026-07-05T11:38:42.583681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12984v1","created_at":"2026-07-05T11:38:42.583681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12984","created_at":"2026-07-05T11:38:42.583681+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5J3RKAHBL5U","created_at":"2026-07-05T11:38:42.583681+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5J3RKAHBL5UBC2C","created_at":"2026-07-05T11:38:42.583681+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5J3RKAH","created_at":"2026-07-05T11:38:42.583681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR","json":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR.json","graph_json":"https://pith.science/api/pith-number/C5J3RKAHBL5UBC2CBLOMHMPTYR/graph.json","events_json":"https://pith.science/api/pith-number/C5J3RKAHBL5UBC2CBLOMHMPTYR/events.json","paper":"https://pith.science/paper/C5J3RKAH"},"agent_actions":{"view_html":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR","download_json":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR.json","view_paper":"https://pith.science/paper/C5J3RKAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12984&json=true","fetch_graph":"https://pith.science/api/pith-number/C5J3RKAHBL5UBC2CBLOMHMPTYR/graph.json","fetch_events":"https://pith.science/api/pith-number/C5J3RKAHBL5UBC2CBLOMHMPTYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR/action/storage_attestation","attest_author":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR/action/author_attestation","sign_citation":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR/action/citation_signature","submit_replication":"https://pith.science/pith/C5J3RKAHBL5UBC2CBLOMHMPTYR/action/replication_record"}},"created_at":"2026-07-05T11:38:42.583681+00:00","updated_at":"2026-07-05T11:38:42.583681+00:00"}