{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7KFWER3X446QRMWDLHYYYXTOIK","short_pith_number":"pith:7KFWER3X","schema_version":"1.0","canonical_sha256":"fa8b624777e73d08b2c359f18c5e6e42921a085337ed3d48627fa28525c5ed14","source":{"kind":"arxiv","id":"1809.05058","version":1},"attestation_state":"computed","paper":{"title":"Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Becker, Nicolas Ginoux, Sebastien Martin, Zsuzsanna Roka","submitted_at":"2018-09-05T07:51:14Z","abstract_excerpt":"We present a Mixed Integer Linear Program (MILP) approach in order to model the nonlinear problem of minimizing the tire noise. We first take more industrial constraints into account than in a former work of the authors. Then, we associate a Branch-and-Cut algorithm to the MILP to obtain exact solutions. We compare our experimental results with those obtained by other methods."},"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":"1809.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-05T07:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"ab2a9b5b639ae67f1285f120b493bdb775afb4f1b444a5c8fccb3ae9ba5e838c","abstract_canon_sha256":"6273dd9c71ef6643905a5b36f6610c34604a6bac820ec0eee840483025cdcfce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.742075Z","signature_b64":"HqIsJWDffeoGYEQ+nxN/j5DGeR6OCN1Dot74AXDxYKb2VgFEbNajeE+4zGRgnX2uWK4BWbU3fTkCipgOdJpqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa8b624777e73d08b2c359f18c5e6e42921a085337ed3d48627fa28525c5ed14","last_reissued_at":"2026-05-18T00:05:46.741264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.741264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Becker, Nicolas Ginoux, Sebastien Martin, Zsuzsanna Roka","submitted_at":"2018-09-05T07:51:14Z","abstract_excerpt":"We present a Mixed Integer Linear Program (MILP) approach in order to model the nonlinear problem of minimizing the tire noise. We first take more industrial constraints into account than in a former work of the authors. Then, we associate a Branch-and-Cut algorithm to the MILP to obtain exact solutions. We compare our experimental results with those obtained by other methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05058","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":""},"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":"1809.05058","created_at":"2026-05-18T00:05:46.741416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05058v1","created_at":"2026-05-18T00:05:46.741416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05058","created_at":"2026-05-18T00:05:46.741416+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KFWER3X446Q","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KFWER3X446QRMWD","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KFWER3X","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK","json":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK.json","graph_json":"https://pith.science/api/pith-number/7KFWER3X446QRMWDLHYYYXTOIK/graph.json","events_json":"https://pith.science/api/pith-number/7KFWER3X446QRMWDLHYYYXTOIK/events.json","paper":"https://pith.science/paper/7KFWER3X"},"agent_actions":{"view_html":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK","download_json":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK.json","view_paper":"https://pith.science/paper/7KFWER3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/7KFWER3X446QRMWDLHYYYXTOIK/graph.json","fetch_events":"https://pith.science/api/pith-number/7KFWER3X446QRMWDLHYYYXTOIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK/action/storage_attestation","attest_author":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK/action/author_attestation","sign_citation":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK/action/citation_signature","submit_replication":"https://pith.science/pith/7KFWER3X446QRMWDLHYYYXTOIK/action/replication_record"}},"created_at":"2026-05-18T00:05:46.741416+00:00","updated_at":"2026-05-18T00:05:46.741416+00:00"}