{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3GMFXULD7ZOBHLX3PV3L6L6NTS","short_pith_number":"pith:3GMFXULD","canonical_record":{"source":{"id":"1604.00740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-04T04:43:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"082aefb4274b59707e7638876e3dd1af06d9aaa810f21e009962ee6c8cc2c988","abstract_canon_sha256":"a55b3608c44d0d79d093c23e8bda3557e876af2d73e572866cc62565c46b9768"},"schema_version":"1.0"},"canonical_sha256":"d9985bd163fe5c13aefb7d76bf2fcd9cbf6f3ed5c97659cc4cfe828cc4fcc6b9","source":{"kind":"arxiv","id":"1604.00740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00740","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00740v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00740","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"3GMFXULD7ZOB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3GMFXULD7ZOBHLX3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3GMFXULD","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3GMFXULD7ZOBHLX3PV3L6L6NTS","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-04T04:43:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"082aefb4274b59707e7638876e3dd1af06d9aaa810f21e009962ee6c8cc2c988","abstract_canon_sha256":"a55b3608c44d0d79d093c23e8bda3557e876af2d73e572866cc62565c46b9768"},"schema_version":"1.0"},"canonical_sha256":"d9985bd163fe5c13aefb7d76bf2fcd9cbf6f3ed5c97659cc4cfe828cc4fcc6b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.453068Z","signature_b64":"hRmWvlKCtHutRVkks52KZ6gI/n2dxPOeJQkI9n9axDYQCzNMsc9THp1Fcj7ZkessF0a3An3KLG9wnJW4zN7lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9985bd163fe5c13aefb7d76bf2fcd9cbf6f3ed5c97659cc4cfe828cc4fcc6b9","last_reissued_at":"2026-05-18T01:17:48.452254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.452254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00740","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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+X7gGj2TALXk7IWG0qbLOqZUkvL+4exflp6JF/v4j2lizOH8mPQHHWRlvHT1XUAUe3nYFj3jmr+Zno2khZrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:02:37.112987Z"},"content_sha256":"4059afe9771a687e69bb8b9d3f7ee2c345972a82de464d0162af3b1c8b475b55","schema_version":"1.0","event_id":"sha256:4059afe9771a687e69bb8b9d3f7ee2c345972a82de464d0162af3b1c8b475b55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3GMFXULD7ZOBHLX3PV3L6L6NTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizations of the Connected Forcing Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov, Randy Davila","submitted_at":"2016-04-04T04:43:37Z","abstract_excerpt":"Zero forcing is a dynamic graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. This forcing process has been used to approximate certain linear algebraic parameters, as well as to model the spread of diseases and information in social networks. In this paper, we introduce and study the connected forcing process -- a restriction of zero forcing in which the initially colored set of vertices induces a connected subgraph. We show that the connected forcing number -- the cardinality of the smallest initially colored vertex set which f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00740","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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Brgs/vncP5lDQKVd2SE47HBXP2N0gPFr1+0QLdXqOoVQilXCTYSSV7Pli0c6fUUeW06ilzJoSnz4+uEq1yCWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:02:37.113387Z"},"content_sha256":"93e8735dc8366800a19693974baad1614f2973281a5ed08dff046f0f45c35503","schema_version":"1.0","event_id":"sha256:93e8735dc8366800a19693974baad1614f2973281a5ed08dff046f0f45c35503"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/bundle.json","state_url":"https://pith.science/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/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-30T07:02:37Z","links":{"resolver":"https://pith.science/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS","bundle":"https://pith.science/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/bundle.json","state":"https://pith.science/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GMFXULD7ZOBHLX3PV3L6L6NTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3GMFXULD7ZOBHLX3PV3L6L6NTS","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":"a55b3608c44d0d79d093c23e8bda3557e876af2d73e572866cc62565c46b9768","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-04T04:43:37Z","title_canon_sha256":"082aefb4274b59707e7638876e3dd1af06d9aaa810f21e009962ee6c8cc2c988"},"schema_version":"1.0","source":{"id":"1604.00740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00740","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00740v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00740","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"3GMFXULD7ZOB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3GMFXULD7ZOBHLX3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3GMFXULD","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:93e8735dc8366800a19693974baad1614f2973281a5ed08dff046f0f45c35503","target":"graph","created_at":"2026-05-18T01:17:48Z","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 a dynamic graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. This forcing process has been used to approximate certain linear algebraic parameters, as well as to model the spread of diseases and information in social networks. In this paper, we introduce and study the connected forcing process -- a restriction of zero forcing in which the initially colored set of vertices induces a connected subgraph. We show that the connected forcing number -- the cardinality of the smallest initially colored vertex set which f","authors_text":"Boris Brimkov, Randy Davila","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-04T04:43:37Z","title":"Characterizations of the Connected Forcing Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00740","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:4059afe9771a687e69bb8b9d3f7ee2c345972a82de464d0162af3b1c8b475b55","target":"record","created_at":"2026-05-18T01:17:48Z","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":"a55b3608c44d0d79d093c23e8bda3557e876af2d73e572866cc62565c46b9768","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-04T04:43:37Z","title_canon_sha256":"082aefb4274b59707e7638876e3dd1af06d9aaa810f21e009962ee6c8cc2c988"},"schema_version":"1.0","source":{"id":"1604.00740","kind":"arxiv","version":1}},"canonical_sha256":"d9985bd163fe5c13aefb7d76bf2fcd9cbf6f3ed5c97659cc4cfe828cc4fcc6b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9985bd163fe5c13aefb7d76bf2fcd9cbf6f3ed5c97659cc4cfe828cc4fcc6b9","first_computed_at":"2026-05-18T01:17:48.452254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:48.452254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hRmWvlKCtHutRVkks52KZ6gI/n2dxPOeJQkI9n9axDYQCzNMsc9THp1Fcj7ZkessF0a3An3KLG9wnJW4zN7lDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:48.453068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4059afe9771a687e69bb8b9d3f7ee2c345972a82de464d0162af3b1c8b475b55","sha256:93e8735dc8366800a19693974baad1614f2973281a5ed08dff046f0f45c35503"],"state_sha256":"aa96e99b0148e4f6e905da459c472cf0155125b788335b6a36edced968142b4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OMQnvDzp+M2iXy8h/CAJABlZIY42vv6cqCQyReU+miXoLV2lnCYV2D7ydvKNGKzTTf0M1eKCYI4LjrCapOFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:02:37.115801Z","bundle_sha256":"c29c38076e51ee09213b4e6ca9d87407bf3a1499e0131e63262025099ab128b2"}}