{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GRJPIUQTNZPRSHOKIZUDLTMWRN","short_pith_number":"pith:GRJPIUQT","schema_version":"1.0","canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","source":{"kind":"arxiv","id":"1709.08740","version":1},"attestation_state":"computed","paper":{"title":"On the error of a priori sampling: zero forcing sets and propagation time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Franklin H.J. Kenter, Jephian C.-H. Lin","submitted_at":"2017-09-25T22:51:23Z","abstract_excerpt":"Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored under a specific color change rule. The goal is to find a minimum set of vertices such that after iteratively applying the rule, all of the vertices become colored (i.e., a minimum zero forcing set). Of particular interest is the propagation time of a chosen set which is the number of steps the rule must be applied in order to color all the vertices of a graph.\n  We give a purely linear algebraic interpretation of z"},"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":"1709.08740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T22:51:23Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"65a4a587d9f45b691890c047c6dc7da9adececff09a5a6c6f628108660e45aa7","abstract_canon_sha256":"afa18dd137b880e62a3e3e2c9cfd2e13b274babd1c85d9f599df2286953b1a7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:22.004760Z","signature_b64":"obFkZU6fIE8p8NI8T78tfJgHXTeYhBYb/Kz1PeBA/VRoVa3WVu9B70Q26Sfg2yvROR1Om45DW01ChSkEEJ2gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","last_reissued_at":"2026-05-18T00:34:22.004255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:22.004255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the error of a priori sampling: zero forcing sets and propagation time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Franklin H.J. Kenter, Jephian C.-H. Lin","submitted_at":"2017-09-25T22:51:23Z","abstract_excerpt":"Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored under a specific color change rule. The goal is to find a minimum set of vertices such that after iteratively applying the rule, all of the vertices become colored (i.e., a minimum zero forcing set). Of particular interest is the propagation time of a chosen set which is the number of steps the rule must be applied in order to color all the vertices of a graph.\n  We give a purely linear algebraic interpretation of z"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08740","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":"1709.08740","created_at":"2026-05-18T00:34:22.004323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08740v1","created_at":"2026-05-18T00:34:22.004323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08740","created_at":"2026-05-18T00:34:22.004323+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRJPIUQTNZPR","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRJPIUQTNZPRSHOK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRJPIUQT","created_at":"2026-05-18T12:31:18.294218+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/GRJPIUQTNZPRSHOKIZUDLTMWRN","json":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN.json","graph_json":"https://pith.science/api/pith-number/GRJPIUQTNZPRSHOKIZUDLTMWRN/graph.json","events_json":"https://pith.science/api/pith-number/GRJPIUQTNZPRSHOKIZUDLTMWRN/events.json","paper":"https://pith.science/paper/GRJPIUQT"},"agent_actions":{"view_html":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN","download_json":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN.json","view_paper":"https://pith.science/paper/GRJPIUQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08740&json=true","fetch_graph":"https://pith.science/api/pith-number/GRJPIUQTNZPRSHOKIZUDLTMWRN/graph.json","fetch_events":"https://pith.science/api/pith-number/GRJPIUQTNZPRSHOKIZUDLTMWRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/action/storage_attestation","attest_author":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/action/author_attestation","sign_citation":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/action/citation_signature","submit_replication":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/action/replication_record"}},"created_at":"2026-05-18T00:34:22.004323+00:00","updated_at":"2026-05-18T00:34:22.004323+00:00"}