{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KTTD7NJUCOKUDXKT4F7MDBUUDL","short_pith_number":"pith:KTTD7NJU","schema_version":"1.0","canonical_sha256":"54e63fb534139541dd53e17ec186941aefaa770cef8e207c3ed11be86f8b658f","source":{"kind":"arxiv","id":"1909.07326","version":1},"attestation_state":"computed","paper":{"title":"Multitype Integer Monoid Optimization and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Du\\v{s}an Knop, Martin Kouteck\\'y, Matthias Mnich, Shmuel Onn","submitted_at":"2019-09-16T16:40:11Z","abstract_excerpt":"Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems since the pioneering work of Gilmore and Gomory [Oper. Res., 1961]. Configuration IPs have a variable for each possible configuration, which describes a placement of items into a location, and whose value corresponds to the number of locations with that placement. In high multiplicity problems items come in types, and are represented succinctly by a vector of multiplicities; solving the configuration IP then amounts to deciding whether the input vector of multiplicities of items"},"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":"1909.07326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-16T16:40:11Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"62bb74ff8594d62496de6392b7c16da410ab1327170a118919ff2478ccf00a31","abstract_canon_sha256":"c0648407e48cb39b7362099d7a690fd46eb4a069f10b719e63994b7676d74c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:55.046542Z","signature_b64":"9PeqURPNqJGKzNJtkK6Xk4lnnFJC1ElU/vcyrGqRsw4NpFykcEgV+j1D2+CQXUaA3q2INL65CPPYXUfnkh0HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e63fb534139541dd53e17ec186941aefaa770cef8e207c3ed11be86f8b658f","last_reissued_at":"2026-07-05T00:04:55.046125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:55.046125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multitype Integer Monoid Optimization and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Du\\v{s}an Knop, Martin Kouteck\\'y, Matthias Mnich, Shmuel Onn","submitted_at":"2019-09-16T16:40:11Z","abstract_excerpt":"Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems since the pioneering work of Gilmore and Gomory [Oper. Res., 1961]. Configuration IPs have a variable for each possible configuration, which describes a placement of items into a location, and whose value corresponds to the number of locations with that placement. In high multiplicity problems items come in types, and are represented succinctly by a vector of multiplicities; solving the configuration IP then amounts to deciding whether the input vector of multiplicities of items"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.07326","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/1909.07326/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":"1909.07326","created_at":"2026-07-05T00:04:55.046181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.07326v1","created_at":"2026-07-05T00:04:55.046181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.07326","created_at":"2026-07-05T00:04:55.046181+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTTD7NJUCOKU","created_at":"2026-07-05T00:04:55.046181+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTTD7NJUCOKUDXKT","created_at":"2026-07-05T00:04:55.046181+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTTD7NJU","created_at":"2026-07-05T00:04:55.046181+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22212","citing_title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL","json":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL.json","graph_json":"https://pith.science/api/pith-number/KTTD7NJUCOKUDXKT4F7MDBUUDL/graph.json","events_json":"https://pith.science/api/pith-number/KTTD7NJUCOKUDXKT4F7MDBUUDL/events.json","paper":"https://pith.science/paper/KTTD7NJU"},"agent_actions":{"view_html":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL","download_json":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL.json","view_paper":"https://pith.science/paper/KTTD7NJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.07326&json=true","fetch_graph":"https://pith.science/api/pith-number/KTTD7NJUCOKUDXKT4F7MDBUUDL/graph.json","fetch_events":"https://pith.science/api/pith-number/KTTD7NJUCOKUDXKT4F7MDBUUDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL/action/storage_attestation","attest_author":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL/action/author_attestation","sign_citation":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL/action/citation_signature","submit_replication":"https://pith.science/pith/KTTD7NJUCOKUDXKT4F7MDBUUDL/action/replication_record"}},"created_at":"2026-07-05T00:04:55.046181+00:00","updated_at":"2026-07-05T00:04:55.046181+00:00"}