{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GCLSJ7SAMTCZ7MTUK4NOV27BEC","short_pith_number":"pith:GCLSJ7SA","schema_version":"1.0","canonical_sha256":"309724fe4064c59fb274571aeaebe12091bf45563dd828dc2b7927f894b07e66","source":{"kind":"arxiv","id":"1906.12312","version":1},"attestation_state":"computed","paper":{"title":"Two nondeterministic positive definiteness tests for unidiagonal integral matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Mr\\'oz","submitted_at":"2019-06-28T17:18:15Z","abstract_excerpt":"For standard algorithms verifying positive definiteness of a matrix $A\\in\\mathbb{M}_n(\\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms realizing the same task for $A\\in\\mathbb{M}_n(\\mathbb{Z})$, for which the case when $A$ is positive definite is the optimistic one. The algorithms have pessimistic computational complexities $\\mathcal{O}(n^3)$ and $\\mathcal{O}(n^4)$ and they rely on performing certain edge transformations, called inflations, on the edge-bipartite graph (=bigraph) $\\Delta=\\Delta(A)$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.12312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-28T17:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"f9977175d19ace6b7f84a28373216b958f27618d62d59ff1757ca16edbf30559","abstract_canon_sha256":"1d44b8388754140beaba205a6eb09784a74c8a16c3147b89c741c4fb99d5432b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:58.699528Z","signature_b64":"nuSLNiXHjLskys+I/ZfgnC4gICGSOpKCbBpYEBBMRjyjSQIhwafqIlvyLBH1qMAOzKxXhgV4qY/C29xEGIFBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309724fe4064c59fb274571aeaebe12091bf45563dd828dc2b7927f894b07e66","last_reissued_at":"2026-05-17T23:41:58.698903Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:58.698903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two nondeterministic positive definiteness tests for unidiagonal integral matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Mr\\'oz","submitted_at":"2019-06-28T17:18:15Z","abstract_excerpt":"For standard algorithms verifying positive definiteness of a matrix $A\\in\\mathbb{M}_n(\\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms realizing the same task for $A\\in\\mathbb{M}_n(\\mathbb{Z})$, for which the case when $A$ is positive definite is the optimistic one. The algorithms have pessimistic computational complexities $\\mathcal{O}(n^3)$ and $\\mathcal{O}(n^4)$ and they rely on performing certain edge transformations, called inflations, on the edge-bipartite graph (=bigraph) $\\Delta=\\Delta(A)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12312","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.12312","created_at":"2026-05-17T23:41:58.699001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12312v1","created_at":"2026-05-17T23:41:58.699001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12312","created_at":"2026-05-17T23:41:58.699001+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCLSJ7SAMTCZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCLSJ7SAMTCZ7MTU","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCLSJ7SA","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC","json":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC.json","graph_json":"https://pith.science/api/pith-number/GCLSJ7SAMTCZ7MTUK4NOV27BEC/graph.json","events_json":"https://pith.science/api/pith-number/GCLSJ7SAMTCZ7MTUK4NOV27BEC/events.json","paper":"https://pith.science/paper/GCLSJ7SA"},"agent_actions":{"view_html":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC","download_json":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC.json","view_paper":"https://pith.science/paper/GCLSJ7SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12312&json=true","fetch_graph":"https://pith.science/api/pith-number/GCLSJ7SAMTCZ7MTUK4NOV27BEC/graph.json","fetch_events":"https://pith.science/api/pith-number/GCLSJ7SAMTCZ7MTUK4NOV27BEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC/action/storage_attestation","attest_author":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC/action/author_attestation","sign_citation":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC/action/citation_signature","submit_replication":"https://pith.science/pith/GCLSJ7SAMTCZ7MTUK4NOV27BEC/action/replication_record"}},"created_at":"2026-05-17T23:41:58.699001+00:00","updated_at":"2026-05-17T23:41:58.699001+00:00"}