{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D64GWCBMIFDG6UQBBZSDECCXXG","short_pith_number":"pith:D64GWCBM","canonical_record":{"source":{"id":"1404.3349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-04-13T06:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"56926502fd0cd7feacf3890cabe411715bda1211551faee6a472505bb39aa64a","abstract_canon_sha256":"c96869ed1af35544c8aa671fea2954c018a231072bb73738f1eb623fb111bdc5"},"schema_version":"1.0"},"canonical_sha256":"1fb86b082c41466f52010e64320857b9ad4058a598fac27f69b8311d951f0949","source":{"kind":"arxiv","id":"1404.3349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3349","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3349v2","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3349","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"D64GWCBMIFDG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D64GWCBMIFDG6UQB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D64GWCBM","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D64GWCBMIFDG6UQBBZSDECCXXG","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-04-13T06:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"56926502fd0cd7feacf3890cabe411715bda1211551faee6a472505bb39aa64a","abstract_canon_sha256":"c96869ed1af35544c8aa671fea2954c018a231072bb73738f1eb623fb111bdc5"},"schema_version":"1.0"},"canonical_sha256":"1fb86b082c41466f52010e64320857b9ad4058a598fac27f69b8311d951f0949","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:33.021634Z","signature_b64":"MhBZ0DGtUPi2bZXXQLnOHUMM3BYXSk6vXKNZHnojSiguAhJP/7rIQWtTvcufUvkKayo01Sks8RbVylPK/CqHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb86b082c41466f52010e64320857b9ad4058a598fac27f69b8311d951f0949","last_reissued_at":"2026-05-18T02:51:33.020995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:33.020995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3349","source_version":2,"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-05-18T02:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4wMuX1eqP7DAfEzM14id3Yy2znroDrQ5Mvrjvzavo0+sUHl/eeFSGQ4xP87te2JApSFD9L4fknaj5F2du42Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:25:30.286282Z"},"content_sha256":"92fb4c943a2045c9abee1b8810a4b4de6020c86a8afa2b746bfd90d929df9860","schema_version":"1.0","event_id":"sha256:92fb4c943a2045c9abee1b8810a4b4de6020c86a8afa2b746bfd90d929df9860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D64GWCBMIFDG6UQBBZSDECCXXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computer Simulation Codes for the Quine-McCluskey Method of Logic Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Sourangsu Banerji","submitted_at":"2014-04-13T06:58:49Z","abstract_excerpt":"The Quine-McCluskey method is useful in minimizing logic expressions for larger number of variables when compared with minimization by Karnaugh Map or Boolean algebra. In this paper, we have tried to put together all of the computer codes which are available on the internet, edited and modified them as well as rewritten some parts of those collected codes our self, which are used in the implementation of the Quine- McCluskey method. A brief introduction and the logic of this method are discussed following which the codes have been provided. The Quine-McCluskey Method has been implemented using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3349","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"},"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-05-18T02:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78ySAO5Oh9vAsf4MHfaOCoCKSZqWziegC8xyd0Dio+jrmcn4eWY55bL9cJmjTQHEAGwvIAC94FwaxOFrGyKfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:25:30.286745Z"},"content_sha256":"c36f6bccf0912afa48befa3ad11b8d70842a52140b8418def840f97bf0b3b983","schema_version":"1.0","event_id":"sha256:c36f6bccf0912afa48befa3ad11b8d70842a52140b8418def840f97bf0b3b983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D64GWCBMIFDG6UQBBZSDECCXXG/bundle.json","state_url":"https://pith.science/pith/D64GWCBMIFDG6UQBBZSDECCXXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D64GWCBMIFDG6UQBBZSDECCXXG/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-05T02:25:30Z","links":{"resolver":"https://pith.science/pith/D64GWCBMIFDG6UQBBZSDECCXXG","bundle":"https://pith.science/pith/D64GWCBMIFDG6UQBBZSDECCXXG/bundle.json","state":"https://pith.science/pith/D64GWCBMIFDG6UQBBZSDECCXXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D64GWCBMIFDG6UQBBZSDECCXXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D64GWCBMIFDG6UQBBZSDECCXXG","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":"c96869ed1af35544c8aa671fea2954c018a231072bb73738f1eb623fb111bdc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-04-13T06:58:49Z","title_canon_sha256":"56926502fd0cd7feacf3890cabe411715bda1211551faee6a472505bb39aa64a"},"schema_version":"1.0","source":{"id":"1404.3349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3349","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3349v2","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3349","created_at":"2026-05-18T02:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"D64GWCBMIFDG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D64GWCBMIFDG6UQB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D64GWCBM","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:c36f6bccf0912afa48befa3ad11b8d70842a52140b8418def840f97bf0b3b983","target":"graph","created_at":"2026-05-18T02:51:33Z","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"},"paper":{"abstract_excerpt":"The Quine-McCluskey method is useful in minimizing logic expressions for larger number of variables when compared with minimization by Karnaugh Map or Boolean algebra. In this paper, we have tried to put together all of the computer codes which are available on the internet, edited and modified them as well as rewritten some parts of those collected codes our self, which are used in the implementation of the Quine- McCluskey method. A brief introduction and the logic of this method are discussed following which the codes have been provided. The Quine-McCluskey Method has been implemented using","authors_text":"Sourangsu Banerji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-04-13T06:58:49Z","title":"Computer Simulation Codes for the Quine-McCluskey Method of Logic Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3349","kind":"arxiv","version":2},"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:92fb4c943a2045c9abee1b8810a4b4de6020c86a8afa2b746bfd90d929df9860","target":"record","created_at":"2026-05-18T02:51:33Z","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":"c96869ed1af35544c8aa671fea2954c018a231072bb73738f1eb623fb111bdc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-04-13T06:58:49Z","title_canon_sha256":"56926502fd0cd7feacf3890cabe411715bda1211551faee6a472505bb39aa64a"},"schema_version":"1.0","source":{"id":"1404.3349","kind":"arxiv","version":2}},"canonical_sha256":"1fb86b082c41466f52010e64320857b9ad4058a598fac27f69b8311d951f0949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fb86b082c41466f52010e64320857b9ad4058a598fac27f69b8311d951f0949","first_computed_at":"2026-05-18T02:51:33.020995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:33.020995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhBZ0DGtUPi2bZXXQLnOHUMM3BYXSk6vXKNZHnojSiguAhJP/7rIQWtTvcufUvkKayo01Sks8RbVylPK/CqHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:33.021634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92fb4c943a2045c9abee1b8810a4b4de6020c86a8afa2b746bfd90d929df9860","sha256:c36f6bccf0912afa48befa3ad11b8d70842a52140b8418def840f97bf0b3b983"],"state_sha256":"6fc9758653752260fbdd294601c2ec21f4eba7f7b65b7d8508b52dfc7df41ebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xk/joKcpja+3ptpITg4bL712nMxdaee+z4a3HYy7ZKM2uhUHoL5Bw4Of4K62pGXlcHVZKy/n8vftvBpAMq9LCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:25:30.290566Z","bundle_sha256":"c80c66b4231ddc83b49f4d999dd5df29646e3635ffae7b3e6492d2677a270f87"}}