{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NQRIJKV2NUGZGJNEY24UJOC25J","short_pith_number":"pith:NQRIJKV2","canonical_record":{"source":{"id":"2409.18735","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-09-27T13:27:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9eb370502fe685a8d8dd8823cf56de32e21944694926ae3096ffd09b831eace6","abstract_canon_sha256":"02e4023f31ee762f1d58cc08858ae76acba414bce65241e661ebe37bd1e81599"},"schema_version":"1.0"},"canonical_sha256":"6c2284aaba6d0d9325a4c6b944b85aea76501c499aae1c14566624bc45dd58ee","source":{"kind":"arxiv","id":"2409.18735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.18735","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"2409.18735v1","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18735","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"NQRIJKV2NUGZ","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQRIJKV2NUGZGJNE","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQRIJKV2","created_at":"2026-07-05T09:12:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NQRIJKV2NUGZGJNEY24UJOC25J","target":"record","payload":{"canonical_record":{"source":{"id":"2409.18735","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-09-27T13:27:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9eb370502fe685a8d8dd8823cf56de32e21944694926ae3096ffd09b831eace6","abstract_canon_sha256":"02e4023f31ee762f1d58cc08858ae76acba414bce65241e661ebe37bd1e81599"},"schema_version":"1.0"},"canonical_sha256":"6c2284aaba6d0d9325a4c6b944b85aea76501c499aae1c14566624bc45dd58ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:40.483798Z","signature_b64":"JU6+xDGtXoo4v+XuKET5/JGIzO4rurszGaY9mmL+JG6ePKRANhD+FEKEdKyJee1dca00pDzVQ/ti9CBqIcheCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2284aaba6d0d9325a4c6b944b85aea76501c499aae1c14566624bc45dd58ee","last_reissued_at":"2026-07-05T09:12:40.483358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:40.483358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.18735","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-05T09:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLPOZO3BoPEjdUS+a7VITo+DBMrHo2EjNLU2VF+HmoIY8bX8Kttwf2FjZqbNOndz4GfvlPxvPDuPlNlTWfgZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:25:46.697610Z"},"content_sha256":"51ab8c9f12abc6a58a73f637ea5e7e41bfbded482f4744f313afcc536d5c0451","schema_version":"1.0","event_id":"sha256:51ab8c9f12abc6a58a73f637ea5e7e41bfbded482f4744f313afcc536d5c0451"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NQRIJKV2NUGZGJNEY24UJOC25J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autoregressive Policy Optimization for Constrained Allocation Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"David Winkel, Matthias Schubert, Maximilian Bernhard, Niklas Strau{\\ss}, Thomas Seidl, Zongyue Li","submitted_at":"2024-09-27T13:27:15Z","abstract_excerpt":"Allocation tasks represent a class of problems where a limited amount of resources must be allocated to a set of entities at each time step. Prominent examples of this task include portfolio optimization or distributing computational workloads across servers. Allocation tasks are typically bound by linear constraints describing practical requirements that have to be strictly fulfilled at all times. In portfolio optimization, for example, investors may be obligated to allocate less than 30\\% of the funds into a certain industrial sector in any investment period. Such constraints restrict the ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18735","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/2409.18735/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-05T09:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjkCeu5JUrDtOkwVgG1N5P3XFOYbxYf1W2iI/jFdquyIiDwI6kuX0Qgq+57voBzvJXuJ22Z0Zl1F8piTqayqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:25:46.698159Z"},"content_sha256":"d78cd774b2753994489216e93028131ee72f0cef6125bf4df4f958b169d00d2d","schema_version":"1.0","event_id":"sha256:d78cd774b2753994489216e93028131ee72f0cef6125bf4df4f958b169d00d2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQRIJKV2NUGZGJNEY24UJOC25J/bundle.json","state_url":"https://pith.science/pith/NQRIJKV2NUGZGJNEY24UJOC25J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQRIJKV2NUGZGJNEY24UJOC25J/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-05T02:25:46Z","links":{"resolver":"https://pith.science/pith/NQRIJKV2NUGZGJNEY24UJOC25J","bundle":"https://pith.science/pith/NQRIJKV2NUGZGJNEY24UJOC25J/bundle.json","state":"https://pith.science/pith/NQRIJKV2NUGZGJNEY24UJOC25J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQRIJKV2NUGZGJNEY24UJOC25J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NQRIJKV2NUGZGJNEY24UJOC25J","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":"02e4023f31ee762f1d58cc08858ae76acba414bce65241e661ebe37bd1e81599","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-09-27T13:27:15Z","title_canon_sha256":"9eb370502fe685a8d8dd8823cf56de32e21944694926ae3096ffd09b831eace6"},"schema_version":"1.0","source":{"id":"2409.18735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.18735","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"2409.18735v1","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18735","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"NQRIJKV2NUGZ","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQRIJKV2NUGZGJNE","created_at":"2026-07-05T09:12:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQRIJKV2","created_at":"2026-07-05T09:12:40Z"}],"graph_snapshots":[{"event_id":"sha256:d78cd774b2753994489216e93028131ee72f0cef6125bf4df4f958b169d00d2d","target":"graph","created_at":"2026-07-05T09:12:40Z","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/2409.18735/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Allocation tasks represent a class of problems where a limited amount of resources must be allocated to a set of entities at each time step. Prominent examples of this task include portfolio optimization or distributing computational workloads across servers. Allocation tasks are typically bound by linear constraints describing practical requirements that have to be strictly fulfilled at all times. In portfolio optimization, for example, investors may be obligated to allocate less than 30\\% of the funds into a certain industrial sector in any investment period. Such constraints restrict the ac","authors_text":"David Winkel, Matthias Schubert, Maximilian Bernhard, Niklas Strau{\\ss}, Thomas Seidl, Zongyue Li","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-09-27T13:27:15Z","title":"Autoregressive Policy Optimization for Constrained Allocation Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18735","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:51ab8c9f12abc6a58a73f637ea5e7e41bfbded482f4744f313afcc536d5c0451","target":"record","created_at":"2026-07-05T09:12:40Z","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":"02e4023f31ee762f1d58cc08858ae76acba414bce65241e661ebe37bd1e81599","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-09-27T13:27:15Z","title_canon_sha256":"9eb370502fe685a8d8dd8823cf56de32e21944694926ae3096ffd09b831eace6"},"schema_version":"1.0","source":{"id":"2409.18735","kind":"arxiv","version":1}},"canonical_sha256":"6c2284aaba6d0d9325a4c6b944b85aea76501c499aae1c14566624bc45dd58ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c2284aaba6d0d9325a4c6b944b85aea76501c499aae1c14566624bc45dd58ee","first_computed_at":"2026-07-05T09:12:40.483358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:12:40.483358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JU6+xDGtXoo4v+XuKET5/JGIzO4rurszGaY9mmL+JG6ePKRANhD+FEKEdKyJee1dca00pDzVQ/ti9CBqIcheCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:12:40.483798Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.18735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51ab8c9f12abc6a58a73f637ea5e7e41bfbded482f4744f313afcc536d5c0451","sha256:d78cd774b2753994489216e93028131ee72f0cef6125bf4df4f958b169d00d2d"],"state_sha256":"0ffa8371f7b4df72a263de207f209ff44c15edee0b990685cf65df3a4b31d440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S37iOiyTn/FAb0V0urGflpgwi8MAa+UjVCW75WL42b9QE9j85/lqwUMuzdmw2T5aPRFmIlRlVyDJJgnVcPYqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:25:46.703209Z","bundle_sha256":"1f1ca14a913488a67917b1cd29baac7cd8055b5f6ff37cf5b732f76c1596d583"}}