{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GF3OTUTCERXFEQXT3FBP2GRBVY","short_pith_number":"pith:GF3OTUTC","canonical_record":{"source":{"id":"2410.17500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-23T01:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"826dc46dcb75c9c6fb729caef46c0472db5fef9f04b7a09db77fe43a2f423c9c","abstract_canon_sha256":"8ee27beabae3bc99498528e3c8c5c405820a2703efb1fa07ee6bd0c9d0fc49b7"},"schema_version":"1.0"},"canonical_sha256":"3176e9d262246e5242f3d942fd1a21ae05719367c436cc63b9c73fa77b641722","source":{"kind":"arxiv","id":"2410.17500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.17500","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2410.17500v2","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17500","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"GF3OTUTCERXF","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"GF3OTUTCERXFEQXT","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"GF3OTUTC","created_at":"2026-07-05T11:01:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GF3OTUTCERXFEQXT3FBP2GRBVY","target":"record","payload":{"canonical_record":{"source":{"id":"2410.17500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-23T01:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"826dc46dcb75c9c6fb729caef46c0472db5fef9f04b7a09db77fe43a2f423c9c","abstract_canon_sha256":"8ee27beabae3bc99498528e3c8c5c405820a2703efb1fa07ee6bd0c9d0fc49b7"},"schema_version":"1.0"},"canonical_sha256":"3176e9d262246e5242f3d942fd1a21ae05719367c436cc63b9c73fa77b641722","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:27.864014Z","signature_b64":"WAmMecx4BszGWA5BGurDS1m3avZQvk9ZhYQSVVO8qFgwLjhBC7eggFwipY3UAO38qmEVtPgnAcDfIAnkuGdUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3176e9d262246e5242f3d942fd1a21ae05719367c436cc63b9c73fa77b641722","last_reissued_at":"2026-07-05T11:01:27.863518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:27.863518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.17500","source_version":2,"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:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEiQDvAV6Z/2+27IXShV46i47U78omDhIE8+AnncS8Z+W/ej2W3+0hFygNhBTfFkAVx2Pg8jbwJMPkMwgjRlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:00:23.178589Z"},"content_sha256":"33256914f3fbf4bd87457d02c54690a57b61594a2a0448f5eb5cee0b8ac89184","schema_version":"1.0","event_id":"sha256:33256914f3fbf4bd87457d02c54690a57b61594a2a0448f5eb5cee0b8ac89184"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GF3OTUTCERXFEQXT3FBP2GRBVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Fair and Preferable Allocations through Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hisashi Kashima, Koh Takeuchi, Ryota Maruo","submitted_at":"2024-10-23T01:47:55Z","abstract_excerpt":"The fair allocation of indivisible resources is a fundamental problem. Existing research has developed various allocation mechanisms or algorithms to satisfy different fairness notions. For example, round robin (RR) was proposed to meet the fairness criterion known as envy-freeness up to one good (EF1). Expert algorithms without mathematical formulations are used in real-world resource allocation problems to find preferable outcomes for users. Therefore, we aim to design mechanisms that strictly satisfy good properties with replicating expert knowledge. However, this problem is challenging bec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17500","kind":"arxiv","version":2},"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/2410.17500/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:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UmMDMMNt2ylC5/fNPTWZisAgbAQrn9Z9pbrm5Qo5RWwHGY392NY4eYmGXNGJhTOnhKVgrn+EgtZdKrieNuzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:00:23.178966Z"},"content_sha256":"780edef4e5327d36523050644fca19d8480ee7bfa7c7fe7f49443be2dfd3d777","schema_version":"1.0","event_id":"sha256:780edef4e5327d36523050644fca19d8480ee7bfa7c7fe7f49443be2dfd3d777"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/bundle.json","state_url":"https://pith.science/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/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-09T05:00:23Z","links":{"resolver":"https://pith.science/pith/GF3OTUTCERXFEQXT3FBP2GRBVY","bundle":"https://pith.science/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/bundle.json","state":"https://pith.science/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GF3OTUTCERXFEQXT3FBP2GRBVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GF3OTUTCERXFEQXT3FBP2GRBVY","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":"8ee27beabae3bc99498528e3c8c5c405820a2703efb1fa07ee6bd0c9d0fc49b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-23T01:47:55Z","title_canon_sha256":"826dc46dcb75c9c6fb729caef46c0472db5fef9f04b7a09db77fe43a2f423c9c"},"schema_version":"1.0","source":{"id":"2410.17500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.17500","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2410.17500v2","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17500","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"GF3OTUTCERXF","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"GF3OTUTCERXFEQXT","created_at":"2026-07-05T11:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"GF3OTUTC","created_at":"2026-07-05T11:01:27Z"}],"graph_snapshots":[{"event_id":"sha256:780edef4e5327d36523050644fca19d8480ee7bfa7c7fe7f49443be2dfd3d777","target":"graph","created_at":"2026-07-05T11:01: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/2410.17500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The fair allocation of indivisible resources is a fundamental problem. Existing research has developed various allocation mechanisms or algorithms to satisfy different fairness notions. For example, round robin (RR) was proposed to meet the fairness criterion known as envy-freeness up to one good (EF1). Expert algorithms without mathematical formulations are used in real-world resource allocation problems to find preferable outcomes for users. Therefore, we aim to design mechanisms that strictly satisfy good properties with replicating expert knowledge. However, this problem is challenging bec","authors_text":"Hisashi Kashima, Koh Takeuchi, Ryota Maruo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-23T01:47:55Z","title":"Learning Fair and Preferable Allocations through Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17500","kind":"arxiv","version":2},"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:33256914f3fbf4bd87457d02c54690a57b61594a2a0448f5eb5cee0b8ac89184","target":"record","created_at":"2026-07-05T11:01: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":"8ee27beabae3bc99498528e3c8c5c405820a2703efb1fa07ee6bd0c9d0fc49b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-23T01:47:55Z","title_canon_sha256":"826dc46dcb75c9c6fb729caef46c0472db5fef9f04b7a09db77fe43a2f423c9c"},"schema_version":"1.0","source":{"id":"2410.17500","kind":"arxiv","version":2}},"canonical_sha256":"3176e9d262246e5242f3d942fd1a21ae05719367c436cc63b9c73fa77b641722","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3176e9d262246e5242f3d942fd1a21ae05719367c436cc63b9c73fa77b641722","first_computed_at":"2026-07-05T11:01:27.863518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:27.863518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAmMecx4BszGWA5BGurDS1m3avZQvk9ZhYQSVVO8qFgwLjhBC7eggFwipY3UAO38qmEVtPgnAcDfIAnkuGdUCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:27.864014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.17500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33256914f3fbf4bd87457d02c54690a57b61594a2a0448f5eb5cee0b8ac89184","sha256:780edef4e5327d36523050644fca19d8480ee7bfa7c7fe7f49443be2dfd3d777"],"state_sha256":"e6392e8782ef9295567c90d4f16eb0c94552002c07b001a7b5702f071afb0d54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fmZWxFczGmxZY+1Y5jAltOnk2S9FGgobN4XwLTgj4cvyhIM1hO5LYmr/XEbL8g8d45Cilzhz1z41xYvuclWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:00:23.181015Z","bundle_sha256":"7c1937078cd9c79fb316049c9e4f3127be7a97eee2e1efaeb6720443837e785f"}}