{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4FSVJFWJLBTLGEEZERLLKBF72W","short_pith_number":"pith:4FSVJFWJ","canonical_record":{"source":{"id":"2410.22764","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-30T07:30:22Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d8bd4ae33d1e3a9abf02aa5f2d73bc77e09aa5c71d9c498b44d2199718dcb7fa","abstract_canon_sha256":"29194d6c4322e266559e99790d5efbade59e08085530e4c40ad2106a33422d8c"},"schema_version":"1.0"},"canonical_sha256":"e1655496c95866b310992456b504bfd5bd92a7158cb978967ab725b769eda098","source":{"kind":"arxiv","id":"2410.22764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22764","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22764v1","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22764","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"4FSVJFWJLBTL","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_16","alias_value":"4FSVJFWJLBTLGEEZ","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_8","alias_value":"4FSVJFWJ","created_at":"2026-07-05T09:28:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4FSVJFWJLBTLGEEZERLLKBF72W","target":"record","payload":{"canonical_record":{"source":{"id":"2410.22764","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-30T07:30:22Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d8bd4ae33d1e3a9abf02aa5f2d73bc77e09aa5c71d9c498b44d2199718dcb7fa","abstract_canon_sha256":"29194d6c4322e266559e99790d5efbade59e08085530e4c40ad2106a33422d8c"},"schema_version":"1.0"},"canonical_sha256":"e1655496c95866b310992456b504bfd5bd92a7158cb978967ab725b769eda098","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:21.456637Z","signature_b64":"mzWyzWwMNeHK2uk9pY8roiw6zOG2VkkZAFy9sgHA/mJf3oGIuBy7fwo4ucq1JbCRGk7zp1PNl0BG8igbfpbmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1655496c95866b310992456b504bfd5bd92a7158cb978967ab725b769eda098","last_reissued_at":"2026-07-05T09:28:21.456128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:21.456128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.22764","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-05T09:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecbNuF3ZJJ9P6Lt3A02z5FNrNOUwJao1pN+0B5zXfHbWN2RU05YmbPIu+wF6adMatFperISqRzZDkbBpjM+TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:07:50.955990Z"},"content_sha256":"5df33401165ec0953164a54cf2882d8b94265f681812d51d629d9a1246884287","schema_version":"1.0","event_id":"sha256:5df33401165ec0953164a54cf2882d8b94265f681812d51d629d9a1246884287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4FSVJFWJLBTLGEEZERLLKBF72W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Evaluation of Massively Parallel Algorithms for DFA Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Anton Wijs, Jan Martens","submitted_at":"2024-10-30T07:30:22Z","abstract_excerpt":"We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms on Graphics Processing Units (GPUs). Our results confirm the expectations that the algorithm with the theoretically best time complexity is not practically suitable to run on GPUs due to the large amount of resources needed. We empirically verify that parallel partition refinement algorithms from the literature perform better in practice, even though their time complexity is worse. Lastly, we introduce a novel algorithm based on par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22764","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/2410.22764/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-05T09:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8dHp7zftIDiVnb2rT5UZUJX/p5LhRMUvMq15Fkc8BHLQlsX6whfdIj6De1agNMaDesIB4QwUzOSsRwtvIdtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:07:50.956484Z"},"content_sha256":"59a02a2b2231478c095e0b942c62a78aa8902ac84f4a0bc802586c487eaff517","schema_version":"1.0","event_id":"sha256:59a02a2b2231478c095e0b942c62a78aa8902ac84f4a0bc802586c487eaff517"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FSVJFWJLBTLGEEZERLLKBF72W/bundle.json","state_url":"https://pith.science/pith/4FSVJFWJLBTLGEEZERLLKBF72W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FSVJFWJLBTLGEEZERLLKBF72W/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-09T04:07:50Z","links":{"resolver":"https://pith.science/pith/4FSVJFWJLBTLGEEZERLLKBF72W","bundle":"https://pith.science/pith/4FSVJFWJLBTLGEEZERLLKBF72W/bundle.json","state":"https://pith.science/pith/4FSVJFWJLBTLGEEZERLLKBF72W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FSVJFWJLBTLGEEZERLLKBF72W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4FSVJFWJLBTLGEEZERLLKBF72W","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":"29194d6c4322e266559e99790d5efbade59e08085530e4c40ad2106a33422d8c","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-30T07:30:22Z","title_canon_sha256":"d8bd4ae33d1e3a9abf02aa5f2d73bc77e09aa5c71d9c498b44d2199718dcb7fa"},"schema_version":"1.0","source":{"id":"2410.22764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22764","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22764v1","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22764","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"4FSVJFWJLBTL","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_16","alias_value":"4FSVJFWJLBTLGEEZ","created_at":"2026-07-05T09:28:21Z"},{"alias_kind":"pith_short_8","alias_value":"4FSVJFWJ","created_at":"2026-07-05T09:28:21Z"}],"graph_snapshots":[{"event_id":"sha256:59a02a2b2231478c095e0b942c62a78aa8902ac84f4a0bc802586c487eaff517","target":"graph","created_at":"2026-07-05T09:28:21Z","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/2410.22764/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms on Graphics Processing Units (GPUs). Our results confirm the expectations that the algorithm with the theoretically best time complexity is not practically suitable to run on GPUs due to the large amount of resources needed. We empirically verify that parallel partition refinement algorithms from the literature perform better in practice, even though their time complexity is worse. Lastly, we introduce a novel algorithm based on par","authors_text":"Anton Wijs, Jan Martens","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-30T07:30:22Z","title":"An Evaluation of Massively Parallel Algorithms for DFA Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22764","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:5df33401165ec0953164a54cf2882d8b94265f681812d51d629d9a1246884287","target":"record","created_at":"2026-07-05T09:28:21Z","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":"29194d6c4322e266559e99790d5efbade59e08085530e4c40ad2106a33422d8c","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-30T07:30:22Z","title_canon_sha256":"d8bd4ae33d1e3a9abf02aa5f2d73bc77e09aa5c71d9c498b44d2199718dcb7fa"},"schema_version":"1.0","source":{"id":"2410.22764","kind":"arxiv","version":1}},"canonical_sha256":"e1655496c95866b310992456b504bfd5bd92a7158cb978967ab725b769eda098","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1655496c95866b310992456b504bfd5bd92a7158cb978967ab725b769eda098","first_computed_at":"2026-07-05T09:28:21.456128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:21.456128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mzWyzWwMNeHK2uk9pY8roiw6zOG2VkkZAFy9sgHA/mJf3oGIuBy7fwo4ucq1JbCRGk7zp1PNl0BG8igbfpbmDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:21.456637Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.22764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df33401165ec0953164a54cf2882d8b94265f681812d51d629d9a1246884287","sha256:59a02a2b2231478c095e0b942c62a78aa8902ac84f4a0bc802586c487eaff517"],"state_sha256":"2e7ca590e5d6b546f04ab11a1252eea9b1b76dcc1dbdb33f860fdd0b8c778d51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNST/QB7LNTMROK+gotBsaq4h/ayRQ9eCKbJ77cdT6e/cKfkei2EFy8GopIRB30x95WvpFMG4kOlf0GtpjsiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:07:50.960462Z","bundle_sha256":"6dbd3a5d147173b4a5b241386a8579176727d6d8f757faacfe169d5fbc032e94"}}