{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SQODSCMDGODFAWNRHQOYM75CYI","short_pith_number":"pith:SQODSCMD","schema_version":"1.0","canonical_sha256":"941c39098333865059b13c1d867fa2c2349cd1440ed4b9d5aad371079732a431","source":{"kind":"arxiv","id":"1104.3119","version":2},"attestation_state":"computed","paper":{"title":"Parallel Recursive State Compression for Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfons Laarman, Jaco van de Pol, Michael Weber","submitted_at":"2011-04-15T17:59:12Z","abstract_excerpt":"This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors.\n  An algorithmic analysis of both worst-case and optimal compression ratios shows the potential to compress even large states to a small constant on average (8 bytes). Our experiments demonstrate that this holds up in practice: the median compression ratio of 279 measured experiments is within 17% of the optimum for tree compre"},"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":"1104.3119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T17:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"8f24be284d824d1ebd8ffe82ed9704d34341eeb71073fa8146a89e83a7866f60","abstract_canon_sha256":"14ef13e708d810908effb675973c7c9e70faa3c0aa9a4366f54fdc2239df9259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:02.045210Z","signature_b64":"KDi3HoXHicGwwPgku+ybxdGYM4YGpNAeSw3i9bb0wvbnYG8GnpxMJTqs7vCQdVwsyS6NNVVEipxUGNJbbPfnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"941c39098333865059b13c1d867fa2c2349cd1440ed4b9d5aad371079732a431","last_reissued_at":"2026-05-18T04:22:02.044740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:02.044740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Recursive State Compression for Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfons Laarman, Jaco van de Pol, Michael Weber","submitted_at":"2011-04-15T17:59:12Z","abstract_excerpt":"This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors.\n  An algorithmic analysis of both worst-case and optimal compression ratios shows the potential to compress even large states to a small constant on average (8 bytes). Our experiments demonstrate that this holds up in practice: the median compression ratio of 279 measured experiments is within 17% of the optimum for tree compre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3119","kind":"arxiv","version":2},"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":"1104.3119","created_at":"2026-05-18T04:22:02.044817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3119v2","created_at":"2026-05-18T04:22:02.044817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3119","created_at":"2026-05-18T04:22:02.044817+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQODSCMDGODF","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQODSCMDGODFAWNR","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQODSCMD","created_at":"2026-05-18T12:26:41.206345+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/SQODSCMDGODFAWNRHQOYM75CYI","json":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI.json","graph_json":"https://pith.science/api/pith-number/SQODSCMDGODFAWNRHQOYM75CYI/graph.json","events_json":"https://pith.science/api/pith-number/SQODSCMDGODFAWNRHQOYM75CYI/events.json","paper":"https://pith.science/paper/SQODSCMD"},"agent_actions":{"view_html":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI","download_json":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI.json","view_paper":"https://pith.science/paper/SQODSCMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3119&json=true","fetch_graph":"https://pith.science/api/pith-number/SQODSCMDGODFAWNRHQOYM75CYI/graph.json","fetch_events":"https://pith.science/api/pith-number/SQODSCMDGODFAWNRHQOYM75CYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI/action/storage_attestation","attest_author":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI/action/author_attestation","sign_citation":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI/action/citation_signature","submit_replication":"https://pith.science/pith/SQODSCMDGODFAWNRHQOYM75CYI/action/replication_record"}},"created_at":"2026-05-18T04:22:02.044817+00:00","updated_at":"2026-05-18T04:22:02.044817+00:00"}