{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SYB4YC4IG5XOJK5FXESKZFOJDI","short_pith_number":"pith:SYB4YC4I","schema_version":"1.0","canonical_sha256":"9603cc0b88376ee4aba5b924ac95c91a17bf5574ba990daab6edb15fe52ba811","source":{"kind":"arxiv","id":"1804.06336","version":1},"attestation_state":"computed","paper":{"title":"Weak Cost Register Automata are Still Powerful","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Filip Mazowiecki, Guillermo A. P\\'erez, Micha\\\"el Cadilhac, Shaull Almagor","submitted_at":"2018-04-17T16:03:23Z","abstract_excerpt":"We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over $\\mathbb{N}$ with updates using $\\min$ and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata."},"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":"1804.06336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-17T16:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"e6e509841f20b27cf4979813e670a977d68ce69fe64888923ea3a26469afdcf1","abstract_canon_sha256":"07a94096d47bf2ca8892b7ecf7846c33924a89ed00d39db529c6eba9cc0fda87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:20.983321Z","signature_b64":"YuHKeIDDPyAOOHl4ZyKNmBmjaAnN99k1zjX8p2k5jGyQHmx8ZzS6E0SDJypHFGJjwe/4SOUKvVLPPt5DwsH/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9603cc0b88376ee4aba5b924ac95c91a17bf5574ba990daab6edb15fe52ba811","last_reissued_at":"2026-05-18T00:18:20.982678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:20.982678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Cost Register Automata are Still Powerful","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Filip Mazowiecki, Guillermo A. P\\'erez, Micha\\\"el Cadilhac, Shaull Almagor","submitted_at":"2018-04-17T16:03:23Z","abstract_excerpt":"We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over $\\mathbb{N}$ with updates using $\\min$ and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06336","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":"1804.06336","created_at":"2026-05-18T00:18:20.982746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06336v1","created_at":"2026-05-18T00:18:20.982746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06336","created_at":"2026-05-18T00:18:20.982746+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYB4YC4IG5XO","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYB4YC4IG5XOJK5F","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYB4YC4I","created_at":"2026-05-18T12:32:53.628368+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/SYB4YC4IG5XOJK5FXESKZFOJDI","json":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI.json","graph_json":"https://pith.science/api/pith-number/SYB4YC4IG5XOJK5FXESKZFOJDI/graph.json","events_json":"https://pith.science/api/pith-number/SYB4YC4IG5XOJK5FXESKZFOJDI/events.json","paper":"https://pith.science/paper/SYB4YC4I"},"agent_actions":{"view_html":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI","download_json":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI.json","view_paper":"https://pith.science/paper/SYB4YC4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06336&json=true","fetch_graph":"https://pith.science/api/pith-number/SYB4YC4IG5XOJK5FXESKZFOJDI/graph.json","fetch_events":"https://pith.science/api/pith-number/SYB4YC4IG5XOJK5FXESKZFOJDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI/action/storage_attestation","attest_author":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI/action/author_attestation","sign_citation":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI/action/citation_signature","submit_replication":"https://pith.science/pith/SYB4YC4IG5XOJK5FXESKZFOJDI/action/replication_record"}},"created_at":"2026-05-18T00:18:20.982746+00:00","updated_at":"2026-05-18T00:18:20.982746+00:00"}