{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP","short_pith_number":"pith:DVTUFBOC","canonical_record":{"source":{"id":"2605.12812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-12T23:13:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d714d0e28b1ac02a97122e0a5960360cdfe7a0a27ceeccc6bdf9a2b81c77fb0f","abstract_canon_sha256":"a0ed374508435d6976724676eb53bc3b0d489fad294422ea6c83bfe5e7fdf3f6"},"schema_version":"1.0"},"canonical_sha256":"1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c","source":{"kind":"arxiv","id":"2605.12812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12812","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12812v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12812","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"DVTUFBOC2FM4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DVTUFBOC2FM4KFQC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DVTUFBOC","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-12T23:13:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d714d0e28b1ac02a97122e0a5960360cdfe7a0a27ceeccc6bdf9a2b81c77fb0f","abstract_canon_sha256":"a0ed374508435d6976724676eb53bc3b0d489fad294422ea6c83bfe5e7fdf3f6"},"schema_version":"1.0"},"canonical_sha256":"1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.414156Z","signature_b64":"B4SnQysYAbNBWIIYYBn4D0HK2iTDaJ+xrJXkisxc0lUE1GSCCWZtWvLxzEqR2A2ro11OnyWFoVxmTDxOJMhmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c","last_reissued_at":"2026-05-18T03:09:12.412963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.412963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12812","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-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHNoMva3TADnqtb8MLeYCiDAAfW3Fyt2FKMROBfSW7D8tRMMqK2PmPMDpzEZaASTMONhqmF/D87q6V1/k1GfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:38:43.354482Z"},"content_sha256":"fe5b82ddc03fcd0a3613fec7312f9c262a722395bb6ff6d4263f7595a27d21c6","schema_version":"1.0","event_id":"sha256:fe5b82ddc03fcd0a3613fec7312f9c262a722395bb6ff6d4263f7595a27d21c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time and Supply Fairness in Electricity Distribution using $k$-times bin packing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households.","cross_cats":["cs.MA"],"primary_cat":"cs.DS","authors_text":"Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi","submitted_at":"2026-05-12T23:13:44Z","abstract_excerpt":"Given items of different sizes and a fixed bin capacity, the bin-packing problem is to pack these items into the minimum number of bins such that the sum of the item sizes in each bin does not exceed the capacity. We define a new variant, k-times bin-packing (kBP), in which the goal is to pack the items so that each item appears exactly k times in k different bins. We generalize existing approximation algorithms for bin-packing to solve kBP and analyze their performance ratios. The fair electricity division problem motivates the study of kBP. The goal is to allocate the available supply among "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that every electricity division problem can be solved by k-times bin-packing for some finite k, which depends only on the number of households.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That household electricity demands can be represented as fixed item sizes whose sums fit the bin-capacity model without distorting the egalitarian fairness criteria, and that the required k remains independent of the specific demand values.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0e1b41b26e068630304711593d44609293efa72f9a6dc54a20984a8b03d99f48"},"source":{"id":"2605.12812","kind":"arxiv","version":1},"verdict":{"id":"660324cd-6482-4611-b5d4-430693bcfcae","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:25:55.486856Z","strongest_claim":"We prove that every electricity division problem can be solved by k-times bin-packing for some finite k, which depends only on the number of households.","one_line_summary":"k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That household electricity demands can be represented as fixed item sizes whose sums fit the bin-capacity model without distorting the egalitarian fairness criteria, and that the required k remains independent of the specific demand values.","pith_extraction_headline":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households."},"references":{"count":47,"sample":[{"doi":"","year":2017,"title":"IEEE intelligent systems 32(1), 24–31 (2017)","work_id":"12ac32e5-2fb1-4861-a1d7-0604554b3809","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-030-55187-2_32","year":2021,"title":"Advances in Intelligent Systems and Computing1251 AISC, 407–424 (2021).https://doi.org/ 10.1007/978-3-030-55187-2_32","work_id":"f37a6eab-0f83-46ef-bd0f-3655fbe179ed","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Competitive algorithms for server problems","work_id":"3d0c90fd-61ef-44af-8fee-6cbef7041958","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/cbo9780511598975","year":1996,"title":"Cambridge University Press (1996).https://doi.org/10.1017/CBO9780511598975","work_id":"12e24bec-49dc-4e9d-becd-288eaf7b3bcb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Pro- ceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020-May(Aamas), 204–212 (2020)","work_id":"10e549db-d2af-425b-b468-f05ae8e0439b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"1c63c3990152c1fbd00318bf6e5fcf320af261c9144a3ced8cef98166e456315","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":"660324cd-6482-4611-b5d4-430693bcfcae"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgIy6pamToXcLDWCdA8BMu1gCFPeE7PsnkrPAeVK52nJJ+qug4MadVA8zioS55hrnio3ssZDRkMQ4dks47FEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:38:43.355101Z"},"content_sha256":"5140594834301024a24ad3c17b7fbca78b8b56098a31e82ca7205ffb1f9b1e1d","schema_version":"1.0","event_id":"sha256:5140594834301024a24ad3c17b7fbca78b8b56098a31e82ca7205ffb1f9b1e1d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP","target":"integrity","payload":{"note":"Identifier '10.1016/s0305-0548(02' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Computers & Operations Research31(3), 347–358 (Mar 2004).https://doi.org/10.1016/S0305-0548(02) 00195-8","arxiv_id":"2605.12812","detector":"doi_compliance","evidence":{"doi":"10.1016/s0305-0548(02","arxiv_id":null,"ref_index":20,"raw_excerpt":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Computers & Operations Research31(3), 347–358 (Mar 2004).https://doi.org/10.1016/S0305-0548(02) 00195-8","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":20,"audited_at":"2026-05-19T07:03:22.275020Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0305-0548(02","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"433d3520292a56422283c8b06647f54243291ba7de93ac06721639d19ed85a02","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":259,"payload_sha256":"77ed90663f2cfb11bfc5ad306184629ae56ff1e79af6448539a6cb5d249eab1c","signature_b64":"ycImYxLV5CUoKYj8qLSSt4cRm5taXkVRc7geyuqQCK2z4yK6hbBRg+Ocq4jMC75UFutFtAlwEb7fL8zRNlHxAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T07:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utnQEyCnOCrXKW7Bi9bsHmhooC9JK81ynurwyt7lU8n58Ms+2tdKAct0Je3oqhbK3Pa3zdtCkIW01t5H8xuEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:38:43.356028Z"},"content_sha256":"a466d50474bfc842f39eaf2092424a42a5428abb71f32471d238c6b84ea50da0","schema_version":"1.0","event_id":"sha256:a466d50474bfc842f39eaf2092424a42a5428abb71f32471d238c6b84ea50da0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/bundle.json","state_url":"https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/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-05-21T06:38:43Z","links":{"resolver":"https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP","bundle":"https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/bundle.json","state":"https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a0ed374508435d6976724676eb53bc3b0d489fad294422ea6c83bfe5e7fdf3f6","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-12T23:13:44Z","title_canon_sha256":"d714d0e28b1ac02a97122e0a5960360cdfe7a0a27ceeccc6bdf9a2b81c77fb0f"},"schema_version":"1.0","source":{"id":"2605.12812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12812","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12812v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12812","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"DVTUFBOC2FM4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DVTUFBOC2FM4KFQC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DVTUFBOC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5140594834301024a24ad3c17b7fbca78b8b56098a31e82ca7205ffb1f9b1e1d","target":"graph","created_at":"2026-05-18T03:09:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that every electricity division problem can be solved by k-times bin-packing for some finite k, which depends only on the number of households."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That household electricity demands can be represented as fixed item sizes whose sums fit the bin-capacity model without distorting the egalitarian fairness criteria, and that the required k remains independent of the specific demand values."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households."}],"snapshot_sha256":"0e1b41b26e068630304711593d44609293efa72f9a6dc54a20984a8b03d99f48"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given items of different sizes and a fixed bin capacity, the bin-packing problem is to pack these items into the minimum number of bins such that the sum of the item sizes in each bin does not exceed the capacity. We define a new variant, k-times bin-packing (kBP), in which the goal is to pack the items so that each item appears exactly k times in k different bins. We generalize existing approximation algorithms for bin-packing to solve kBP and analyze their performance ratios. The fair electricity division problem motivates the study of kBP. The goal is to allocate the available supply among ","authors_text":"Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi","cross_cats":["cs.MA"],"headline":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-12T23:13:44Z","title":"Time and Supply Fairness in Electricity Distribution using $k$-times bin packing"},"references":{"count":47,"internal_anchors":0,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"IEEE intelligent systems 32(1), 24–31 (2017)","work_id":"12ac32e5-2fb1-4861-a1d7-0604554b3809","year":2017},{"cited_arxiv_id":"","doi":"10.1007/978-3-030-55187-2_32","is_internal_anchor":false,"ref_index":2,"title":"Advances in Intelligent Systems and Computing1251 AISC, 407–424 (2021).https://doi.org/ 10.1007/978-3-030-55187-2_32","work_id":"f37a6eab-0f83-46ef-bd0f-3655fbe179ed","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Competitive algorithms for server problems","work_id":"3d0c90fd-61ef-44af-8fee-6cbef7041958","year":1985},{"cited_arxiv_id":"","doi":"10.1017/cbo9780511598975","is_internal_anchor":false,"ref_index":4,"title":"Cambridge University Press (1996).https://doi.org/10.1017/CBO9780511598975","work_id":"12e24bec-49dc-4e9d-becd-288eaf7b3bcb","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Pro- ceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020-May(Aamas), 204–212 (2020)","work_id":"10e549db-d2af-425b-b468-f05ae8e0439b","year":2020}],"snapshot_sha256":"1c63c3990152c1fbd00318bf6e5fcf320af261c9144a3ced8cef98166e456315"},"source":{"id":"2605.12812","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:25:55.486856Z","id":"660324cd-6482-4611-b5d4-430693bcfcae","model_set":{"reader":"grok-4.3"},"one_line_summary":"k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households.","strongest_claim":"We prove that every electricity division problem can be solved by k-times bin-packing for some finite k, which depends only on the number of households.","weakest_assumption":"That household electricity demands can be represented as fixed item sizes whose sums fit the bin-capacity model without distorting the egalitarian fairness criteria, and that the required k remains independent of the specific demand values."}},"verdict_id":"660324cd-6482-4611-b5d4-430693bcfcae"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fe5b82ddc03fcd0a3613fec7312f9c262a722395bb6ff6d4263f7595a27d21c6","target":"record","created_at":"2026-05-18T03:09:12Z","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":"a0ed374508435d6976724676eb53bc3b0d489fad294422ea6c83bfe5e7fdf3f6","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-12T23:13:44Z","title_canon_sha256":"d714d0e28b1ac02a97122e0a5960360cdfe7a0a27ceeccc6bdf9a2b81c77fb0f"},"schema_version":"1.0","source":{"id":"2605.12812","kind":"arxiv","version":1}},"canonical_sha256":"1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c","first_computed_at":"2026-05-18T03:09:12.412963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.412963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4SnQysYAbNBWIIYYBn4D0HK2iTDaJ+xrJXkisxc0lUE1GSCCWZtWvLxzEqR2A2ro11OnyWFoVxmTDxOJMhmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.414156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe5b82ddc03fcd0a3613fec7312f9c262a722395bb6ff6d4263f7595a27d21c6","sha256:5140594834301024a24ad3c17b7fbca78b8b56098a31e82ca7205ffb1f9b1e1d","sha256:a466d50474bfc842f39eaf2092424a42a5428abb71f32471d238c6b84ea50da0"],"state_sha256":"01b39ee52db9f46a1549443edda467d1d30a6c4e3a2259084967904060601479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yK6T93wa32TcHyVyEnzHv26uNfZEHXQOdXL8jIfSHyJ8QH8AQz0J64e2C3TUKsRhFNoSuyOCHGcTMPUVQaAEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:38:43.358849Z","bundle_sha256":"7d812e85854e4d7fe881247e757bc150a3d68727a98a5546452b1c9bdd3e6a54"}}