{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MSNMEBCX7S2AJA74ZBJ3P73MPU","short_pith_number":"pith:MSNMEBCX","schema_version":"1.0","canonical_sha256":"649ac20457fcb40483fcc853b7ff6c7d0db9f15877bceb0451b7f390f74d903c","source":{"kind":"arxiv","id":"1407.6710","version":1},"attestation_state":"computed","paper":{"title":"Low-rank approximations for large stationary covariance matrices, as used in the Bayesian and generalized-least-squares analysis of pulsar-timing data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc"],"primary_cat":"astro-ph.IM","authors_text":"Michele Vallisneri, Rutger van Haasteren","submitted_at":"2014-07-24T20:00:15Z","abstract_excerpt":"Many data-analysis problems involve large dense matrices that describe the covariance of stationary noise processes; the computational cost of inverting these matrices, or equivalently of solving linear systems that contain them, is often a practical limit for the analysis. We describe two general, practical, and accurate methods to approximate stationary covariance matrices as low-rank matrix products featuring carefully chosen spectral components. These methods can be used to greatly accelerate data-analysis methods in many contexts, such as the Bayesian and generalized-least-squares analysi"},"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":"1407.6710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2014-07-24T20:00:15Z","cross_cats_sorted":["gr-qc"],"title_canon_sha256":"923d5dbf99c62cf8ef3f10f726f0444b89eb56a4d07fb8271bf0a03165075f60","abstract_canon_sha256":"ad9456643b2b2650a197faa976e2490c3deb23bb011f949d72d7ac2e1132d0b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:32.011538Z","signature_b64":"hS6boPUx5ybmgvKWog0oTdtI4S4a+jfJkXC8zIJTN5fdI0J0rS6f9ow0xAjTpt8Xt7hRrGXahJ3NSwTokbhnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"649ac20457fcb40483fcc853b7ff6c7d0db9f15877bceb0451b7f390f74d903c","last_reissued_at":"2026-05-18T01:42:32.010947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:32.010947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank approximations for large stationary covariance matrices, as used in the Bayesian and generalized-least-squares analysis of pulsar-timing data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc"],"primary_cat":"astro-ph.IM","authors_text":"Michele Vallisneri, Rutger van Haasteren","submitted_at":"2014-07-24T20:00:15Z","abstract_excerpt":"Many data-analysis problems involve large dense matrices that describe the covariance of stationary noise processes; the computational cost of inverting these matrices, or equivalently of solving linear systems that contain them, is often a practical limit for the analysis. We describe two general, practical, and accurate methods to approximate stationary covariance matrices as low-rank matrix products featuring carefully chosen spectral components. These methods can be used to greatly accelerate data-analysis methods in many contexts, such as the Bayesian and generalized-least-squares analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6710","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":"1407.6710","created_at":"2026-05-18T01:42:32.011036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6710v1","created_at":"2026-05-18T01:42:32.011036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6710","created_at":"2026-05-18T01:42:32.011036+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSNMEBCX7S2A","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSNMEBCX7S2AJA74","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSNMEBCX","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.04537","citing_title":"Finding Supermassive Black Hole Binary Mergers in Pulsar Timing Array Data","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU","json":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU.json","graph_json":"https://pith.science/api/pith-number/MSNMEBCX7S2AJA74ZBJ3P73MPU/graph.json","events_json":"https://pith.science/api/pith-number/MSNMEBCX7S2AJA74ZBJ3P73MPU/events.json","paper":"https://pith.science/paper/MSNMEBCX"},"agent_actions":{"view_html":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU","download_json":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU.json","view_paper":"https://pith.science/paper/MSNMEBCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6710&json=true","fetch_graph":"https://pith.science/api/pith-number/MSNMEBCX7S2AJA74ZBJ3P73MPU/graph.json","fetch_events":"https://pith.science/api/pith-number/MSNMEBCX7S2AJA74ZBJ3P73MPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU/action/storage_attestation","attest_author":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU/action/author_attestation","sign_citation":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU/action/citation_signature","submit_replication":"https://pith.science/pith/MSNMEBCX7S2AJA74ZBJ3P73MPU/action/replication_record"}},"created_at":"2026-05-18T01:42:32.011036+00:00","updated_at":"2026-05-18T01:42:32.011036+00:00"}