{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5MQ4YUWVOVIKXOP3J56AP7DUAJ","short_pith_number":"pith:5MQ4YUWV","canonical_record":{"source":{"id":"2211.08381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-15T18:27:15Z","cross_cats_sorted":[],"title_canon_sha256":"c8eb7f2119e3b069f0f0a63e54e9541851c3028c37762eb786d567b7785654bf","abstract_canon_sha256":"dacab309869d51ccb67c0cdf2542bcffc5698cc1fbf7340c724e5b2d24387378"},"schema_version":"1.0"},"canonical_sha256":"eb21cc52d57550abb9fb4f7c07fc74025979dc905b31a209aaf35472aecddda3","source":{"kind":"arxiv","id":"2211.08381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.08381","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"2211.08381v1","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.08381","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"5MQ4YUWVOVIK","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_16","alias_value":"5MQ4YUWVOVIKXOP3","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_8","alias_value":"5MQ4YUWV","created_at":"2026-07-05T05:16:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5MQ4YUWVOVIKXOP3J56AP7DUAJ","target":"record","payload":{"canonical_record":{"source":{"id":"2211.08381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-15T18:27:15Z","cross_cats_sorted":[],"title_canon_sha256":"c8eb7f2119e3b069f0f0a63e54e9541851c3028c37762eb786d567b7785654bf","abstract_canon_sha256":"dacab309869d51ccb67c0cdf2542bcffc5698cc1fbf7340c724e5b2d24387378"},"schema_version":"1.0"},"canonical_sha256":"eb21cc52d57550abb9fb4f7c07fc74025979dc905b31a209aaf35472aecddda3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:28.621457Z","signature_b64":"LcuVlsQxlycqHFy9WC1cUb0Mt3LXwPdEfneiW/tofDUSC7WFOC4DHdHU8F2mvBaqvO5rY7PpBczeTFPL1czuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb21cc52d57550abb9fb4f7c07fc74025979dc905b31a209aaf35472aecddda3","last_reissued_at":"2026-07-05T05:16:28.621061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:28.621061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.08381","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-05T05:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VH6yA6UP5XQxosSi0L4zeQ2OceP3Ml8lTj7ZBmUkpK+5AfpwKmkJXzFcWYcx8Z4iYrO7tk/UESJGLY/hKFNtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T06:28:47.611943Z"},"content_sha256":"cd36d8a5d83d2713e6266a80b520299aa0f7c576c8c89616ad54b1f0b67cc6b3","schema_version":"1.0","event_id":"sha256:cd36d8a5d83d2713e6266a80b520299aa0f7c576c8c89616ad54b1f0b67cc6b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5MQ4YUWVOVIKXOP3J56AP7DUAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Polymatroid Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Samadian, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Sungjin Im","submitted_at":"2022-11-15T18:27:15Z","abstract_excerpt":"We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming technique, based on duality and projections, can be used to rederive some structural results that were previously established using more ad hoc methods. We then show that this technique can be used to obtain a polynomial-time algorithm for a certain type of simple difference constraints. Finally we give lower bound results that show that certain possible extensions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.08381","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/2211.08381/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-05T05:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EnzamDPwuEOC70CDbhnkH3avrr4TjfKFwg5DstHRIoi08Q2Ysx3hu9tY6fz95b+zIBWfhkhzImpOHO5l5EVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T06:28:47.612473Z"},"content_sha256":"55acddd4c1f8520f7477c977d6768d9c96701f77d83897bd1cf6f137b80d21af","schema_version":"1.0","event_id":"sha256:55acddd4c1f8520f7477c977d6768d9c96701f77d83897bd1cf6f137b80d21af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/bundle.json","state_url":"https://pith.science/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/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-10T06:28:47Z","links":{"resolver":"https://pith.science/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ","bundle":"https://pith.science/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/bundle.json","state":"https://pith.science/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MQ4YUWVOVIKXOP3J56AP7DUAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5MQ4YUWVOVIKXOP3J56AP7DUAJ","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":"dacab309869d51ccb67c0cdf2542bcffc5698cc1fbf7340c724e5b2d24387378","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-15T18:27:15Z","title_canon_sha256":"c8eb7f2119e3b069f0f0a63e54e9541851c3028c37762eb786d567b7785654bf"},"schema_version":"1.0","source":{"id":"2211.08381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.08381","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"2211.08381v1","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.08381","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"5MQ4YUWVOVIK","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_16","alias_value":"5MQ4YUWVOVIKXOP3","created_at":"2026-07-05T05:16:28Z"},{"alias_kind":"pith_short_8","alias_value":"5MQ4YUWV","created_at":"2026-07-05T05:16:28Z"}],"graph_snapshots":[{"event_id":"sha256:55acddd4c1f8520f7477c977d6768d9c96701f77d83897bd1cf6f137b80d21af","target":"graph","created_at":"2026-07-05T05:16:28Z","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/2211.08381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming technique, based on duality and projections, can be used to rederive some structural results that were previously established using more ad hoc methods. We then show that this technique can be used to obtain a polynomial-time algorithm for a certain type of simple difference constraints. Finally we give lower bound results that show that certain possible extensions","authors_text":"Alireza Samadian, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-15T18:27:15Z","title":"Optimizing Polymatroid Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.08381","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:cd36d8a5d83d2713e6266a80b520299aa0f7c576c8c89616ad54b1f0b67cc6b3","target":"record","created_at":"2026-07-05T05:16:28Z","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":"dacab309869d51ccb67c0cdf2542bcffc5698cc1fbf7340c724e5b2d24387378","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-15T18:27:15Z","title_canon_sha256":"c8eb7f2119e3b069f0f0a63e54e9541851c3028c37762eb786d567b7785654bf"},"schema_version":"1.0","source":{"id":"2211.08381","kind":"arxiv","version":1}},"canonical_sha256":"eb21cc52d57550abb9fb4f7c07fc74025979dc905b31a209aaf35472aecddda3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb21cc52d57550abb9fb4f7c07fc74025979dc905b31a209aaf35472aecddda3","first_computed_at":"2026-07-05T05:16:28.621061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:28.621061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LcuVlsQxlycqHFy9WC1cUb0Mt3LXwPdEfneiW/tofDUSC7WFOC4DHdHU8F2mvBaqvO5rY7PpBczeTFPL1czuAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:28.621457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.08381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd36d8a5d83d2713e6266a80b520299aa0f7c576c8c89616ad54b1f0b67cc6b3","sha256:55acddd4c1f8520f7477c977d6768d9c96701f77d83897bd1cf6f137b80d21af"],"state_sha256":"18994590755d482a2e54144b84bbd1d4861672e1d11ac008664b2ac088ab4b88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/D29Pw7U+x0TkBgj/bjWT3zZNqbBsb/BoitmSN4J8uKepEtiznOicDxIzscs/L2yLe6Opx1yYBazEdGrVlwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T06:28:47.617318Z","bundle_sha256":"7d7044f5c0aec77816960c039e90f9e7017d8cf379c82c327d21b9fb89c74a19"}}