{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GRJPIUQTNZPRSHOKIZUDLTMWRN","short_pith_number":"pith:GRJPIUQT","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"},"canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","source":{"kind":"arxiv","id":"1709.08740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08740","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08740v1","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08740","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRJPIUQTNZPR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GRJPIUQTNZPRSHOK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GRJPIUQT","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GRJPIUQTNZPRSHOKIZUDLTMWRN","target":"record","payload":{"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"},"canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","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"},"source_kind":"arxiv","source_id":"1709.08740","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:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXYBz9vS7ZrKrZnjfi+vfh8ZypGUosRStr1yGhI50X8N9EV3QaHXhYJaP5WL0GpmTScvhsFrvBCgNPqvXpNDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:42:03.070735Z"},"content_sha256":"db5eefe29abec058a9c8abff3b211705ce31661ac647f121222c894cf1f14ced","schema_version":"1.0","event_id":"sha256:db5eefe29abec058a9c8abff3b211705ce31661ac647f121222c894cf1f14ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GRJPIUQTNZPRSHOKIZUDLTMWRN","target":"graph","payload":{"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"},"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:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ncsvoiV4OmZ9CxCVxqLjmpHHsvMwkTZy4/p8DkN3rip0meAh8JMR463Z5xE1cYZkOh9PCEo3uq2DKR8UjcyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:42:03.071520Z"},"content_sha256":"4370f363a51f9ae254b9fb42733cc25b6ec060c3859a0061e9942b21f305ed1d","schema_version":"1.0","event_id":"sha256:4370f363a51f9ae254b9fb42733cc25b6ec060c3859a0061e9942b21f305ed1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/bundle.json","state_url":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/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-11T18:42:03Z","links":{"resolver":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN","bundle":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/bundle.json","state":"https://pith.science/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRJPIUQTNZPRSHOKIZUDLTMWRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GRJPIUQTNZPRSHOKIZUDLTMWRN","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":"afa18dd137b880e62a3e3e2c9cfd2e13b274babd1c85d9f599df2286953b1a7a","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T22:51:23Z","title_canon_sha256":"65a4a587d9f45b691890c047c6dc7da9adececff09a5a6c6f628108660e45aa7"},"schema_version":"1.0","source":{"id":"1709.08740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08740","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08740v1","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08740","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRJPIUQTNZPR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GRJPIUQTNZPRSHOK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GRJPIUQT","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:4370f363a51f9ae254b9fb42733cc25b6ec060c3859a0061e9942b21f305ed1d","target":"graph","created_at":"2026-05-18T00:34:22Z","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":"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","authors_text":"Franklin H.J. Kenter, Jephian C.-H. Lin","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T22:51:23Z","title":"On the error of a priori sampling: zero forcing sets and propagation time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08740","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:db5eefe29abec058a9c8abff3b211705ce31661ac647f121222c894cf1f14ced","target":"record","created_at":"2026-05-18T00:34:22Z","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":"afa18dd137b880e62a3e3e2c9cfd2e13b274babd1c85d9f599df2286953b1a7a","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T22:51:23Z","title_canon_sha256":"65a4a587d9f45b691890c047c6dc7da9adececff09a5a6c6f628108660e45aa7"},"schema_version":"1.0","source":{"id":"1709.08740","kind":"arxiv","version":1}},"canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3452f452136e5f191dca466835cd968b55f8ea95231e40697ff71dc5a3b4f974","first_computed_at":"2026-05-18T00:34:22.004255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:22.004255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"obFkZU6fIE8p8NI8T78tfJgHXTeYhBYb/Kz1PeBA/VRoVa3WVu9B70Q26Sfg2yvROR1Om45DW01ChSkEEJ2gCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:22.004760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db5eefe29abec058a9c8abff3b211705ce31661ac647f121222c894cf1f14ced","sha256:4370f363a51f9ae254b9fb42733cc25b6ec060c3859a0061e9942b21f305ed1d"],"state_sha256":"f39a63606bdcd66933256278f4bbefa96051ba71689f1c611205d785d6806515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0CqAI/CNxN/yzaz0qGxa2nLvYf2B+lHsbWzC6d/amyR+lQlVlM689HDfiH2/a2RF2pLKEbboxNq29hs/wtIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T18:42:03.076202Z","bundle_sha256":"a84597e1ba1b48d07198c0dd8880b6d33790d45a79e392011156b6ca92cb2f0b"}}