{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V6H5EEE4SFFVID434VFGZW24ZW","short_pith_number":"pith:V6H5EEE4","canonical_record":{"source":{"id":"1112.6072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T07:13:18Z","cross_cats_sorted":["math.CO","physics.chem-ph"],"title_canon_sha256":"eecd702b417bd1a2330ec35c17dd787d7b43b8ab7036bb41165c58d2c20c0e14","abstract_canon_sha256":"a7d0a51f3769437d0648a538e534e9a846d31cdbf521f83f8e4183745973ce9a"},"schema_version":"1.0"},"canonical_sha256":"af8fd2109c914b540f9be54a6cdb5ccd83d04d0c9a8e7ca15b90bfb2b72b8928","source":{"kind":"arxiv","id":"1112.6072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6072","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6072v2","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6072","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"V6H5EEE4SFFV","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V6H5EEE4SFFVID43","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V6H5EEE4","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V6H5EEE4SFFVID434VFGZW24ZW","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T07:13:18Z","cross_cats_sorted":["math.CO","physics.chem-ph"],"title_canon_sha256":"eecd702b417bd1a2330ec35c17dd787d7b43b8ab7036bb41165c58d2c20c0e14","abstract_canon_sha256":"a7d0a51f3769437d0648a538e534e9a846d31cdbf521f83f8e4183745973ce9a"},"schema_version":"1.0"},"canonical_sha256":"af8fd2109c914b540f9be54a6cdb5ccd83d04d0c9a8e7ca15b90bfb2b72b8928","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:24.847538Z","signature_b64":"5d1HYEUcLy5FK/LLFpu1fSz59JITYNMNrErggtfbvlLMssl1X0rS/qPwYQKq7AStlqfAPmiaJX1vNfJedd38Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af8fd2109c914b540f9be54a6cdb5ccd83d04d0c9a8e7ca15b90bfb2b72b8928","last_reissued_at":"2026-05-18T04:02:24.847018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:24.847018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6072","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-18T04:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHE2fexJXxmSJiTgqmTMqv+a/+7gIDe7sHjQ2KZV5iwtd2zCPF62pWG+vjkXYy4BVVKLzWStjub4uVBxhbOwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:47:48.756141Z"},"content_sha256":"0971257be32b59caf50455782225d47173adde9d1d1f9460d8cf547f36689c74","schema_version":"1.0","event_id":"sha256:0971257be32b59caf50455782225d47173adde9d1d1f9460d8cf547f36689c74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V6H5EEE4SFFVID434VFGZW24ZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A load balancing strategy for parallel computation of sparse permanents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","physics.chem-ph"],"primary_cat":"math.NA","authors_text":"Fengshan Bai, Heng Liang, Lei Wang, Yan Huo","submitted_at":"2011-12-28T07:13:18Z","abstract_excerpt":"The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find that the time spending for computing the permanent of a sparse matrix by hybrid algorithm is strongly correlated to its permanent value. A strategy is introduced to improve a parallel algorithm for sparse permanent. Methods for approximating permanents, which have been studied extensively, are used to approximate the permanent values of sub-matrices to decide t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6072","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-18T04:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YGdypQhJSAjZbfoMbIXbziY3KXNdlI6gGkEnmabgxSVzQZXkNCWuh0iOQ3fGvqQgvnEgqaxpmDVfmC4gi4YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:47:48.756551Z"},"content_sha256":"37ea951fea2c2d2afec687f5b8f72467946758aaf2cc7a86b915543cf13c4ab9","schema_version":"1.0","event_id":"sha256:37ea951fea2c2d2afec687f5b8f72467946758aaf2cc7a86b915543cf13c4ab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6H5EEE4SFFVID434VFGZW24ZW/bundle.json","state_url":"https://pith.science/pith/V6H5EEE4SFFVID434VFGZW24ZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6H5EEE4SFFVID434VFGZW24ZW/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-06-03T20:47:48Z","links":{"resolver":"https://pith.science/pith/V6H5EEE4SFFVID434VFGZW24ZW","bundle":"https://pith.science/pith/V6H5EEE4SFFVID434VFGZW24ZW/bundle.json","state":"https://pith.science/pith/V6H5EEE4SFFVID434VFGZW24ZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6H5EEE4SFFVID434VFGZW24ZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V6H5EEE4SFFVID434VFGZW24ZW","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":"a7d0a51f3769437d0648a538e534e9a846d31cdbf521f83f8e4183745973ce9a","cross_cats_sorted":["math.CO","physics.chem-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T07:13:18Z","title_canon_sha256":"eecd702b417bd1a2330ec35c17dd787d7b43b8ab7036bb41165c58d2c20c0e14"},"schema_version":"1.0","source":{"id":"1112.6072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6072","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6072v2","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6072","created_at":"2026-05-18T04:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"V6H5EEE4SFFV","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V6H5EEE4SFFVID43","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V6H5EEE4","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:37ea951fea2c2d2afec687f5b8f72467946758aaf2cc7a86b915543cf13c4ab9","target":"graph","created_at":"2026-05-18T04:02:24Z","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 research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find that the time spending for computing the permanent of a sparse matrix by hybrid algorithm is strongly correlated to its permanent value. A strategy is introduced to improve a parallel algorithm for sparse permanent. Methods for approximating permanents, which have been studied extensively, are used to approximate the permanent values of sub-matrices to decide t","authors_text":"Fengshan Bai, Heng Liang, Lei Wang, Yan Huo","cross_cats":["math.CO","physics.chem-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T07:13:18Z","title":"A load balancing strategy for parallel computation of sparse permanents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6072","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:0971257be32b59caf50455782225d47173adde9d1d1f9460d8cf547f36689c74","target":"record","created_at":"2026-05-18T04:02:24Z","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":"a7d0a51f3769437d0648a538e534e9a846d31cdbf521f83f8e4183745973ce9a","cross_cats_sorted":["math.CO","physics.chem-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T07:13:18Z","title_canon_sha256":"eecd702b417bd1a2330ec35c17dd787d7b43b8ab7036bb41165c58d2c20c0e14"},"schema_version":"1.0","source":{"id":"1112.6072","kind":"arxiv","version":2}},"canonical_sha256":"af8fd2109c914b540f9be54a6cdb5ccd83d04d0c9a8e7ca15b90bfb2b72b8928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af8fd2109c914b540f9be54a6cdb5ccd83d04d0c9a8e7ca15b90bfb2b72b8928","first_computed_at":"2026-05-18T04:02:24.847018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:24.847018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5d1HYEUcLy5FK/LLFpu1fSz59JITYNMNrErggtfbvlLMssl1X0rS/qPwYQKq7AStlqfAPmiaJX1vNfJedd38Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:24.847538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0971257be32b59caf50455782225d47173adde9d1d1f9460d8cf547f36689c74","sha256:37ea951fea2c2d2afec687f5b8f72467946758aaf2cc7a86b915543cf13c4ab9"],"state_sha256":"351931fd83218e8f997026a8de68a7c15f106d7f0785c7ac31cec5db89141aac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+R55/BQl9x7xNjtC7xCpLB+LuDEBv/ThSM1pnosa9kHCeX/1zYERaxHg9jOxs2Ke21LmZqipRA8A4Xn9o93BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:47:48.758581Z","bundle_sha256":"dcac5cffdc0208d450c7220cda187b7bbcf0380a8464edac4f87165446cf24ae"}}