{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EKPGVI266R5MSVSI5L62EURD6W","short_pith_number":"pith:EKPGVI26","canonical_record":{"source":{"id":"1512.03531","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T05:47:56Z","cross_cats_sorted":["cs.DS","math.AC","math.RT"],"title_canon_sha256":"56d17efae6cb0daa4abfdd954200b696ece205e9b264402e9b573ef8a2b4f47e","abstract_canon_sha256":"524306e16b1e73b857c991b9124c05ac983c09dd44da9ced16ae3eb4d5e0f6f9"},"schema_version":"1.0"},"canonical_sha256":"229e6aa35ef47ac95648eafda25223f58a131c4d6e45935fe3f17dcf628a8380","source":{"kind":"arxiv","id":"1512.03531","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03531","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03531v6","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03531","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"EKPGVI266R5M","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKPGVI266R5MSVSI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKPGVI26","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EKPGVI266R5MSVSI5L62EURD6W","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03531","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T05:47:56Z","cross_cats_sorted":["cs.DS","math.AC","math.RT"],"title_canon_sha256":"56d17efae6cb0daa4abfdd954200b696ece205e9b264402e9b573ef8a2b4f47e","abstract_canon_sha256":"524306e16b1e73b857c991b9124c05ac983c09dd44da9ced16ae3eb4d5e0f6f9"},"schema_version":"1.0"},"canonical_sha256":"229e6aa35ef47ac95648eafda25223f58a131c4d6e45935fe3f17dcf628a8380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:31.939050Z","signature_b64":"ki+T1JF91HBcQJTCn6XPCf4HYzbTcO5+kC6iedWkrsFjhppqY3CNjOunrRVUiGs66hUo9Z/8FM3mgzGwqo1iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229e6aa35ef47ac95648eafda25223f58a131c4d6e45935fe3f17dcf628a8380","last_reissued_at":"2026-05-18T00:24:31.938463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:31.938463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03531","source_version":6,"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRmLB0+9tmOKs0LGFNsbN2B0uYA7d0pBDJWMV1KIUuSPnR7KsS4HmWHX9eq15H5JBx1nmGtJ7hkrQAHvlX0PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:29:40.551655Z"},"content_sha256":"41597370b2ba84fc0b29c6e0e6cd1c7e5e4bc8b083b44ff78fddb46114e9e4d0","schema_version":"1.0","event_id":"sha256:41597370b2ba84fc0b29c6e0e6cd1c7e5e4bc8b083b44ff78fddb46114e9e4d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EKPGVI266R5MSVSI5L62EURD6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructive noncommutative rank computation is in deterministic polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AC","math.RT"],"primary_cat":"cs.CC","authors_text":"G\\'abor Ivanyos, K. V. Subrahmanyam, Youming Qiao","submitted_at":"2015-12-11T05:47:56Z","abstract_excerpt":"We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with certificates of linear spaces of matrices over sufficiently large base fields.\n  The key new idea is a reduction procedure that keeps the blow-up parameter small, and there are two methods to implement this idea: the first one is a greedy argument that removes certain rows and columns, and the second one is an efficient algorithmic version of a result of Derksen an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03531","kind":"arxiv","version":6},"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0KR1N75XlfUyyNSXYDVYWl+Q/xwpscWNHnGjJCkGZKXow697rh1cklWhoc4q3lt085mdCtKoZHHzXEF0EWcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:29:40.552358Z"},"content_sha256":"6d552f237ebab90c6bd19ae55b7f51a61a2e0e04af4a958c44e5c3b3343ceb80","schema_version":"1.0","event_id":"sha256:6d552f237ebab90c6bd19ae55b7f51a61a2e0e04af4a958c44e5c3b3343ceb80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKPGVI266R5MSVSI5L62EURD6W/bundle.json","state_url":"https://pith.science/pith/EKPGVI266R5MSVSI5L62EURD6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKPGVI266R5MSVSI5L62EURD6W/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-05-29T15:29:40Z","links":{"resolver":"https://pith.science/pith/EKPGVI266R5MSVSI5L62EURD6W","bundle":"https://pith.science/pith/EKPGVI266R5MSVSI5L62EURD6W/bundle.json","state":"https://pith.science/pith/EKPGVI266R5MSVSI5L62EURD6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKPGVI266R5MSVSI5L62EURD6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EKPGVI266R5MSVSI5L62EURD6W","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":"524306e16b1e73b857c991b9124c05ac983c09dd44da9ced16ae3eb4d5e0f6f9","cross_cats_sorted":["cs.DS","math.AC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T05:47:56Z","title_canon_sha256":"56d17efae6cb0daa4abfdd954200b696ece205e9b264402e9b573ef8a2b4f47e"},"schema_version":"1.0","source":{"id":"1512.03531","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03531","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03531v6","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03531","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"EKPGVI266R5M","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKPGVI266R5MSVSI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKPGVI26","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:6d552f237ebab90c6bd19ae55b7f51a61a2e0e04af4a958c44e5c3b3343ceb80","target":"graph","created_at":"2026-05-18T00:24:31Z","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":"We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with certificates of linear spaces of matrices over sufficiently large base fields.\n  The key new idea is a reduction procedure that keeps the blow-up parameter small, and there are two methods to implement this idea: the first one is a greedy argument that removes certain rows and columns, and the second one is an efficient algorithmic version of a result of Derksen an","authors_text":"G\\'abor Ivanyos, K. V. Subrahmanyam, Youming Qiao","cross_cats":["cs.DS","math.AC","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T05:47:56Z","title":"Constructive noncommutative rank computation is in deterministic polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03531","kind":"arxiv","version":6},"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:41597370b2ba84fc0b29c6e0e6cd1c7e5e4bc8b083b44ff78fddb46114e9e4d0","target":"record","created_at":"2026-05-18T00:24:31Z","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":"524306e16b1e73b857c991b9124c05ac983c09dd44da9ced16ae3eb4d5e0f6f9","cross_cats_sorted":["cs.DS","math.AC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-11T05:47:56Z","title_canon_sha256":"56d17efae6cb0daa4abfdd954200b696ece205e9b264402e9b573ef8a2b4f47e"},"schema_version":"1.0","source":{"id":"1512.03531","kind":"arxiv","version":6}},"canonical_sha256":"229e6aa35ef47ac95648eafda25223f58a131c4d6e45935fe3f17dcf628a8380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229e6aa35ef47ac95648eafda25223f58a131c4d6e45935fe3f17dcf628a8380","first_computed_at":"2026-05-18T00:24:31.938463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:31.938463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ki+T1JF91HBcQJTCn6XPCf4HYzbTcO5+kC6iedWkrsFjhppqY3CNjOunrRVUiGs66hUo9Z/8FM3mgzGwqo1iBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:31.939050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03531","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41597370b2ba84fc0b29c6e0e6cd1c7e5e4bc8b083b44ff78fddb46114e9e4d0","sha256:6d552f237ebab90c6bd19ae55b7f51a61a2e0e04af4a958c44e5c3b3343ceb80"],"state_sha256":"952d7e183817b6473cb39f438e3405a589f220d86143dfe5d95ade4eacea0536"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mr+XHV/Jrz20ubBuhUXupjU4PmAqQUrJ0nuYjNITJKRYS5soN2ullmZ9Y3WGajOCbdtj5t82e7A0NIk+5RVRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:29:40.555996Z","bundle_sha256":"e5b799a02e152c41d968cc6306f624a5fc0c98519c8c7974545146a622654ab4"}}