{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7LCCJMAWP3YKWB6XMO4UKRWQ3A","short_pith_number":"pith:7LCCJMAW","canonical_record":{"source":{"id":"1707.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T04:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"d36c76789a6703198ce2d1e4f4c67ac91e6bfbf08fb80c59b0f8f0aa50b45eb7","abstract_canon_sha256":"2deccaff294716b925beaea64d529092554dc60ba82358f3e5bb167ce75728ea"},"schema_version":"1.0"},"canonical_sha256":"fac424b0167ef0ab07d763b94546d0d81620aa932078a12bb150ce5ba20fc61e","source":{"kind":"arxiv","id":"1707.01899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01899","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01899v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01899","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LCCJMAWP3YK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LCCJMAWP3YKWB6X","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LCCJMAW","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7LCCJMAWP3YKWB6XMO4UKRWQ3A","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T04:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"d36c76789a6703198ce2d1e4f4c67ac91e6bfbf08fb80c59b0f8f0aa50b45eb7","abstract_canon_sha256":"2deccaff294716b925beaea64d529092554dc60ba82358f3e5bb167ce75728ea"},"schema_version":"1.0"},"canonical_sha256":"fac424b0167ef0ab07d763b94546d0d81620aa932078a12bb150ce5ba20fc61e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.876714Z","signature_b64":"P5MVbOX07VbhAaWg5444rZwK5QcVqzVX7b259/iqwRoOamRIIxe5X6qW+V/eLhgm0eL+JTYbKPXjWVs7KefWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac424b0167ef0ab07d763b94546d0d81620aa932078a12bb150ce5ba20fc61e","last_reissued_at":"2026-05-18T00:40:45.876043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.876043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01899","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-18T00:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZ5nan8k2BByGezIOhQ7wpfNPROSxY1SDVLoCNDd71nuwj6c52mApDmSTMAhOZMJdiNKx7Nrco7ZAmCOYvrpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:07:55.790269Z"},"content_sha256":"5f865b4249a080a2dab1aaab889f279ef43b131023f89f33ddf5044f1a00e629","schema_version":"1.0","event_id":"sha256:5f865b4249a080a2dab1aaab889f279ef43b131023f89f33ddf5044f1a00e629"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7LCCJMAWP3YKWB6XMO4UKRWQ3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Calculation of Bounds for Greedy Algorithms when Applied to Sensor Selection Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingyuan Liu","submitted_at":"2017-07-06T04:59:34Z","abstract_excerpt":"We consider the problem of studying the performance of greedy algorithm on sensor selection problem for stable linear systems with Kalman Filter. Specifically, the objective is to find the system parameters that affects the performance of greedy algorithms and conditions where greedy algorithm always produces optimal solutions. In this paper, we developed an upper bound for performance ratio of greedy algorithm, which is based on the work of Dr.Zhang \\cite{Sundaram} and offers valuable insight into the system parameters that affects the performance of greedy algorithm. We also proposes a set o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01899","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-18T00:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fug5o0MnCC0TKlk21IfjL1qpUwqN18uAB6KF4ehLOsaBShzbx7WUXHkrD7OKxgq1g4C/s+XcG78X0tPAKgj+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:07:55.790641Z"},"content_sha256":"f3f6c30dd062cb8d9215efbe6655163e96bd8632e97b5a7ed43949390cb860f6","schema_version":"1.0","event_id":"sha256:f3f6c30dd062cb8d9215efbe6655163e96bd8632e97b5a7ed43949390cb860f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/bundle.json","state_url":"https://pith.science/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/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-30T11:07:55Z","links":{"resolver":"https://pith.science/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A","bundle":"https://pith.science/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/bundle.json","state":"https://pith.science/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LCCJMAWP3YKWB6XMO4UKRWQ3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7LCCJMAWP3YKWB6XMO4UKRWQ3A","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":"2deccaff294716b925beaea64d529092554dc60ba82358f3e5bb167ce75728ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T04:59:34Z","title_canon_sha256":"d36c76789a6703198ce2d1e4f4c67ac91e6bfbf08fb80c59b0f8f0aa50b45eb7"},"schema_version":"1.0","source":{"id":"1707.01899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01899","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01899v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01899","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LCCJMAWP3YK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LCCJMAWP3YKWB6X","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LCCJMAW","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:f3f6c30dd062cb8d9215efbe6655163e96bd8632e97b5a7ed43949390cb860f6","target":"graph","created_at":"2026-05-18T00:40:45Z","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 consider the problem of studying the performance of greedy algorithm on sensor selection problem for stable linear systems with Kalman Filter. Specifically, the objective is to find the system parameters that affects the performance of greedy algorithms and conditions where greedy algorithm always produces optimal solutions. In this paper, we developed an upper bound for performance ratio of greedy algorithm, which is based on the work of Dr.Zhang \\cite{Sundaram} and offers valuable insight into the system parameters that affects the performance of greedy algorithm. We also proposes a set o","authors_text":"Jingyuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T04:59:34Z","title":"On Calculation of Bounds for Greedy Algorithms when Applied to Sensor Selection Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01899","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:5f865b4249a080a2dab1aaab889f279ef43b131023f89f33ddf5044f1a00e629","target":"record","created_at":"2026-05-18T00:40:45Z","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":"2deccaff294716b925beaea64d529092554dc60ba82358f3e5bb167ce75728ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T04:59:34Z","title_canon_sha256":"d36c76789a6703198ce2d1e4f4c67ac91e6bfbf08fb80c59b0f8f0aa50b45eb7"},"schema_version":"1.0","source":{"id":"1707.01899","kind":"arxiv","version":1}},"canonical_sha256":"fac424b0167ef0ab07d763b94546d0d81620aa932078a12bb150ce5ba20fc61e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fac424b0167ef0ab07d763b94546d0d81620aa932078a12bb150ce5ba20fc61e","first_computed_at":"2026-05-18T00:40:45.876043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:45.876043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5MVbOX07VbhAaWg5444rZwK5QcVqzVX7b259/iqwRoOamRIIxe5X6qW+V/eLhgm0eL+JTYbKPXjWVs7KefWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:45.876714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f865b4249a080a2dab1aaab889f279ef43b131023f89f33ddf5044f1a00e629","sha256:f3f6c30dd062cb8d9215efbe6655163e96bd8632e97b5a7ed43949390cb860f6"],"state_sha256":"42a755a412871f9192a3612f752cffdd577815e6ff73a87df71765cf5799ac43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJmEEoX0xbx3HzbmMvIghFoppyQ4J1jKaKoTU4Jh30zh70o35WoEt03CVFV/d7zrMAMuB9FMr44dxwxK67xaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:07:55.792685Z","bundle_sha256":"afc3b84ce5fcc0e72a79663c985db75d6c593a9d72fc6dc9b6abcc1e91b07aa2"}}