{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3NSYWQQ5NAN2JIQPQSN3EF5YYS","short_pith_number":"pith:3NSYWQQ5","canonical_record":{"source":{"id":"1503.01402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-04T18:03:40Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"816f0e0fdc762ddd3401986c8d4bd870bb5856050e6bed07bf55138a90d28e70","abstract_canon_sha256":"839ecbec1204c6800b86e277a50248ac83ca42ce6557198d3c39144c5a3a4e99"},"schema_version":"1.0"},"canonical_sha256":"db658b421d681ba4a20f849bb217b8c48345af2cc4e456e18f4c0cf9a1a08890","source":{"kind":"arxiv","id":"1503.01402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01402","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01402v1","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01402","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"3NSYWQQ5NAN2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NSYWQQ5NAN2JIQP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NSYWQQ5","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3NSYWQQ5NAN2JIQPQSN3EF5YYS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-04T18:03:40Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"816f0e0fdc762ddd3401986c8d4bd870bb5856050e6bed07bf55138a90d28e70","abstract_canon_sha256":"839ecbec1204c6800b86e277a50248ac83ca42ce6557198d3c39144c5a3a4e99"},"schema_version":"1.0"},"canonical_sha256":"db658b421d681ba4a20f849bb217b8c48345af2cc4e456e18f4c0cf9a1a08890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.630277Z","signature_b64":"H9B+ffSxbXXb1u9M9iq5G7sDYByVNFGHnuw4xgJh9VlxzJbckALQiwa0dpsMKoGTSEBVM1K3AMWNwVO70dhiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db658b421d681ba4a20f849bb217b8c48345af2cc4e456e18f4c0cf9a1a08890","last_reissued_at":"2026-05-18T02:25:34.629731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.629731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01402","source_version":1,"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b49O1xvf9dim+dQeWvii+ZIAt2o7Wf+68NizDvQCB3WEFWTFtLDPGjLXzCH3UEh2su7E/PRGaR9vF3FP8BGaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:56:50.978614Z"},"content_sha256":"70bb41512d70a68bc4428ce67d8ce6f2eaab7d0e7327a04892f7f1f19ebd2d88","schema_version":"1.0","event_id":"sha256:70bb41512d70a68bc4428ce67d8ce6f2eaab7d0e7327a04892f7f1f19ebd2d88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3NSYWQQ5NAN2JIQPQSN3EF5YYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic construction of sparse binary and ternary matrices from existing binary sensing matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"C. S. Sastry, Pradip Sasmal, P. V. Jampana, R. Ramu Naidu","submitted_at":"2015-03-04T18:03:40Z","abstract_excerpt":"In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from $p, p^2, pq$ (for different primes $p,q$) can be constructed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01402","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"},"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZazukZj0eogNlaWJxqKfAkY8cGtFfbN+AC72KQA0Ra7bajgSn6TH0GxMmqJFfP1CrWMOFSDdU2gw3UYHM15oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:56:50.978973Z"},"content_sha256":"1eefae83812b945e73c014b39e35b73f3593794139dab657f71185e423c928d0","schema_version":"1.0","event_id":"sha256:1eefae83812b945e73c014b39e35b73f3593794139dab657f71185e423c928d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/bundle.json","state_url":"https://pith.science/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/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-02T15:56:50Z","links":{"resolver":"https://pith.science/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS","bundle":"https://pith.science/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/bundle.json","state":"https://pith.science/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NSYWQQ5NAN2JIQPQSN3EF5YYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3NSYWQQ5NAN2JIQPQSN3EF5YYS","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":"839ecbec1204c6800b86e277a50248ac83ca42ce6557198d3c39144c5a3a4e99","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-04T18:03:40Z","title_canon_sha256":"816f0e0fdc762ddd3401986c8d4bd870bb5856050e6bed07bf55138a90d28e70"},"schema_version":"1.0","source":{"id":"1503.01402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01402","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01402v1","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01402","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"3NSYWQQ5NAN2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NSYWQQ5NAN2JIQP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NSYWQQ5","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:1eefae83812b945e73c014b39e35b73f3593794139dab657f71185e423c928d0","target":"graph","created_at":"2026-05-18T02:25:34Z","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":"In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from $p, p^2, pq$ (for different primes $p,q$) can be constructed.","authors_text":"C. S. Sastry, Pradip Sasmal, P. V. Jampana, R. Ramu Naidu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-04T18:03:40Z","title":"Deterministic construction of sparse binary and ternary matrices from existing binary sensing matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01402","kind":"arxiv","version":1},"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:70bb41512d70a68bc4428ce67d8ce6f2eaab7d0e7327a04892f7f1f19ebd2d88","target":"record","created_at":"2026-05-18T02:25:34Z","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":"839ecbec1204c6800b86e277a50248ac83ca42ce6557198d3c39144c5a3a4e99","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-04T18:03:40Z","title_canon_sha256":"816f0e0fdc762ddd3401986c8d4bd870bb5856050e6bed07bf55138a90d28e70"},"schema_version":"1.0","source":{"id":"1503.01402","kind":"arxiv","version":1}},"canonical_sha256":"db658b421d681ba4a20f849bb217b8c48345af2cc4e456e18f4c0cf9a1a08890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db658b421d681ba4a20f849bb217b8c48345af2cc4e456e18f4c0cf9a1a08890","first_computed_at":"2026-05-18T02:25:34.629731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.629731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H9B+ffSxbXXb1u9M9iq5G7sDYByVNFGHnuw4xgJh9VlxzJbckALQiwa0dpsMKoGTSEBVM1K3AMWNwVO70dhiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.630277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70bb41512d70a68bc4428ce67d8ce6f2eaab7d0e7327a04892f7f1f19ebd2d88","sha256:1eefae83812b945e73c014b39e35b73f3593794139dab657f71185e423c928d0"],"state_sha256":"a9bb8db15e7d9e8e5158065aaa226b922553ded7e0264340199c94a8cfc80908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YnYhAOWXgiK/sHBRcFM7YDV7+P/Iykew3suMxtUn8Eg6rKgxZhj36xv8USOl+IZtS3GOo2+NhqWgDdJzhWK3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:56:50.980922Z","bundle_sha256":"f781adae5834b23e140403574232e57ef4dd40caf1fdaf13694131c579c366e4"}}