{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UGREWWPXHZOKOVJTUFMICW43TU","short_pith_number":"pith:UGREWWPX","canonical_record":{"source":{"id":"1908.06371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-18T04:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"a80bdced328946681a119551c37c9685bf95709724a527a37eb754a52d884a51","abstract_canon_sha256":"898b270681f5813e28f4a692c070490bd13ce48bfb61b0ed839e1c8bd628a20d"},"schema_version":"1.0"},"canonical_sha256":"a1a24b59f73e5ca75533a158815b9b9d16391809efff4c2a5d9e22baed946a3f","source":{"kind":"arxiv","id":"1908.06371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06371","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06371v2","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06371","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"UGREWWPXHZOK","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_16","alias_value":"UGREWWPXHZOKOVJT","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_8","alias_value":"UGREWWPX","created_at":"2026-07-05T01:25:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UGREWWPXHZOKOVJTUFMICW43TU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-18T04:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"a80bdced328946681a119551c37c9685bf95709724a527a37eb754a52d884a51","abstract_canon_sha256":"898b270681f5813e28f4a692c070490bd13ce48bfb61b0ed839e1c8bd628a20d"},"schema_version":"1.0"},"canonical_sha256":"a1a24b59f73e5ca75533a158815b9b9d16391809efff4c2a5d9e22baed946a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:22.380387Z","signature_b64":"nVeHcZYLN+piEm4R/PbpUC5+XZ4lECaGyXqfrNRubuE1u8S11scPQR+W7m4KIK+8VSkq0AUULRRgd18gRwuZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1a24b59f73e5ca75533a158815b9b9d16391809efff4c2a5d9e22baed946a3f","last_reissued_at":"2026-07-05T01:25:22.379995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:22.379995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06371","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-07-05T01:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpPySsq7UuUjmfc1YMlaHeusszswEpSTBNV+jAbTdQCbCZ28+zDP9IQzdcWzD5GwYstH9jofCwR+Qe48jkOdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:13:26.680132Z"},"content_sha256":"7ecae76799e6f5287d27c68480eac339d5de65d9d0863c973486aac36dc78370","schema_version":"1.0","event_id":"sha256:7ecae76799e6f5287d27c68480eac339d5de65d9d0863c973486aac36dc78370"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UGREWWPXHZOKOVJTUFMICW43TU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Fast Computation of a Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jianghua Zheng, Shenghui Su, Shuwang L\\\"u, Xuewei Niu","submitted_at":"2019-08-18T04:02:26Z","abstract_excerpt":"This paper proposes a general algorithm called Store-zechin for quickly computing the permanent of an arbitrary square matrix. Its key idea is storage, multiplexing, and recursion. That is, in a recursive process, some sub-terms which have already been calculated are no longer calculated, but are directly substituted with the previous calculation results. The new algorithm utilizes sufficiently computer memories and stored data to speed the computation of a permanent. The Analyses show that computating the permanent of an n * n matrix by Store-zechin requires (2^(n - 1)- 1)n multiplications an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06371","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06371/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-05T01:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25OJOGBMILznWAhUEyp/WMpQPgnMb+RPh8HZ7qSvrPcdLn+Hm7BoB1FCv7p7MuC8wKqV0mxdwbrteDVgHdwNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:13:26.680935Z"},"content_sha256":"5a1f048b5721cb522d7c01bca73b3f88baed597ce56a0f9c9f5a851fb250b43e","schema_version":"1.0","event_id":"sha256:5a1f048b5721cb522d7c01bca73b3f88baed597ce56a0f9c9f5a851fb250b43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGREWWPXHZOKOVJTUFMICW43TU/bundle.json","state_url":"https://pith.science/pith/UGREWWPXHZOKOVJTUFMICW43TU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGREWWPXHZOKOVJTUFMICW43TU/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-21T23:13:26Z","links":{"resolver":"https://pith.science/pith/UGREWWPXHZOKOVJTUFMICW43TU","bundle":"https://pith.science/pith/UGREWWPXHZOKOVJTUFMICW43TU/bundle.json","state":"https://pith.science/pith/UGREWWPXHZOKOVJTUFMICW43TU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGREWWPXHZOKOVJTUFMICW43TU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UGREWWPXHZOKOVJTUFMICW43TU","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":"898b270681f5813e28f4a692c070490bd13ce48bfb61b0ed839e1c8bd628a20d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-18T04:02:26Z","title_canon_sha256":"a80bdced328946681a119551c37c9685bf95709724a527a37eb754a52d884a51"},"schema_version":"1.0","source":{"id":"1908.06371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06371","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06371v2","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06371","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"UGREWWPXHZOK","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_16","alias_value":"UGREWWPXHZOKOVJT","created_at":"2026-07-05T01:25:22Z"},{"alias_kind":"pith_short_8","alias_value":"UGREWWPX","created_at":"2026-07-05T01:25:22Z"}],"graph_snapshots":[{"event_id":"sha256:5a1f048b5721cb522d7c01bca73b3f88baed597ce56a0f9c9f5a851fb250b43e","target":"graph","created_at":"2026-07-05T01:25:22Z","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/1908.06371/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a general algorithm called Store-zechin for quickly computing the permanent of an arbitrary square matrix. Its key idea is storage, multiplexing, and recursion. That is, in a recursive process, some sub-terms which have already been calculated are no longer calculated, but are directly substituted with the previous calculation results. The new algorithm utilizes sufficiently computer memories and stored data to speed the computation of a permanent. The Analyses show that computating the permanent of an n * n matrix by Store-zechin requires (2^(n - 1)- 1)n multiplications an","authors_text":"Jianghua Zheng, Shenghui Su, Shuwang L\\\"u, Xuewei Niu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-18T04:02:26Z","title":"A New Fast Computation of a Permanent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06371","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:7ecae76799e6f5287d27c68480eac339d5de65d9d0863c973486aac36dc78370","target":"record","created_at":"2026-07-05T01:25:22Z","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":"898b270681f5813e28f4a692c070490bd13ce48bfb61b0ed839e1c8bd628a20d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-18T04:02:26Z","title_canon_sha256":"a80bdced328946681a119551c37c9685bf95709724a527a37eb754a52d884a51"},"schema_version":"1.0","source":{"id":"1908.06371","kind":"arxiv","version":2}},"canonical_sha256":"a1a24b59f73e5ca75533a158815b9b9d16391809efff4c2a5d9e22baed946a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1a24b59f73e5ca75533a158815b9b9d16391809efff4c2a5d9e22baed946a3f","first_computed_at":"2026-07-05T01:25:22.379995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:22.379995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nVeHcZYLN+piEm4R/PbpUC5+XZ4lECaGyXqfrNRubuE1u8S11scPQR+W7m4KIK+8VSkq0AUULRRgd18gRwuZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:22.380387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ecae76799e6f5287d27c68480eac339d5de65d9d0863c973486aac36dc78370","sha256:5a1f048b5721cb522d7c01bca73b3f88baed597ce56a0f9c9f5a851fb250b43e"],"state_sha256":"ff05125d9f888f116d0de4fcf42d294fc2a8d3f8d6d092dd41c2cadea9851660"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hR5zhJY2eLmkEWVsWAsa7hZ7BXSflrvRZWxN0ueaGogpVzGMYzAuo6+mL2LIfp6sQtuGuBiBDT0JeMMDplEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:13:26.689173Z","bundle_sha256":"58e8735d577db1a745b2733b9ebb74a2bec8bc177fb28404f0e8eae2a19a1b22"}}